./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem01_label37_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem01_label37_false-unreach-call_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fa966b8d35f41797c67ed2115fa88ccdba9ca513 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-2e94e6a [2018-12-30 16:16:35,798 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 16:16:35,800 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 16:16:35,819 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 16:16:35,820 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 16:16:35,822 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 16:16:35,824 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 16:16:35,826 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 16:16:35,828 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 16:16:35,828 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 16:16:35,829 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 16:16:35,830 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 16:16:35,830 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 16:16:35,832 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 16:16:35,833 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 16:16:35,834 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 16:16:35,836 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 16:16:35,840 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 16:16:35,842 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 16:16:35,843 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 16:16:35,844 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 16:16:35,845 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 16:16:35,848 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 16:16:35,848 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 16:16:35,848 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 16:16:35,849 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 16:16:35,850 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 16:16:35,851 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 16:16:35,851 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 16:16:35,853 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 16:16:35,853 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 16:16:35,853 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 16:16:35,854 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 16:16:35,854 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 16:16:35,855 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 16:16:35,856 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 16:16:35,856 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 16:16:35,874 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 16:16:35,874 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 16:16:35,875 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 16:16:35,876 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 16:16:35,876 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 16:16:35,876 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 16:16:35,877 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 16:16:35,877 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 16:16:35,877 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 16:16:35,877 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 16:16:35,877 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 16:16:35,877 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 16:16:35,878 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 16:16:35,878 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 16:16:35,878 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 16:16:35,878 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 16:16:35,878 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 16:16:35,878 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 16:16:35,880 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 16:16:35,880 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 16:16:35,880 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 16:16:35,881 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:16:35,881 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 16:16:35,881 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 16:16:35,881 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 16:16:35,881 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 16:16:35,882 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 16:16:35,883 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 16:16:35,883 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> fa966b8d35f41797c67ed2115fa88ccdba9ca513 [2018-12-30 16:16:35,927 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 16:16:35,947 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 16:16:35,952 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 16:16:35,953 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 16:16:35,953 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 16:16:35,954 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem01_label37_false-unreach-call_false-termination.c [2018-12-30 16:16:36,012 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1dc7199c/42ad245e4074455ea4770da1e2adc582/FLAG19965d8ae [2018-12-30 16:16:36,557 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 16:16:36,558 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem01_label37_false-unreach-call_false-termination.c [2018-12-30 16:16:36,571 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1dc7199c/42ad245e4074455ea4770da1e2adc582/FLAG19965d8ae [2018-12-30 16:16:36,798 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1dc7199c/42ad245e4074455ea4770da1e2adc582 [2018-12-30 16:16:36,802 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 16:16:36,803 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 16:16:36,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 16:16:36,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 16:16:36,809 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 16:16:36,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:16:36" (1/1) ... [2018-12-30 16:16:36,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@373596ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:16:36, skipping insertion in model container [2018-12-30 16:16:36,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:16:36" (1/1) ... [2018-12-30 16:16:36,820 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 16:16:36,885 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 16:16:37,339 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:16:37,347 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 16:16:37,476 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:16:37,494 INFO L195 MainTranslator]: Completed translation [2018-12-30 16:16:37,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:16:37 WrapperNode [2018-12-30 16:16:37,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 16:16:37,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 16:16:37,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 16:16:37,496 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 16:16:37,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:16:37" (1/1) ... [2018-12-30 16:16:37,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:16:37" (1/1) ... [2018-12-30 16:16:37,670 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 16:16:37,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 16:16:37,671 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 16:16:37,671 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 16:16:37,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:16:37" (1/1) ... [2018-12-30 16:16:37,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:16:37" (1/1) ... [2018-12-30 16:16:37,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:16:37" (1/1) ... [2018-12-30 16:16:37,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:16:37" (1/1) ... [2018-12-30 16:16:37,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:16:37" (1/1) ... [2018-12-30 16:16:37,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:16:37" (1/1) ... [2018-12-30 16:16:37,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:16:37" (1/1) ... [2018-12-30 16:16:37,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 16:16:37,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 16:16:37,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 16:16:37,738 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 16:16:37,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:16:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-30 16:16:37,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 16:16:37,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 16:16:40,559 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 16:16:40,559 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 16:16:40,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:16:40 BoogieIcfgContainer [2018-12-30 16:16:40,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 16:16:40,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 16:16:40,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 16:16:40,565 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 16:16:40,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 04:16:36" (1/3) ... [2018-12-30 16:16:40,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab7ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:16:40, skipping insertion in model container [2018-12-30 16:16:40,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:16:37" (2/3) ... [2018-12-30 16:16:40,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab7ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:16:40, skipping insertion in model container [2018-12-30 16:16:40,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:16:40" (3/3) ... [2018-12-30 16:16:40,568 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label37_false-unreach-call_false-termination.c [2018-12-30 16:16:40,577 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 16:16:40,586 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 16:16:40,604 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 16:16:40,642 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 16:16:40,643 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 16:16:40,643 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 16:16:40,643 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 16:16:40,644 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 16:16:40,644 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 16:16:40,645 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 16:16:40,645 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 16:16:40,645 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 16:16:40,666 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2018-12-30 16:16:40,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-30 16:16:40,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:16:40,676 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] [2018-12-30 16:16:40,681 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:16:40,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:16:40,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1590501662, now seen corresponding path program 1 times [2018-12-30 16:16:40,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:16:40,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:16:40,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:16:40,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:16:40,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:16:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:16:41,294 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-30 16:16:41,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:16:41,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:16:41,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:16:41,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:16:41,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:16:41,323 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2018-12-30 16:16:44,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:16:44,258 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2018-12-30 16:16:44,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:16:44,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2018-12-30 16:16:44,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:16:44,281 INFO L225 Difference]: With dead ends: 662 [2018-12-30 16:16:44,281 INFO L226 Difference]: Without dead ends: 397 [2018-12-30 16:16:44,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:16:44,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-12-30 16:16:44,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2018-12-30 16:16:44,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-30 16:16:44,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2018-12-30 16:16:44,347 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 75 [2018-12-30 16:16:44,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:16:44,348 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2018-12-30 16:16:44,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:16:44,348 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2018-12-30 16:16:44,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-30 16:16:44,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:16:44,352 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] [2018-12-30 16:16:44,352 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:16:44,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:16:44,353 INFO L82 PathProgramCache]: Analyzing trace with hash -518497877, now seen corresponding path program 1 times [2018-12-30 16:16:44,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:16:44,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:16:44,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:16:44,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:16:44,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:16:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:16:44,521 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-30 16:16:44,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:16:44,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:16:44,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:16:44,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:16:44,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:16:44,527 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2018-12-30 16:16:45,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:16:45,865 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2018-12-30 16:16:45,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:16:45,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-30 16:16:45,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:16:45,875 INFO L225 Difference]: With dead ends: 1054 [2018-12-30 16:16:45,875 INFO L226 Difference]: Without dead ends: 790 [2018-12-30 16:16:45,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:16:45,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-12-30 16:16:45,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2018-12-30 16:16:45,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2018-12-30 16:16:45,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2018-12-30 16:16:45,934 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 81 [2018-12-30 16:16:45,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:16:45,935 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2018-12-30 16:16:45,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:16:45,935 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2018-12-30 16:16:45,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-30 16:16:45,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:16:45,940 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:16:45,940 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:16:45,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:16:45,941 INFO L82 PathProgramCache]: Analyzing trace with hash 76938844, now seen corresponding path program 1 times [2018-12-30 16:16:45,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:16:45,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:16:45,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:16:45,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:16:45,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:16:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:16:46,073 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-30 16:16:46,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:16:46,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:16:46,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:16:46,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:16:46,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:16:46,075 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 3 states. [2018-12-30 16:16:47,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:16:47,313 INFO L93 Difference]: Finished difference Result 1840 states and 2519 transitions. [2018-12-30 16:16:47,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:16:47,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-12-30 16:16:47,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:16:47,319 INFO L225 Difference]: With dead ends: 1840 [2018-12-30 16:16:47,319 INFO L226 Difference]: Without dead ends: 1052 [2018-12-30 16:16:47,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-30 16:16:47,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2018-12-30 16:16:47,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 921. [2018-12-30 16:16:47,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2018-12-30 16:16:47,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1246 transitions. [2018-12-30 16:16:47,347 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1246 transitions. Word has length 101 [2018-12-30 16:16:47,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:16:47,348 INFO L480 AbstractCegarLoop]: Abstraction has 921 states and 1246 transitions. [2018-12-30 16:16:47,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:16:47,348 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1246 transitions. [2018-12-30 16:16:47,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-30 16:16:47,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:16:47,353 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-30 16:16:47,353 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:16:47,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:16:47,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1862580391, now seen corresponding path program 1 times [2018-12-30 16:16:47,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:16:47,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:16:47,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:16:47,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:16:47,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:16:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:16:47,526 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-30 16:16:47,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:16:47,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:16:47,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:16:47,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:16:47,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:16:47,530 INFO L87 Difference]: Start difference. First operand 921 states and 1246 transitions. Second operand 3 states. [2018-12-30 16:16:49,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:16:49,486 INFO L93 Difference]: Finished difference Result 2233 states and 2997 transitions. [2018-12-30 16:16:49,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:16:49,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2018-12-30 16:16:49,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:16:49,494 INFO L225 Difference]: With dead ends: 2233 [2018-12-30 16:16:49,494 INFO L226 Difference]: Without dead ends: 1314 [2018-12-30 16:16:49,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-30 16:16:49,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2018-12-30 16:16:49,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2018-12-30 16:16:49,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2018-12-30 16:16:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1508 transitions. [2018-12-30 16:16:49,531 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1508 transitions. Word has length 137 [2018-12-30 16:16:49,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:16:49,533 INFO L480 AbstractCegarLoop]: Abstraction has 1183 states and 1508 transitions. [2018-12-30 16:16:49,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:16:49,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1508 transitions. [2018-12-30 16:16:49,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-30 16:16:49,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:16:49,538 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:16:49,539 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:16:49,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:16:49,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1495519081, now seen corresponding path program 1 times [2018-12-30 16:16:49,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:16:49,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:16:49,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:16:49,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:16:49,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:16:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:16:49,715 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-12-30 16:16:49,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:16:49,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:16:49,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:16:49,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:16:49,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:16:49,717 INFO L87 Difference]: Start difference. First operand 1183 states and 1508 transitions. Second operand 3 states. [2018-12-30 16:16:50,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:16:50,302 INFO L93 Difference]: Finished difference Result 3150 states and 4004 transitions. [2018-12-30 16:16:50,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:16:50,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2018-12-30 16:16:50,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:16:50,313 INFO L225 Difference]: With dead ends: 3150 [2018-12-30 16:16:50,313 INFO L226 Difference]: Without dead ends: 1969 [2018-12-30 16:16:50,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-30 16:16:50,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2018-12-30 16:16:50,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2018-12-30 16:16:50,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2018-12-30 16:16:50,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2134 transitions. [2018-12-30 16:16:50,352 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2134 transitions. Word has length 156 [2018-12-30 16:16:50,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:16:50,353 INFO L480 AbstractCegarLoop]: Abstraction has 1707 states and 2134 transitions. [2018-12-30 16:16:50,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:16:50,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2134 transitions. [2018-12-30 16:16:50,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-30 16:16:50,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:16:50,357 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:16:50,357 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:16:50,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:16:50,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1039024350, now seen corresponding path program 1 times [2018-12-30 16:16:50,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:16:50,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:16:50,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:16:50,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:16:50,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:16:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:16:50,520 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-12-30 16:16:50,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:16:50,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:16:50,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:16:50,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:16:50,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:16:50,522 INFO L87 Difference]: Start difference. First operand 1707 states and 2134 transitions. Second operand 3 states. [2018-12-30 16:16:52,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:16:52,195 INFO L93 Difference]: Finished difference Result 3674 states and 4582 transitions. [2018-12-30 16:16:52,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:16:52,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2018-12-30 16:16:52,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:16:52,204 INFO L225 Difference]: With dead ends: 3674 [2018-12-30 16:16:52,204 INFO L226 Difference]: Without dead ends: 1969 [2018-12-30 16:16:52,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:16:52,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2018-12-30 16:16:52,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1969. [2018-12-30 16:16:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2018-12-30 16:16:52,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2408 transitions. [2018-12-30 16:16:52,244 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2408 transitions. Word has length 159 [2018-12-30 16:16:52,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:16:52,244 INFO L480 AbstractCegarLoop]: Abstraction has 1969 states and 2408 transitions. [2018-12-30 16:16:52,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:16:52,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2408 transitions. [2018-12-30 16:16:52,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-30 16:16:52,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:16:52,249 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:16:52,249 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:16:52,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:16:52,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1910252010, now seen corresponding path program 1 times [2018-12-30 16:16:52,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:16:52,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:16:52,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:16:52,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:16:52,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:16:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:16:52,755 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-12-30 16:16:52,865 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-12-30 16:16:52,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:16:52,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-30 16:16:52,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 16:16:52,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 16:16:52,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-30 16:16:52,866 INFO L87 Difference]: Start difference. First operand 1969 states and 2408 transitions. Second operand 8 states. [2018-12-30 16:16:54,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:16:54,289 INFO L93 Difference]: Finished difference Result 4106 states and 4990 transitions. [2018-12-30 16:16:54,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 16:16:54,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 163 [2018-12-30 16:16:54,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:16:54,299 INFO L225 Difference]: With dead ends: 4106 [2018-12-30 16:16:54,299 INFO L226 Difference]: Without dead ends: 2139 [2018-12-30 16:16:54,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-30 16:16:54,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2018-12-30 16:16:54,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1969. [2018-12-30 16:16:54,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2018-12-30 16:16:54,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2396 transitions. [2018-12-30 16:16:54,383 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2396 transitions. Word has length 163 [2018-12-30 16:16:54,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:16:54,383 INFO L480 AbstractCegarLoop]: Abstraction has 1969 states and 2396 transitions. [2018-12-30 16:16:54,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 16:16:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2396 transitions. [2018-12-30 16:16:54,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-30 16:16:54,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:16:54,389 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:16:54,390 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:16:54,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:16:54,390 INFO L82 PathProgramCache]: Analyzing trace with hash -527436646, now seen corresponding path program 1 times [2018-12-30 16:16:54,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:16:54,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:16:54,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:16:54,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:16:54,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:16:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:16:54,703 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-30 16:16:54,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:16:54,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 16:16:54,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:16:54,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:16:54,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:16:54,705 INFO L87 Difference]: Start difference. First operand 1969 states and 2396 transitions. Second operand 4 states. [2018-12-30 16:16:55,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:16:55,631 INFO L93 Difference]: Finished difference Result 4198 states and 5112 transitions. [2018-12-30 16:16:55,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:16:55,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2018-12-30 16:16:55,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:16:55,640 INFO L225 Difference]: With dead ends: 4198 [2018-12-30 16:16:55,641 INFO L226 Difference]: Without dead ends: 2231 [2018-12-30 16:16:55,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:16:55,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2018-12-30 16:16:55,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2100. [2018-12-30 16:16:55,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2018-12-30 16:16:55,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2461 transitions. [2018-12-30 16:16:55,681 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2461 transitions. Word has length 196 [2018-12-30 16:16:55,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:16:55,682 INFO L480 AbstractCegarLoop]: Abstraction has 2100 states and 2461 transitions. [2018-12-30 16:16:55,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:16:55,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2461 transitions. [2018-12-30 16:16:55,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-30 16:16:55,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:16:55,688 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-12-30 16:16:55,688 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:16:55,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:16:55,688 INFO L82 PathProgramCache]: Analyzing trace with hash 903009638, now seen corresponding path program 1 times [2018-12-30 16:16:55,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:16:55,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:16:55,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:16:55,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:16:55,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:16:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:16:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-30 16:16:55,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:16:55,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 16:16:55,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:16:55,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:16:55,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:16:55,880 INFO L87 Difference]: Start difference. First operand 2100 states and 2461 transitions. Second operand 4 states. [2018-12-30 16:16:58,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:16:58,809 INFO L93 Difference]: Finished difference Result 4722 states and 5498 transitions. [2018-12-30 16:16:58,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:16:58,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 222 [2018-12-30 16:16:58,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:16:58,818 INFO L225 Difference]: With dead ends: 4722 [2018-12-30 16:16:58,818 INFO L226 Difference]: Without dead ends: 2624 [2018-12-30 16:16:58,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:16:58,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2018-12-30 16:16:58,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 2100. [2018-12-30 16:16:58,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2018-12-30 16:16:58,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2449 transitions. [2018-12-30 16:16:58,861 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2449 transitions. Word has length 222 [2018-12-30 16:16:58,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:16:58,861 INFO L480 AbstractCegarLoop]: Abstraction has 2100 states and 2449 transitions. [2018-12-30 16:16:58,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:16:58,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2449 transitions. [2018-12-30 16:16:58,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-12-30 16:16:58,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:16:58,868 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:16:58,868 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:16:58,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:16:58,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1282822171, now seen corresponding path program 1 times [2018-12-30 16:16:58,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:16:58,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:16:58,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:16:58,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:16:58,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:16:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:16:59,247 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-12-30 16:16:59,477 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-12-30 16:16:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-12-30 16:16:59,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:16:59,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 16:16:59,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 16:16:59,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 16:16:59,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-30 16:16:59,710 INFO L87 Difference]: Start difference. First operand 2100 states and 2449 transitions. Second operand 6 states. [2018-12-30 16:17:00,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:17:00,626 INFO L93 Difference]: Finished difference Result 4236 states and 4934 transitions. [2018-12-30 16:17:00,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 16:17:00,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 243 [2018-12-30 16:17:00,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:17:00,634 INFO L225 Difference]: With dead ends: 4236 [2018-12-30 16:17:00,634 INFO L226 Difference]: Without dead ends: 2138 [2018-12-30 16:17:00,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-30 16:17:00,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2018-12-30 16:17:00,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1969. [2018-12-30 16:17:00,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2018-12-30 16:17:00,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2240 transitions. [2018-12-30 16:17:00,671 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2240 transitions. Word has length 243 [2018-12-30 16:17:00,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:17:00,672 INFO L480 AbstractCegarLoop]: Abstraction has 1969 states and 2240 transitions. [2018-12-30 16:17:00,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 16:17:00,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2240 transitions. [2018-12-30 16:17:00,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-12-30 16:17:00,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:17:00,679 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:17:00,679 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:17:00,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:17:00,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1398111844, now seen corresponding path program 1 times [2018-12-30 16:17:00,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:17:00,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:17:00,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:17:00,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:17:00,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:17:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:17:01,097 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-30 16:17:01,492 WARN L181 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-12-30 16:17:01,824 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2018-12-30 16:17:02,391 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 351 proven. 8 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-12-30 16:17:02,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:17:02,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-30 16:17:02,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:17:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:17:02,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:17:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-12-30 16:17:02,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 16:17:02,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-12-30 16:17:02,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-30 16:17:02,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-30 16:17:02,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-12-30 16:17:02,766 INFO L87 Difference]: Start difference. First operand 1969 states and 2240 transitions. Second operand 14 states. [2018-12-30 16:17:05,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:17:05,102 INFO L93 Difference]: Finished difference Result 4377 states and 4963 transitions. [2018-12-30 16:17:05,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-30 16:17:05,103 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 265 [2018-12-30 16:17:05,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:17:05,109 INFO L225 Difference]: With dead ends: 4377 [2018-12-30 16:17:05,109 INFO L226 Difference]: Without dead ends: 1886 [2018-12-30 16:17:05,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 266 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2018-12-30 16:17:05,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2018-12-30 16:17:05,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1886. [2018-12-30 16:17:05,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1886 states. [2018-12-30 16:17:05,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2006 transitions. [2018-12-30 16:17:05,144 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2006 transitions. Word has length 265 [2018-12-30 16:17:05,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:17:05,144 INFO L480 AbstractCegarLoop]: Abstraction has 1886 states and 2006 transitions. [2018-12-30 16:17:05,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-30 16:17:05,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2006 transitions. [2018-12-30 16:17:05,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-12-30 16:17:05,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:17:05,152 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:17:05,152 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:17:05,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:17:05,153 INFO L82 PathProgramCache]: Analyzing trace with hash -127549203, now seen corresponding path program 1 times [2018-12-30 16:17:05,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:17:05,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:17:05,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:17:05,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:17:05,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:17:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-30 16:17:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-30 16:17:05,323 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-30 16:17:05,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 04:17:05 BoogieIcfgContainer [2018-12-30 16:17:05,537 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 16:17:05,537 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 16:17:05,537 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 16:17:05,538 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 16:17:05,538 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:16:40" (3/4) ... [2018-12-30 16:17:05,543 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-30 16:17:05,799 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 16:17:05,803 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 16:17:05,804 INFO L168 Benchmark]: Toolchain (without parser) took 29001.38 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 372.8 MB). Free memory was 947.3 MB in the beginning and 867.1 MB in the end (delta: 80.3 MB). Peak memory consumption was 453.0 MB. Max. memory is 11.5 GB. [2018-12-30 16:17:05,805 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:17:05,805 INFO L168 Benchmark]: CACSL2BoogieTranslator took 690.17 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 920.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-12-30 16:17:05,805 INFO L168 Benchmark]: Boogie Procedure Inliner took 174.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -187.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2018-12-30 16:17:05,807 INFO L168 Benchmark]: Boogie Preprocessor took 66.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-30 16:17:05,807 INFO L168 Benchmark]: RCFGBuilder took 2822.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 994.1 MB in the end (delta: 106.9 MB). Peak memory consumption was 106.9 MB. Max. memory is 11.5 GB. [2018-12-30 16:17:05,807 INFO L168 Benchmark]: TraceAbstraction took 24975.81 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 251.7 MB). Free memory was 994.1 MB in the beginning and 912.4 MB in the end (delta: 81.8 MB). Peak memory consumption was 333.4 MB. Max. memory is 11.5 GB. [2018-12-30 16:17:05,808 INFO L168 Benchmark]: Witness Printer took 265.88 ms. Allocated memory is still 1.4 GB. Free memory was 912.4 MB in the beginning and 867.1 MB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. [2018-12-30 16:17:05,811 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 690.17 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 920.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 174.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -187.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2822.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 994.1 MB in the end (delta: 106.9 MB). Peak memory consumption was 106.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24975.81 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 251.7 MB). Free memory was 994.1 MB in the beginning and 912.4 MB in the end (delta: 81.8 MB). Peak memory consumption was 333.4 MB. Max. memory is 11.5 GB. * Witness Printer took 265.88 ms. Allocated memory is still 1.4 GB. Free memory was 912.4 MB in the beginning and 867.1 MB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 401]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L580] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND TRUE ((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5)) [L378] a21 = 1 [L379] a16 = 6 [L380] a7 = 0 [L381] return -1; VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L400] COND TRUE (((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1)) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L401] __VERIFIER_error() VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. UNSAFE Result, 24.8s OverallTime, 12 OverallIterations, 7 TraceHistogramMax, 18.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 749 SDtfs, 2793 SDslu, 148 SDs, 0 SdLazy, 7236 SolverSat, 1115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 328 GetRequests, 279 SyntacticMatches, 8 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2100occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1649 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2332 NumberOfCodeBlocks, 2332 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2051 ConstructedInterpolants, 0 QuantifiedInterpolants, 1466303 SizeOfPredicates, 0 NumberOfNonLiveVariables, 496 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 2712/2720 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...