./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label59_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_279171ff-73df-4ce4-9913-88a4ba393ed0/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_279171ff-73df-4ce4-9913-88a4ba393ed0/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_279171ff-73df-4ce4-9913-88a4ba393ed0/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_279171ff-73df-4ce4-9913-88a4ba393ed0/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label59_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_279171ff-73df-4ce4-9913-88a4ba393ed0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_279171ff-73df-4ce4-9913-88a4ba393ed0/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 22ec766384c93b05d1b8a0b6b07fbbb9335a4030 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 19:26:40,637 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:26:40,638 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:26:40,644 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:26:40,644 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:26:40,645 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:26:40,645 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:26:40,646 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:26:40,647 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:26:40,647 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:26:40,648 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:26:40,648 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:26:40,648 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:26:40,649 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:26:40,649 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:26:40,650 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:26:40,650 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:26:40,651 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:26:40,652 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:26:40,652 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:26:40,653 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:26:40,653 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:26:40,654 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:26:40,655 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:26:40,655 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:26:40,655 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:26:40,656 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:26:40,656 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:26:40,656 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:26:40,657 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:26:40,657 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:26:40,657 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:26:40,657 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:26:40,657 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:26:40,658 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:26:40,658 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:26:40,658 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_279171ff-73df-4ce4-9913-88a4ba393ed0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 19:26:40,665 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:26:40,665 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:26:40,666 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:26:40,666 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:26:40,666 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:26:40,666 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:26:40,666 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:26:40,666 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:26:40,666 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:26:40,667 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:26:40,667 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:26:40,667 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:26:40,667 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:26:40,667 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:26:40,667 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:26:40,667 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:26:40,667 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:26:40,668 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:26:40,668 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:26:40,668 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:26:40,668 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:26:40,668 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:26:40,668 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:26:40,668 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:26:40,668 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:26:40,668 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:26:40,668 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:26:40,668 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:26:40,669 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:26:40,669 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:26:40,669 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:26:40,669 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:26:40,669 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:26:40,669 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:26:40,669 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:26:40,669 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:26:40,669 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_279171ff-73df-4ce4-9913-88a4ba393ed0/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 -> 22ec766384c93b05d1b8a0b6b07fbbb9335a4030 [2018-12-09 19:26:40,686 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:26:40,693 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:26:40,696 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:26:40,697 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:26:40,698 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:26:40,698 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_279171ff-73df-4ce4-9913-88a4ba393ed0/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label59_false-unreach-call_false-termination.c [2018-12-09 19:26:40,735 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_279171ff-73df-4ce4-9913-88a4ba393ed0/bin-2019/utaipan/data/11f95409f/912356a9adb240caa11a0120fd9294ca/FLAGdbfc38add [2018-12-09 19:26:41,076 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:26:41,076 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_279171ff-73df-4ce4-9913-88a4ba393ed0/sv-benchmarks/c/eca-rers2012/Problem02_label59_false-unreach-call_false-termination.c [2018-12-09 19:26:41,085 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_279171ff-73df-4ce4-9913-88a4ba393ed0/bin-2019/utaipan/data/11f95409f/912356a9adb240caa11a0120fd9294ca/FLAGdbfc38add [2018-12-09 19:26:41,097 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_279171ff-73df-4ce4-9913-88a4ba393ed0/bin-2019/utaipan/data/11f95409f/912356a9adb240caa11a0120fd9294ca [2018-12-09 19:26:41,100 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:26:41,101 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:26:41,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:26:41,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:26:41,105 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:26:41,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:26:41" (1/1) ... [2018-12-09 19:26:41,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54724d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:41, skipping insertion in model container [2018-12-09 19:26:41,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:26:41" (1/1) ... [2018-12-09 19:26:41,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:26:41,141 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:26:41,328 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:26:41,331 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:26:41,428 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:26:41,437 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:26:41,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:41 WrapperNode [2018-12-09 19:26:41,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:26:41,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:26:41,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:26:41,438 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:26:41,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:41" (1/1) ... [2018-12-09 19:26:41,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:41" (1/1) ... [2018-12-09 19:26:41,456 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:26:41,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:26:41,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:26:41,457 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:26:41,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:41" (1/1) ... [2018-12-09 19:26:41,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:41" (1/1) ... [2018-12-09 19:26:41,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:41" (1/1) ... [2018-12-09 19:26:41,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:41" (1/1) ... [2018-12-09 19:26:41,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:41" (1/1) ... [2018-12-09 19:26:41,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:41" (1/1) ... [2018-12-09 19:26:41,490 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:41" (1/1) ... [2018-12-09 19:26:41,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:26:41,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:26:41,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:26:41,494 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:26:41,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_279171ff-73df-4ce4-9913-88a4ba393ed0/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:26:41,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 19:26:41,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 19:26:41,528 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-09 19:26:41,528 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-09 19:26:41,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:26:41,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:26:41,528 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 19:26:41,528 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 19:26:42,112 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:26:42,113 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 19:26:42,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:26:42 BoogieIcfgContainer [2018-12-09 19:26:42,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:26:42,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:26:42,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:26:42,117 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:26:42,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:26:41" (1/3) ... [2018-12-09 19:26:42,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520b3e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:26:42, skipping insertion in model container [2018-12-09 19:26:42,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:41" (2/3) ... [2018-12-09 19:26:42,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520b3e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:26:42, skipping insertion in model container [2018-12-09 19:26:42,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:26:42" (3/3) ... [2018-12-09 19:26:42,119 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label59_false-unreach-call_false-termination.c [2018-12-09 19:26:42,128 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:26:42,135 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 19:26:42,149 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 19:26:42,176 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:26:42,176 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:26:42,176 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:26:42,176 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:26:42,176 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:26:42,176 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:26:42,177 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:26:42,177 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:26:42,192 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2018-12-09 19:26:42,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 19:26:42,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:42,198 INFO L402 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, 1, 1, 1, 1, 1, 1] [2018-12-09 19:26:42,199 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:42,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:42,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1246520719, now seen corresponding path program 1 times [2018-12-09 19:26:42,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:42,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:42,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:42,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:42,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:42,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:26:42,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:42,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:26:42,431 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:42,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:26:42,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:26:42,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:26:42,448 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2018-12-09 19:26:42,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:42,864 INFO L93 Difference]: Finished difference Result 624 states and 1069 transitions. [2018-12-09 19:26:42,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:26:42,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-12-09 19:26:42,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:42,873 INFO L225 Difference]: With dead ends: 624 [2018-12-09 19:26:42,874 INFO L226 Difference]: Without dead ends: 326 [2018-12-09 19:26:42,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:26:42,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-12-09 19:26:42,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 321. [2018-12-09 19:26:42,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-12-09 19:26:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 467 transitions. [2018-12-09 19:26:42,913 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 467 transitions. Word has length 89 [2018-12-09 19:26:42,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:42,913 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 467 transitions. [2018-12-09 19:26:42,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:26:42,913 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 467 transitions. [2018-12-09 19:26:42,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 19:26:42,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:42,916 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:26:42,916 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:42,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:42,916 INFO L82 PathProgramCache]: Analyzing trace with hash 784816566, now seen corresponding path program 1 times [2018-12-09 19:26:42,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:42,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:42,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:42,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:42,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:42,985 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:26:42,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:42,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:26:42,986 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:42,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:26:42,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:26:42,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:26:42,987 INFO L87 Difference]: Start difference. First operand 321 states and 467 transitions. Second operand 3 states. [2018-12-09 19:26:43,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:43,299 INFO L93 Difference]: Finished difference Result 927 states and 1371 transitions. [2018-12-09 19:26:43,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:26:43,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-12-09 19:26:43,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:43,304 INFO L225 Difference]: With dead ends: 927 [2018-12-09 19:26:43,304 INFO L226 Difference]: Without dead ends: 612 [2018-12-09 19:26:43,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:26:43,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-12-09 19:26:43,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2018-12-09 19:26:43,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-12-09 19:26:43,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 797 transitions. [2018-12-09 19:26:43,328 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 797 transitions. Word has length 97 [2018-12-09 19:26:43,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:43,328 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 797 transitions. [2018-12-09 19:26:43,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:26:43,328 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 797 transitions. [2018-12-09 19:26:43,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:26:43,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:43,331 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:26:43,331 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:43,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:43,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1229109032, now seen corresponding path program 1 times [2018-12-09 19:26:43,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:43,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:43,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:43,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:43,333 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:43,433 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:26:43,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:26:43,434 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:26:43,434 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 103 with the following transitions: [2018-12-09 19:26:43,436 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [391], [393], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-09 19:26:43,461 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:26:43,461 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:26:43,777 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:26:43,778 INFO L272 AbstractInterpreter]: Visited 93 different actions 179 times. Merged at 4 different actions 4 times. Never widened. Performed 2173 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2173 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-12-09 19:26:43,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:43,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:26:43,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:26:43,786 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_279171ff-73df-4ce4-9913-88a4ba393ed0/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:26:43,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:43,793 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:26:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:43,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:26:43,875 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:26:43,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:26:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:26:43,934 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:26:43,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2018-12-09 19:26:43,934 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:43,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:26:43,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:26:43,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:26:43,935 INFO L87 Difference]: Start difference. First operand 612 states and 797 transitions. Second operand 3 states. [2018-12-09 19:26:44,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:44,211 INFO L93 Difference]: Finished difference Result 1653 states and 2210 transitions. [2018-12-09 19:26:44,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:26:44,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-12-09 19:26:44,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:44,214 INFO L225 Difference]: With dead ends: 1653 [2018-12-09 19:26:44,214 INFO L226 Difference]: Without dead ends: 901 [2018-12-09 19:26:44,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:26:44,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2018-12-09 19:26:44,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 898. [2018-12-09 19:26:44,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 898 states. [2018-12-09 19:26:44,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1122 transitions. [2018-12-09 19:26:44,231 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1122 transitions. Word has length 102 [2018-12-09 19:26:44,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:44,231 INFO L480 AbstractCegarLoop]: Abstraction has 898 states and 1122 transitions. [2018-12-09 19:26:44,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:26:44,231 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1122 transitions. [2018-12-09 19:26:44,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 19:26:44,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:44,233 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:26:44,233 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:44,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:44,233 INFO L82 PathProgramCache]: Analyzing trace with hash -4952584, now seen corresponding path program 1 times [2018-12-09 19:26:44,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:44,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:44,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:44,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:44,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:44,291 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:26:44,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:44,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:26:44,292 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:44,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:26:44,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:26:44,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:26:44,293 INFO L87 Difference]: Start difference. First operand 898 states and 1122 transitions. Second operand 6 states. [2018-12-09 19:26:44,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:44,769 INFO L93 Difference]: Finished difference Result 2418 states and 3157 transitions. [2018-12-09 19:26:44,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:26:44,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2018-12-09 19:26:44,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:44,776 INFO L225 Difference]: With dead ends: 2418 [2018-12-09 19:26:44,776 INFO L226 Difference]: Without dead ends: 1526 [2018-12-09 19:26:44,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:26:44,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2018-12-09 19:26:44,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1503. [2018-12-09 19:26:44,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2018-12-09 19:26:44,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1941 transitions. [2018-12-09 19:26:44,817 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1941 transitions. Word has length 110 [2018-12-09 19:26:44,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:44,817 INFO L480 AbstractCegarLoop]: Abstraction has 1503 states and 1941 transitions. [2018-12-09 19:26:44,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:26:44,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1941 transitions. [2018-12-09 19:26:44,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 19:26:44,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:44,820 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:26:44,820 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:44,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:44,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1989299795, now seen corresponding path program 1 times [2018-12-09 19:26:44,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:44,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:44,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:44,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:44,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:44,878 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:26:44,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:44,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:26:44,878 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:44,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:26:44,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:26:44,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:26:44,879 INFO L87 Difference]: Start difference. First operand 1503 states and 1941 transitions. Second operand 6 states. [2018-12-09 19:26:45,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:45,300 INFO L93 Difference]: Finished difference Result 4084 states and 5591 transitions. [2018-12-09 19:26:45,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:26:45,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2018-12-09 19:26:45,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:45,307 INFO L225 Difference]: With dead ends: 4084 [2018-12-09 19:26:45,307 INFO L226 Difference]: Without dead ends: 2587 [2018-12-09 19:26:45,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:26:45,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2587 states. [2018-12-09 19:26:45,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2587 to 1965. [2018-12-09 19:26:45,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2018-12-09 19:26:45,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 2573 transitions. [2018-12-09 19:26:45,347 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 2573 transitions. Word has length 121 [2018-12-09 19:26:45,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:45,347 INFO L480 AbstractCegarLoop]: Abstraction has 1965 states and 2573 transitions. [2018-12-09 19:26:45,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:26:45,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2573 transitions. [2018-12-09 19:26:45,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-09 19:26:45,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:45,350 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:26:45,350 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:45,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:45,350 INFO L82 PathProgramCache]: Analyzing trace with hash -454512655, now seen corresponding path program 1 times [2018-12-09 19:26:45,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:45,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:45,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:45,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:45,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:45,434 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:26:45,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:26:45,434 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:26:45,434 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 124 with the following transitions: [2018-12-09 19:26:45,435 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [391], [393], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-09 19:26:45,437 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:26:45,437 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:26:45,572 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:26:45,572 INFO L272 AbstractInterpreter]: Visited 93 different actions 179 times. Merged at 4 different actions 4 times. Never widened. Performed 2173 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2173 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-12-09 19:26:45,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:45,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:26:45,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:26:45,576 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_279171ff-73df-4ce4-9913-88a4ba393ed0/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:26:45,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:45,582 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:26:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:45,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:26:45,639 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:26:45,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:26:45,677 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:26:45,692 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:26:45,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2018-12-09 19:26:45,692 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:45,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:26:45,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:26:45,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:26:45,693 INFO L87 Difference]: Start difference. First operand 1965 states and 2573 transitions. Second operand 3 states. [2018-12-09 19:26:46,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:46,023 INFO L93 Difference]: Finished difference Result 4799 states and 6378 transitions. [2018-12-09 19:26:46,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:26:46,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2018-12-09 19:26:46,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:46,029 INFO L225 Difference]: With dead ends: 4799 [2018-12-09 19:26:46,030 INFO L226 Difference]: Without dead ends: 2840 [2018-12-09 19:26:46,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 246 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:26:46,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2840 states. [2018-12-09 19:26:46,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 2693. [2018-12-09 19:26:46,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2693 states. [2018-12-09 19:26:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 3409 transitions. [2018-12-09 19:26:46,068 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 3409 transitions. Word has length 123 [2018-12-09 19:26:46,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:46,068 INFO L480 AbstractCegarLoop]: Abstraction has 2693 states and 3409 transitions. [2018-12-09 19:26:46,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:26:46,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 3409 transitions. [2018-12-09 19:26:46,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-09 19:26:46,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:46,071 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:26:46,071 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:46,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:46,071 INFO L82 PathProgramCache]: Analyzing trace with hash -742354945, now seen corresponding path program 1 times [2018-12-09 19:26:46,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:46,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:46,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:46,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:46,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:46,125 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:26:46,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:46,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:26:46,125 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:46,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:26:46,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:26:46,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:26:46,126 INFO L87 Difference]: Start difference. First operand 2693 states and 3409 transitions. Second operand 6 states. [2018-12-09 19:26:46,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:46,375 INFO L93 Difference]: Finished difference Result 5090 states and 6526 transitions. [2018-12-09 19:26:46,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:26:46,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2018-12-09 19:26:46,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:46,381 INFO L225 Difference]: With dead ends: 5090 [2018-12-09 19:26:46,381 INFO L226 Difference]: Without dead ends: 1789 [2018-12-09 19:26:46,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:26:46,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2018-12-09 19:26:46,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1786. [2018-12-09 19:26:46,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1786 states. [2018-12-09 19:26:46,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2097 transitions. [2018-12-09 19:26:46,409 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2097 transitions. Word has length 126 [2018-12-09 19:26:46,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:46,409 INFO L480 AbstractCegarLoop]: Abstraction has 1786 states and 2097 transitions. [2018-12-09 19:26:46,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:26:46,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2097 transitions. [2018-12-09 19:26:46,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-09 19:26:46,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:46,411 INFO L402 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:26:46,411 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:46,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:46,411 INFO L82 PathProgramCache]: Analyzing trace with hash 230681671, now seen corresponding path program 1 times [2018-12-09 19:26:46,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:46,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:46,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:46,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:46,412 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:46,504 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:26:46,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:26:46,504 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:26:46,504 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 147 with the following transitions: [2018-12-09 19:26:46,505 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [391], [393], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-09 19:26:46,506 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:26:46,507 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:26:46,623 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:26:46,623 INFO L272 AbstractInterpreter]: Visited 93 different actions 179 times. Merged at 4 different actions 4 times. Never widened. Performed 2173 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2173 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-12-09 19:26:46,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:46,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:26:46,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:26:46,624 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_279171ff-73df-4ce4-9913-88a4ba393ed0/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:26:46,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:46,632 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:26:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:46,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:26:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:26:46,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:26:46,710 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:26:46,726 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:26:46,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2018-12-09 19:26:46,726 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:46,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:26:46,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:26:46,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:26:46,727 INFO L87 Difference]: Start difference. First operand 1786 states and 2097 transitions. Second operand 3 states. [2018-12-09 19:26:46,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:46,962 INFO L93 Difference]: Finished difference Result 3713 states and 4400 transitions. [2018-12-09 19:26:46,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:26:46,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2018-12-09 19:26:46,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:46,966 INFO L225 Difference]: With dead ends: 3713 [2018-12-09 19:26:46,966 INFO L226 Difference]: Without dead ends: 2077 [2018-12-09 19:26:46,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 292 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:26:46,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2018-12-09 19:26:47,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 2076. [2018-12-09 19:26:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2076 states. [2018-12-09 19:26:47,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 2076 states and 2453 transitions. [2018-12-09 19:26:47,003 INFO L78 Accepts]: Start accepts. Automaton has 2076 states and 2453 transitions. Word has length 146 [2018-12-09 19:26:47,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:47,004 INFO L480 AbstractCegarLoop]: Abstraction has 2076 states and 2453 transitions. [2018-12-09 19:26:47,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:26:47,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 2453 transitions. [2018-12-09 19:26:47,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-09 19:26:47,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:47,007 INFO L402 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:26:47,007 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:47,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:47,008 INFO L82 PathProgramCache]: Analyzing trace with hash 756035358, now seen corresponding path program 1 times [2018-12-09 19:26:47,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:47,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:47,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:47,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:47,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:47,084 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:26:47,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:47,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:26:47,084 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:47,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:26:47,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:26:47,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:26:47,085 INFO L87 Difference]: Start difference. First operand 2076 states and 2453 transitions. Second operand 6 states. [2018-12-09 19:26:47,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:47,380 INFO L93 Difference]: Finished difference Result 4018 states and 4769 transitions. [2018-12-09 19:26:47,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:26:47,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2018-12-09 19:26:47,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:47,383 INFO L225 Difference]: With dead ends: 4018 [2018-12-09 19:26:47,383 INFO L226 Difference]: Without dead ends: 2092 [2018-12-09 19:26:47,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:26:47,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2092 states. [2018-12-09 19:26:47,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2092 to 1936. [2018-12-09 19:26:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1936 states. [2018-12-09 19:26:47,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2219 transitions. [2018-12-09 19:26:47,407 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2219 transitions. Word has length 151 [2018-12-09 19:26:47,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:47,407 INFO L480 AbstractCegarLoop]: Abstraction has 1936 states and 2219 transitions. [2018-12-09 19:26:47,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:26:47,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2219 transitions. [2018-12-09 19:26:47,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-09 19:26:47,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:47,410 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:26:47,410 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:47,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:47,410 INFO L82 PathProgramCache]: Analyzing trace with hash 778950037, now seen corresponding path program 1 times [2018-12-09 19:26:47,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:47,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:47,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:47,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:47,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:47,469 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 80 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:26:47,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:26:47,469 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:26:47,469 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 165 with the following transitions: [2018-12-09 19:26:47,469 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [256], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [391], [393], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-09 19:26:47,471 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:26:47,471 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:26:47,573 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:26:47,573 INFO L272 AbstractInterpreter]: Visited 94 different actions 186 times. Merged at 6 different actions 9 times. Never widened. Performed 2232 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2232 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 38 variables. [2018-12-09 19:26:47,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:47,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:26:47,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:26:47,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_279171ff-73df-4ce4-9913-88a4ba393ed0/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:26:47,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:47,580 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:26:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:47,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:26:47,627 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 80 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:26:47,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:26:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 80 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:26:47,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:26:47,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2018-12-09 19:26:47,697 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:26:47,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:26:47,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:26:47,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:26:47,698 INFO L87 Difference]: Start difference. First operand 1936 states and 2219 transitions. Second operand 6 states. [2018-12-09 19:26:48,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:48,272 INFO L93 Difference]: Finished difference Result 4388 states and 5185 transitions. [2018-12-09 19:26:48,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:26:48,273 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-12-09 19:26:48,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:48,279 INFO L225 Difference]: With dead ends: 4388 [2018-12-09 19:26:48,279 INFO L226 Difference]: Without dead ends: 2601 [2018-12-09 19:26:48,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 329 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:26:48,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2018-12-09 19:26:48,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 2550. [2018-12-09 19:26:48,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2550 states. [2018-12-09 19:26:48,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 2870 transitions. [2018-12-09 19:26:48,326 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 2870 transitions. Word has length 164 [2018-12-09 19:26:48,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:48,326 INFO L480 AbstractCegarLoop]: Abstraction has 2550 states and 2870 transitions. [2018-12-09 19:26:48,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:26:48,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 2870 transitions. [2018-12-09 19:26:48,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-09 19:26:48,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:48,331 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-09 19:26:48,331 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:48,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:48,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1081806009, now seen corresponding path program 1 times [2018-12-09 19:26:48,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:48,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:48,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:48,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:48,333 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:48,399 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 103 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 19:26:48,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:26:48,399 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:26:48,399 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 199 with the following transitions: [2018-12-09 19:26:48,400 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [115], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [351], [352], [356], [360], [364], [368], [372], [379], [387], [391], [393], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-09 19:26:48,401 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:26:48,401 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:26:48,444 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 19:26:48,444 INFO L272 AbstractInterpreter]: Visited 90 different actions 90 times. Never merged. Never widened. Performed 1109 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1109 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 38 variables. [2018-12-09 19:26:48,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:48,447 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 19:26:48,647 INFO L227 lantSequenceWeakener]: Weakened 189 states. On average, predicates are now at 80.42% of their original sizes. [2018-12-09 19:26:48,647 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 19:26:48,665 INFO L418 sIntCurrentIteration]: We unified 197 AI predicates to 197 [2018-12-09 19:26:48,665 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 19:26:48,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:26:48,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-12-09 19:26:48,666 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:48,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:26:48,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:26:48,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:26:48,666 INFO L87 Difference]: Start difference. First operand 2550 states and 2870 transitions. Second operand 6 states. [2018-12-09 19:26:49,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:49,522 INFO L93 Difference]: Finished difference Result 4951 states and 5569 transitions. [2018-12-09 19:26:49,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:26:49,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 198 [2018-12-09 19:26:49,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:49,528 INFO L225 Difference]: With dead ends: 4951 [2018-12-09 19:26:49,528 INFO L226 Difference]: Without dead ends: 2551 [2018-12-09 19:26:49,531 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 198 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:26:49,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2551 states. [2018-12-09 19:26:49,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2551 to 2550. [2018-12-09 19:26:49,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2550 states. [2018-12-09 19:26:49,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 2858 transitions. [2018-12-09 19:26:49,569 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 2858 transitions. Word has length 198 [2018-12-09 19:26:49,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:49,570 INFO L480 AbstractCegarLoop]: Abstraction has 2550 states and 2858 transitions. [2018-12-09 19:26:49,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:26:49,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 2858 transitions. [2018-12-09 19:26:49,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-09 19:26:49,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:49,575 INFO L402 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-09 19:26:49,575 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:49,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:49,575 INFO L82 PathProgramCache]: Analyzing trace with hash -896503944, now seen corresponding path program 1 times [2018-12-09 19:26:49,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:49,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:49,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:49,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:49,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 120 proven. 32 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 19:26:49,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:26:49,682 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:26:49,682 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 208 with the following transitions: [2018-12-09 19:26:49,682 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [115], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [351], [352], [356], [360], [364], [368], [372], [379], [387], [391], [393], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-09 19:26:49,684 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:26:49,684 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:26:49,838 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:26:49,838 INFO L272 AbstractInterpreter]: Visited 95 different actions 372 times. Merged at 7 different actions 25 times. Never widened. Performed 4556 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4556 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-12-09 19:26:49,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:49,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:26:49,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:26:49,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_279171ff-73df-4ce4-9913-88a4ba393ed0/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:26:49,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:49,847 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:26:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:49,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:26:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 127 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 19:26:49,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:26:49,990 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 120 proven. 32 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 19:26:50,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:26:50,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-12-09 19:26:50,006 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:26:50,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:26:50,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:26:50,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:26:50,007 INFO L87 Difference]: Start difference. First operand 2550 states and 2858 transitions. Second operand 9 states. [2018-12-09 19:26:50,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:50,588 INFO L93 Difference]: Finished difference Result 4839 states and 5450 transitions. [2018-12-09 19:26:50,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 19:26:50,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 207 [2018-12-09 19:26:50,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:50,591 INFO L225 Difference]: With dead ends: 4839 [2018-12-09 19:26:50,591 INFO L226 Difference]: Without dead ends: 1662 [2018-12-09 19:26:50,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 420 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2018-12-09 19:26:50,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2018-12-09 19:26:50,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1640. [2018-12-09 19:26:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1640 states. [2018-12-09 19:26:50,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 1736 transitions. [2018-12-09 19:26:50,609 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 1736 transitions. Word has length 207 [2018-12-09 19:26:50,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:50,609 INFO L480 AbstractCegarLoop]: Abstraction has 1640 states and 1736 transitions. [2018-12-09 19:26:50,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:26:50,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 1736 transitions. [2018-12-09 19:26:50,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-12-09 19:26:50,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:50,612 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:26:50,612 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:50,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:50,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1830051997, now seen corresponding path program 1 times [2018-12-09 19:26:50,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:50,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:50,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:50,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:50,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:26:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:26:50,681 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 19:26:50,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:26:50 BoogieIcfgContainer [2018-12-09 19:26:50,742 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:26:50,743 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:26:50,743 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:26:50,743 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:26:50,743 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:26:42" (3/4) ... [2018-12-09 19:26:50,745 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 19:26:50,831 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_279171ff-73df-4ce4-9913-88a4ba393ed0/bin-2019/utaipan/witness.graphml [2018-12-09 19:26:50,831 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:26:50,831 INFO L168 Benchmark]: Toolchain (without parser) took 9731.47 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 497.0 MB). Free memory was 941.6 MB in the beginning and 814.5 MB in the end (delta: 127.1 MB). Peak memory consumption was 624.1 MB. Max. memory is 11.5 GB. [2018-12-09 19:26:50,832 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:26:50,832 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. [2018-12-09 19:26:50,833 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.47 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.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-12-09 19:26:50,833 INFO L168 Benchmark]: Boogie Preprocessor took 37.14 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.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-12-09 19:26:50,833 INFO L168 Benchmark]: RCFGBuilder took 619.50 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: 99.0 MB). Peak memory consumption was 99.0 MB. Max. memory is 11.5 GB. [2018-12-09 19:26:50,833 INFO L168 Benchmark]: TraceAbstraction took 8628.52 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 366.5 MB). Free memory was 1.0 GB in the beginning and 841.7 MB in the end (delta: 168.2 MB). Peak memory consumption was 534.6 MB. Max. memory is 11.5 GB. [2018-12-09 19:26:50,834 INFO L168 Benchmark]: Witness Printer took 88.14 ms. Allocated memory is still 1.5 GB. Free memory was 841.7 MB in the beginning and 814.5 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2018-12-09 19:26:50,835 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 335.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.47 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.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.14 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.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 619.50 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: 99.0 MB). Peak memory consumption was 99.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8628.52 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 366.5 MB). Free memory was 1.0 GB in the beginning and 841.7 MB in the end (delta: 168.2 MB). Peak memory consumption was 534.6 MB. Max. memory is 11.5 GB. * Witness Printer took 88.14 ms. Allocated memory is still 1.5 GB. Free memory was 841.7 MB in the beginning and 814.5 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 421]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; VAL [\old(a)=24, \old(a11)=27, \old(a17)=14, \old(a19)=15, \old(a21)=18, \old(a25)=20, \old(a28)=28, \old(c)=16, \old(d)=22, \old(e)=13, \old(f)=21, \old(u)=25, \old(v)=12, \old(w)=23, \old(x)=17, \old(y)=26, \old(z)=19, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L603] int output = -1; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L614] CALL, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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 !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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 !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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 !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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 !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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 !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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 !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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 !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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 !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L235] a28 = 9 [L236] return 23; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=4, \result=23, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L614] RET, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, calculate_output(input)=23, d=4, e=5, f=6, input=4, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, output=23, u=21, v=22, w=23, x=24, y=25, z=26] [L614] CALL, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L395] a19 = 0 [L396] a28 = 7 [L397] return 25; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=9, \old(input)=3, \result=25, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L614] RET, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, calculate_output(input)=25, d=4, e=5, f=6, input=3, output=23, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, output=25, u=21, v=22, w=23, x=24, y=25, z=26] [L614] CALL, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=5, a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND TRUE ((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8)))) [L155] a25 = 1 [L156] a19 = 1 [L157] a28 = 7 [L158] return -1; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=0, \old(a25)=0, \old(a28)=7, \old(input)=5, \result=-1, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L614] RET, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, calculate_output(input)=-1, d=4, e=5, f=6, input=5, output=25, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L614] CALL calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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 !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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 !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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 !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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 !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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 !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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 !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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 !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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 !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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 !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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 !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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 !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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 !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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 !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L420] COND TRUE ((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L421] __VERIFIER_error() VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=7, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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, 236 locations, 1 error locations. UNSAFE Result, 8.5s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 5.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1418 SDtfs, 4077 SDslu, 605 SDs, 0 SdLazy, 6296 SolverSat, 998 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1795 GetRequests, 1698 SyntacticMatches, 15 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2693occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 6 AbstIntIterations, 1 AbstIntStrong, 0.9982754861673944 AbsIntWeakeningRatio, 0.16751269035532995 AbsIntAvgWeakeningVarsNumRemoved, 27.543147208121827 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 1034 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 2625 NumberOfCodeBlocks, 2625 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3096 ConstructedInterpolants, 0 QuantifiedInterpolants, 1450035 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1902 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 22 InterpolantComputations, 12 PerfectInterpolantSequences, 1168/1286 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...