./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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 ../sv-benchmarks/c/eca-rers2012/Problem02_label59.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f1676b08da9bb0630243f280c8a01e0074043de1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-9a8b2e8 [2020-10-19 22:31:55,631 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 22:31:55,634 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 22:31:55,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 22:31:55,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 22:31:55,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 22:31:55,683 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 22:31:55,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 22:31:55,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 22:31:55,692 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 22:31:55,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 22:31:55,695 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 22:31:55,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 22:31:55,699 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 22:31:55,700 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 22:31:55,702 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 22:31:55,703 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 22:31:55,704 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 22:31:55,705 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 22:31:55,717 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 22:31:55,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 22:31:55,723 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 22:31:55,725 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 22:31:55,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 22:31:55,741 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 22:31:55,743 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 22:31:55,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 22:31:55,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 22:31:55,756 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 22:31:55,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 22:31:55,759 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 22:31:55,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 22:31:55,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 22:31:55,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 22:31:55,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 22:31:55,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 22:31:55,765 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 22:31:55,765 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 22:31:55,765 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 22:31:55,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 22:31:55,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 22:31:55,768 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-19 22:31:55,805 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 22:31:55,806 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 22:31:55,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 22:31:55,809 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 22:31:55,809 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 22:31:55,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 22:31:55,810 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 22:31:55,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 22:31:55,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 22:31:55,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 22:31:55,812 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-19 22:31:55,812 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-19 22:31:55,812 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-19 22:31:55,813 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 22:31:55,813 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 22:31:55,813 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 22:31:55,813 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-19 22:31:55,814 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 22:31:55,814 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 22:31:55,814 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-19 22:31:55,815 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-19 22:31:55,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-19 22:31:55,815 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 22:31:55,815 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-19 22:31:55,815 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-19 22:31:55,816 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 22:31:55,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-19 22:31:55,816 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-19 22:31:55,816 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 22:31:55,817 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(reach_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 -> f1676b08da9bb0630243f280c8a01e0074043de1 [2020-10-19 22:31:56,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 22:31:56,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 22:31:56,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 22:31:56,055 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 22:31:56,055 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 22:31:56,056 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label59.c [2020-10-19 22:31:56,123 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba7afda8d/87fe079ebd894dc99df8613ab1804481/FLAG9df14fb3d [2020-10-19 22:31:56,867 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 22:31:56,868 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label59.c [2020-10-19 22:31:56,887 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba7afda8d/87fe079ebd894dc99df8613ab1804481/FLAG9df14fb3d [2020-10-19 22:31:57,104 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba7afda8d/87fe079ebd894dc99df8613ab1804481 [2020-10-19 22:31:57,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 22:31:57,116 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 22:31:57,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 22:31:57,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 22:31:57,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 22:31:57,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 10:31:57" (1/1) ... [2020-10-19 22:31:57,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e7c6c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:31:57, skipping insertion in model container [2020-10-19 22:31:57,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 10:31:57" (1/1) ... [2020-10-19 22:31:57,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 22:31:57,193 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 22:31:57,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 22:31:57,658 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 22:31:57,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 22:31:57,867 INFO L208 MainTranslator]: Completed translation [2020-10-19 22:31:57,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:31:57 WrapperNode [2020-10-19 22:31:57,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 22:31:57,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 22:31:57,869 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 22:31:57,869 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 22:31:57,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:31:57" (1/1) ... [2020-10-19 22:31:57,896 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:31:57" (1/1) ... [2020-10-19 22:31:57,955 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 22:31:57,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 22:31:57,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 22:31:57,955 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 22:31:57,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:31:57" (1/1) ... [2020-10-19 22:31:57,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:31:57" (1/1) ... [2020-10-19 22:31:57,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:31:57" (1/1) ... [2020-10-19 22:31:57,979 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:31:57" (1/1) ... [2020-10-19 22:31:58,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:31:57" (1/1) ... [2020-10-19 22:31:58,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:31:57" (1/1) ... [2020-10-19 22:31:58,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:31:57" (1/1) ... [2020-10-19 22:31:58,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 22:31:58,055 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 22:31:58,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 22:31:58,056 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 22:31:58,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:31:57" (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 [2020-10-19 22:31:58,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-19 22:31:58,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 22:31:58,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 22:31:58,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 22:31:59,416 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 22:31:59,417 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-19 22:31:59,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 10:31:59 BoogieIcfgContainer [2020-10-19 22:31:59,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 22:31:59,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-19 22:31:59,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-19 22:31:59,426 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-19 22:31:59,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.10 10:31:57" (1/3) ... [2020-10-19 22:31:59,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b6445b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 10:31:59, skipping insertion in model container [2020-10-19 22:31:59,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:31:57" (2/3) ... [2020-10-19 22:31:59,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b6445b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 10:31:59, skipping insertion in model container [2020-10-19 22:31:59,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 10:31:59" (3/3) ... [2020-10-19 22:31:59,432 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem02_label59.c [2020-10-19 22:31:59,444 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-19 22:31:59,454 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-19 22:31:59,469 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-19 22:31:59,504 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-19 22:31:59,505 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-19 22:31:59,505 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-19 22:31:59,506 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 22:31:59,506 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 22:31:59,506 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-19 22:31:59,506 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 22:31:59,507 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-19 22:31:59,535 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states. [2020-10-19 22:31:59,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-10-19 22:31:59,550 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 22:31:59,551 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 22:31:59,552 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 22:31:59,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 22:31:59,559 INFO L82 PathProgramCache]: Analyzing trace with hash -742425229, now seen corresponding path program 1 times [2020-10-19 22:31:59,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 22:31:59,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360422139] [2020-10-19 22:31:59,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 22:31:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 22:31:59,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 22:31:59,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360422139] [2020-10-19 22:31:59,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 22:31:59,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 22:31:59,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774915276] [2020-10-19 22:31:59,961 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-19 22:31:59,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 22:31:59,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 22:31:59,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 22:31:59,979 INFO L87 Difference]: Start difference. First operand 228 states. Second operand 3 states. [2020-10-19 22:32:01,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 22:32:01,117 INFO L93 Difference]: Finished difference Result 618 states and 1060 transitions. [2020-10-19 22:32:01,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 22:32:01,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2020-10-19 22:32:01,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 22:32:01,136 INFO L225 Difference]: With dead ends: 618 [2020-10-19 22:32:01,136 INFO L226 Difference]: Without dead ends: 316 [2020-10-19 22:32:01,141 INFO L677 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 [2020-10-19 22:32:01,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2020-10-19 22:32:01,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 309. [2020-10-19 22:32:01,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2020-10-19 22:32:01,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 450 transitions. [2020-10-19 22:32:01,206 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 450 transitions. Word has length 83 [2020-10-19 22:32:01,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 22:32:01,208 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 450 transitions. [2020-10-19 22:32:01,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-19 22:32:01,208 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 450 transitions. [2020-10-19 22:32:01,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-10-19 22:32:01,212 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 22:32:01,212 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 22:32:01,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-19 22:32:01,213 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 22:32:01,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 22:32:01,213 INFO L82 PathProgramCache]: Analyzing trace with hash 52509168, now seen corresponding path program 1 times [2020-10-19 22:32:01,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 22:32:01,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910429834] [2020-10-19 22:32:01,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 22:32:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 22:32:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 22:32:01,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910429834] [2020-10-19 22:32:01,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 22:32:01,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 22:32:01,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378565260] [2020-10-19 22:32:01,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-19 22:32:01,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 22:32:01,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 22:32:01,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 22:32:01,336 INFO L87 Difference]: Start difference. First operand 309 states and 450 transitions. Second operand 3 states. [2020-10-19 22:32:02,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 22:32:02,155 INFO L93 Difference]: Finished difference Result 900 states and 1316 transitions. [2020-10-19 22:32:02,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 22:32:02,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2020-10-19 22:32:02,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 22:32:02,171 INFO L225 Difference]: With dead ends: 900 [2020-10-19 22:32:02,171 INFO L226 Difference]: Without dead ends: 593 [2020-10-19 22:32:02,173 INFO L677 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 [2020-10-19 22:32:02,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-10-19 22:32:02,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2020-10-19 22:32:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-10-19 22:32:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 763 transitions. [2020-10-19 22:32:02,217 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 763 transitions. Word has length 91 [2020-10-19 22:32:02,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 22:32:02,217 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 763 transitions. [2020-10-19 22:32:02,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-19 22:32:02,217 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 763 transitions. [2020-10-19 22:32:02,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-10-19 22:32:02,221 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 22:32:02,221 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 22:32:02,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-19 22:32:02,222 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 22:32:02,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 22:32:02,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1338968176, now seen corresponding path program 1 times [2020-10-19 22:32:02,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 22:32:02,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555786919] [2020-10-19 22:32:02,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 22:32:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 22:32:02,374 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 22:32:02,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555786919] [2020-10-19 22:32:02,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 22:32:02,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 22:32:02,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939602564] [2020-10-19 22:32:02,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-19 22:32:02,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 22:32:02,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 22:32:02,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 22:32:02,378 INFO L87 Difference]: Start difference. First operand 591 states and 763 transitions. Second operand 3 states. [2020-10-19 22:32:03,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 22:32:03,025 INFO L93 Difference]: Finished difference Result 1465 states and 1942 transitions. [2020-10-19 22:32:03,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 22:32:03,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2020-10-19 22:32:03,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 22:32:03,032 INFO L225 Difference]: With dead ends: 1465 [2020-10-19 22:32:03,032 INFO L226 Difference]: Without dead ends: 876 [2020-10-19 22:32:03,034 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 22:32:03,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2020-10-19 22:32:03,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 874. [2020-10-19 22:32:03,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2020-10-19 22:32:03,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1071 transitions. [2020-10-19 22:32:03,063 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1071 transitions. Word has length 92 [2020-10-19 22:32:03,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 22:32:03,064 INFO L481 AbstractCegarLoop]: Abstraction has 874 states and 1071 transitions. [2020-10-19 22:32:03,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-19 22:32:03,064 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1071 transitions. [2020-10-19 22:32:03,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-19 22:32:03,069 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 22:32:03,070 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 22:32:03,070 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-19 22:32:03,070 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 22:32:03,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 22:32:03,071 INFO L82 PathProgramCache]: Analyzing trace with hash -360436043, now seen corresponding path program 1 times [2020-10-19 22:32:03,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 22:32:03,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783503271] [2020-10-19 22:32:03,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 22:32:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 22:32:03,144 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 22:32:03,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783503271] [2020-10-19 22:32:03,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 22:32:03,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 22:32:03,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507565019] [2020-10-19 22:32:03,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-19 22:32:03,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 22:32:03,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 22:32:03,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 22:32:03,147 INFO L87 Difference]: Start difference. First operand 874 states and 1071 transitions. Second operand 3 states. [2020-10-19 22:32:03,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 22:32:03,782 INFO L93 Difference]: Finished difference Result 2448 states and 3014 transitions. [2020-10-19 22:32:03,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 22:32:03,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2020-10-19 22:32:03,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 22:32:03,792 INFO L225 Difference]: With dead ends: 2448 [2020-10-19 22:32:03,792 INFO L226 Difference]: Without dead ends: 1576 [2020-10-19 22:32:03,795 INFO L677 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 [2020-10-19 22:32:03,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2020-10-19 22:32:03,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2020-10-19 22:32:03,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-10-19 22:32:03,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1879 transitions. [2020-10-19 22:32:03,848 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1879 transitions. Word has length 93 [2020-10-19 22:32:03,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 22:32:03,848 INFO L481 AbstractCegarLoop]: Abstraction has 1576 states and 1879 transitions. [2020-10-19 22:32:03,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-19 22:32:03,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1879 transitions. [2020-10-19 22:32:03,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-10-19 22:32:03,852 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 22:32:03,853 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 22:32:03,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-19 22:32:03,853 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 22:32:03,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 22:32:03,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1912821181, now seen corresponding path program 1 times [2020-10-19 22:32:03,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 22:32:03,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007577762] [2020-10-19 22:32:03,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 22:32:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 22:32:04,029 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 22:32:04,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007577762] [2020-10-19 22:32:04,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008246812] [2020-10-19 22:32:04,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 22:32:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 22:32:04,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 22:32:04,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 22:32:04,224 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-19 22:32:04,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-19 22:32:04,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-10-19 22:32:04,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967384236] [2020-10-19 22:32:04,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-19 22:32:04,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 22:32:04,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 22:32:04,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-19 22:32:04,227 INFO L87 Difference]: Start difference. First operand 1576 states and 1879 transitions. Second operand 3 states. [2020-10-19 22:32:04,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 22:32:04,823 INFO L93 Difference]: Finished difference Result 4426 states and 5314 transitions. [2020-10-19 22:32:04,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 22:32:04,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2020-10-19 22:32:04,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 22:32:04,841 INFO L225 Difference]: With dead ends: 4426 [2020-10-19 22:32:04,842 INFO L226 Difference]: Without dead ends: 2852 [2020-10-19 22:32:04,845 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-19 22:32:04,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2020-10-19 22:32:04,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2846. [2020-10-19 22:32:04,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2846 states. [2020-10-19 22:32:04,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2846 states to 2846 states and 3391 transitions. [2020-10-19 22:32:04,951 INFO L78 Accepts]: Start accepts. Automaton has 2846 states and 3391 transitions. Word has length 96 [2020-10-19 22:32:04,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 22:32:04,952 INFO L481 AbstractCegarLoop]: Abstraction has 2846 states and 3391 transitions. [2020-10-19 22:32:04,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-19 22:32:04,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 3391 transitions. [2020-10-19 22:32:04,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-10-19 22:32:04,958 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 22:32:04,959 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 22:32:05,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 22:32:05,172 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 22:32:05,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 22:32:05,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1871634094, now seen corresponding path program 1 times [2020-10-19 22:32:05,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 22:32:05,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787762343] [2020-10-19 22:32:05,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 22:32:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 22:32:05,348 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 22:32:05,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787762343] [2020-10-19 22:32:05,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 22:32:05,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 22:32:05,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244265015] [2020-10-19 22:32:05,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-19 22:32:05,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 22:32:05,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 22:32:05,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 22:32:05,352 INFO L87 Difference]: Start difference. First operand 2846 states and 3391 transitions. Second operand 3 states. [2020-10-19 22:32:06,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 22:32:06,072 INFO L93 Difference]: Finished difference Result 6672 states and 8135 transitions. [2020-10-19 22:32:06,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 22:32:06,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2020-10-19 22:32:06,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 22:32:06,096 INFO L225 Difference]: With dead ends: 6672 [2020-10-19 22:32:06,097 INFO L226 Difference]: Without dead ends: 3828 [2020-10-19 22:32:06,102 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 22:32:06,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3828 states. [2020-10-19 22:32:06,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3828 to 3827. [2020-10-19 22:32:06,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3827 states. [2020-10-19 22:32:06,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3827 states to 3827 states and 4612 transitions. [2020-10-19 22:32:06,195 INFO L78 Accepts]: Start accepts. Automaton has 3827 states and 4612 transitions. Word has length 113 [2020-10-19 22:32:06,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 22:32:06,196 INFO L481 AbstractCegarLoop]: Abstraction has 3827 states and 4612 transitions. [2020-10-19 22:32:06,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-19 22:32:06,196 INFO L276 IsEmpty]: Start isEmpty. Operand 3827 states and 4612 transitions. [2020-10-19 22:32:06,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-10-19 22:32:06,201 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 22:32:06,201 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 22:32:06,209 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-19 22:32:06,210 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 22:32:06,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 22:32:06,211 INFO L82 PathProgramCache]: Analyzing trace with hash -542523611, now seen corresponding path program 1 times [2020-10-19 22:32:06,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 22:32:06,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882546525] [2020-10-19 22:32:06,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 22:32:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 22:32:06,293 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-19 22:32:06,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882546525] [2020-10-19 22:32:06,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132135465] [2020-10-19 22:32:06,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 22:32:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 22:32:06,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 22:32:06,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 22:32:06,457 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-19 22:32:06,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-19 22:32:06,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-10-19 22:32:06,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314678168] [2020-10-19 22:32:06,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-19 22:32:06,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 22:32:06,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 22:32:06,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-19 22:32:06,461 INFO L87 Difference]: Start difference. First operand 3827 states and 4612 transitions. Second operand 3 states. [2020-10-19 22:32:07,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 22:32:07,021 INFO L93 Difference]: Finished difference Result 7509 states and 9039 transitions. [2020-10-19 22:32:07,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 22:32:07,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-10-19 22:32:07,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 22:32:07,038 INFO L225 Difference]: With dead ends: 7509 [2020-10-19 22:32:07,038 INFO L226 Difference]: Without dead ends: 3684 [2020-10-19 22:32:07,043 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-19 22:32:07,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3684 states. [2020-10-19 22:32:07,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3684 to 2701. [2020-10-19 22:32:07,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2701 states. [2020-10-19 22:32:07,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3052 transitions. [2020-10-19 22:32:07,098 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3052 transitions. Word has length 116 [2020-10-19 22:32:07,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 22:32:07,099 INFO L481 AbstractCegarLoop]: Abstraction has 2701 states and 3052 transitions. [2020-10-19 22:32:07,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-19 22:32:07,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3052 transitions. [2020-10-19 22:32:07,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-10-19 22:32:07,102 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 22:32:07,102 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 22:32:07,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 22:32:07,315 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 22:32:07,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 22:32:07,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1099796851, now seen corresponding path program 1 times [2020-10-19 22:32:07,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 22:32:07,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188666798] [2020-10-19 22:32:07,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 22:32:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 22:32:07,401 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 22:32:07,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188666798] [2020-10-19 22:32:07,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 22:32:07,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 22:32:07,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797143198] [2020-10-19 22:32:07,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-19 22:32:07,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 22:32:07,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 22:32:07,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 22:32:07,404 INFO L87 Difference]: Start difference. First operand 2701 states and 3052 transitions. Second operand 3 states. [2020-10-19 22:32:08,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 22:32:08,037 INFO L93 Difference]: Finished difference Result 6818 states and 7717 transitions. [2020-10-19 22:32:08,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 22:32:08,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-10-19 22:32:08,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 22:32:08,055 INFO L225 Difference]: With dead ends: 6818 [2020-10-19 22:32:08,055 INFO L226 Difference]: Without dead ends: 4119 [2020-10-19 22:32:08,060 INFO L677 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 [2020-10-19 22:32:08,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4119 states. [2020-10-19 22:32:08,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4119 to 4117. [2020-10-19 22:32:08,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4117 states. [2020-10-19 22:32:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4117 states to 4117 states and 4628 transitions. [2020-10-19 22:32:08,138 INFO L78 Accepts]: Start accepts. Automaton has 4117 states and 4628 transitions. Word has length 116 [2020-10-19 22:32:08,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 22:32:08,138 INFO L481 AbstractCegarLoop]: Abstraction has 4117 states and 4628 transitions. [2020-10-19 22:32:08,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-19 22:32:08,139 INFO L276 IsEmpty]: Start isEmpty. Operand 4117 states and 4628 transitions. [2020-10-19 22:32:08,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-10-19 22:32:08,144 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 22:32:08,144 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 22:32:08,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-19 22:32:08,145 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 22:32:08,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 22:32:08,145 INFO L82 PathProgramCache]: Analyzing trace with hash -246171339, now seen corresponding path program 1 times [2020-10-19 22:32:08,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 22:32:08,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931994839] [2020-10-19 22:32:08,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 22:32:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 22:32:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2020-10-19 22:32:08,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931994839] [2020-10-19 22:32:08,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179905242] [2020-10-19 22:32:08,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 22:32:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 22:32:08,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 22:32:08,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 22:32:08,324 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-10-19 22:32:08,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-19 22:32:08,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2020-10-19 22:32:08,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895904340] [2020-10-19 22:32:08,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-19 22:32:08,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 22:32:08,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 22:32:08,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-19 22:32:08,328 INFO L87 Difference]: Start difference. First operand 4117 states and 4628 transitions. Second operand 3 states. [2020-10-19 22:32:08,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 22:32:08,633 INFO L93 Difference]: Finished difference Result 7941 states and 8920 transitions. [2020-10-19 22:32:08,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 22:32:08,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2020-10-19 22:32:08,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 22:32:08,648 INFO L225 Difference]: With dead ends: 7941 [2020-10-19 22:32:08,648 INFO L226 Difference]: Without dead ends: 3826 [2020-10-19 22:32:08,654 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-19 22:32:08,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3826 states. [2020-10-19 22:32:08,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3826 to 3826. [2020-10-19 22:32:08,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2020-10-19 22:32:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 4254 transitions. [2020-10-19 22:32:08,720 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 4254 transitions. Word has length 131 [2020-10-19 22:32:08,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 22:32:08,720 INFO L481 AbstractCegarLoop]: Abstraction has 3826 states and 4254 transitions. [2020-10-19 22:32:08,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-19 22:32:08,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 4254 transitions. [2020-10-19 22:32:08,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-10-19 22:32:08,726 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 22:32:08,726 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 22:32:08,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 22:32:08,940 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 22:32:08,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 22:32:08,941 INFO L82 PathProgramCache]: Analyzing trace with hash -696505083, now seen corresponding path program 1 times [2020-10-19 22:32:08,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 22:32:08,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484588935] [2020-10-19 22:32:08,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 22:32:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 22:32:09,042 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 22:32:09,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484588935] [2020-10-19 22:32:09,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 22:32:09,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 22:32:09,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359740614] [2020-10-19 22:32:09,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-19 22:32:09,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 22:32:09,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 22:32:09,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 22:32:09,045 INFO L87 Difference]: Start difference. First operand 3826 states and 4254 transitions. Second operand 3 states. [2020-10-19 22:32:09,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 22:32:09,645 INFO L93 Difference]: Finished difference Result 7510 states and 8361 transitions. [2020-10-19 22:32:09,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 22:32:09,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2020-10-19 22:32:09,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 22:32:09,710 INFO L225 Difference]: With dead ends: 7510 [2020-10-19 22:32:09,710 INFO L226 Difference]: Without dead ends: 3826 [2020-10-19 22:32:09,715 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 22:32:09,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3826 states. [2020-10-19 22:32:09,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3826 to 3826. [2020-10-19 22:32:09,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2020-10-19 22:32:09,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 4242 transitions. [2020-10-19 22:32:09,796 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 4242 transitions. Word has length 136 [2020-10-19 22:32:09,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 22:32:09,797 INFO L481 AbstractCegarLoop]: Abstraction has 3826 states and 4242 transitions. [2020-10-19 22:32:09,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-19 22:32:09,798 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 4242 transitions. [2020-10-19 22:32:09,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-10-19 22:32:09,806 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 22:32:09,806 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 22:32:09,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-19 22:32:09,807 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 22:32:09,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 22:32:09,808 INFO L82 PathProgramCache]: Analyzing trace with hash -902283608, now seen corresponding path program 1 times [2020-10-19 22:32:09,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 22:32:09,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581438439] [2020-10-19 22:32:09,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 22:32:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 22:32:09,883 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-10-19 22:32:09,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581438439] [2020-10-19 22:32:09,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 22:32:09,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 22:32:09,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862014636] [2020-10-19 22:32:09,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-19 22:32:09,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 22:32:09,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 22:32:09,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 22:32:09,886 INFO L87 Difference]: Start difference. First operand 3826 states and 4242 transitions. Second operand 3 states. [2020-10-19 22:32:10,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 22:32:10,360 INFO L93 Difference]: Finished difference Result 6942 states and 7732 transitions. [2020-10-19 22:32:10,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 22:32:10,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2020-10-19 22:32:10,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 22:32:10,381 INFO L225 Difference]: With dead ends: 6942 [2020-10-19 22:32:10,382 INFO L226 Difference]: Without dead ends: 3258 [2020-10-19 22:32:10,388 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 22:32:10,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3258 states. [2020-10-19 22:32:10,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3258 to 2838. [2020-10-19 22:32:10,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2838 states. [2020-10-19 22:32:10,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2838 states to 2838 states and 3117 transitions. [2020-10-19 22:32:10,443 INFO L78 Accepts]: Start accepts. Automaton has 2838 states and 3117 transitions. Word has length 140 [2020-10-19 22:32:10,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 22:32:10,444 INFO L481 AbstractCegarLoop]: Abstraction has 2838 states and 3117 transitions. [2020-10-19 22:32:10,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-19 22:32:10,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2838 states and 3117 transitions. [2020-10-19 22:32:10,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-10-19 22:32:10,449 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 22:32:10,449 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 22:32:10,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-19 22:32:10,449 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 22:32:10,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 22:32:10,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1831578510, now seen corresponding path program 1 times [2020-10-19 22:32:10,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 22:32:10,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556134294] [2020-10-19 22:32:10,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 22:32:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 22:32:10,521 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-10-19 22:32:10,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556134294] [2020-10-19 22:32:10,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 22:32:10,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 22:32:10,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337816502] [2020-10-19 22:32:10,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-19 22:32:10,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 22:32:10,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 22:32:10,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 22:32:10,523 INFO L87 Difference]: Start difference. First operand 2838 states and 3117 transitions. Second operand 3 states. [2020-10-19 22:32:11,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 22:32:11,044 INFO L93 Difference]: Finished difference Result 5673 states and 6203 transitions. [2020-10-19 22:32:11,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 22:32:11,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2020-10-19 22:32:11,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 22:32:11,051 INFO L225 Difference]: With dead ends: 5673 [2020-10-19 22:32:11,051 INFO L226 Difference]: Without dead ends: 2834 [2020-10-19 22:32:11,055 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 22:32:11,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2020-10-19 22:32:11,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2408. [2020-10-19 22:32:11,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2408 states. [2020-10-19 22:32:11,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 2580 transitions. [2020-10-19 22:32:11,102 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 2580 transitions. Word has length 144 [2020-10-19 22:32:11,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 22:32:11,102 INFO L481 AbstractCegarLoop]: Abstraction has 2408 states and 2580 transitions. [2020-10-19 22:32:11,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-19 22:32:11,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 2580 transitions. [2020-10-19 22:32:11,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-10-19 22:32:11,136 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 22:32:11,136 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 22:32:11,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-19 22:32:11,137 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 22:32:11,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 22:32:11,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1449710102, now seen corresponding path program 1 times [2020-10-19 22:32:11,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 22:32:11,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094664960] [2020-10-19 22:32:11,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 22:32:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 22:32:11,192 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-19 22:32:11,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094664960] [2020-10-19 22:32:11,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 22:32:11,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 22:32:11,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162943690] [2020-10-19 22:32:11,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-19 22:32:11,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 22:32:11,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 22:32:11,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 22:32:11,195 INFO L87 Difference]: Start difference. First operand 2408 states and 2580 transitions. Second operand 3 states. [2020-10-19 22:32:11,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 22:32:11,722 INFO L93 Difference]: Finished difference Result 4812 states and 5165 transitions. [2020-10-19 22:32:11,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 22:32:11,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2020-10-19 22:32:11,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 22:32:11,727 INFO L225 Difference]: With dead ends: 4812 [2020-10-19 22:32:11,728 INFO L226 Difference]: Without dead ends: 2263 [2020-10-19 22:32:11,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 22:32:11,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2020-10-19 22:32:11,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 2263. [2020-10-19 22:32:11,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2020-10-19 22:32:11,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 2410 transitions. [2020-10-19 22:32:11,761 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 2410 transitions. Word has length 151 [2020-10-19 22:32:11,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 22:32:11,761 INFO L481 AbstractCegarLoop]: Abstraction has 2263 states and 2410 transitions. [2020-10-19 22:32:11,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-19 22:32:11,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 2410 transitions. [2020-10-19 22:32:11,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-10-19 22:32:11,766 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 22:32:11,766 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 22:32:11,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-19 22:32:11,767 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 22:32:11,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 22:32:11,767 INFO L82 PathProgramCache]: Analyzing trace with hash -927365454, now seen corresponding path program 1 times [2020-10-19 22:32:11,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 22:32:11,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362475909] [2020-10-19 22:32:11,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 22:32:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 22:32:11,827 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2020-10-19 22:32:11,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362475909] [2020-10-19 22:32:11,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659277572] [2020-10-19 22:32:11,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 22:32:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 22:32:11,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-19 22:32:11,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 22:32:11,979 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-10-19 22:32:11,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-19 22:32:11,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-10-19 22:32:11,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714005726] [2020-10-19 22:32:11,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-19 22:32:11,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 22:32:11,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 22:32:11,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-19 22:32:11,983 INFO L87 Difference]: Start difference. First operand 2263 states and 2410 transitions. Second operand 3 states. [2020-10-19 22:32:12,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 22:32:12,418 INFO L93 Difference]: Finished difference Result 2825 states and 2999 transitions. [2020-10-19 22:32:12,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 22:32:12,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-10-19 22:32:12,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 22:32:12,421 INFO L225 Difference]: With dead ends: 2825 [2020-10-19 22:32:12,422 INFO L226 Difference]: Without dead ends: 1414 [2020-10-19 22:32:12,424 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-19 22:32:12,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-10-19 22:32:12,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1414. [2020-10-19 22:32:12,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2020-10-19 22:32:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 1486 transitions. [2020-10-19 22:32:12,443 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 1486 transitions. Word has length 175 [2020-10-19 22:32:12,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 22:32:12,443 INFO L481 AbstractCegarLoop]: Abstraction has 1414 states and 1486 transitions. [2020-10-19 22:32:12,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-19 22:32:12,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 1486 transitions. [2020-10-19 22:32:12,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-10-19 22:32:12,448 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 22:32:12,448 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 22:32:12,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 22:32:12,664 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 22:32:12,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 22:32:12,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1671837462, now seen corresponding path program 1 times [2020-10-19 22:32:12,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 22:32:12,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520298286] [2020-10-19 22:32:12,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 22:32:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 22:32:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-10-19 22:32:12,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520298286] [2020-10-19 22:32:12,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 22:32:12,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 22:32:12,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575943027] [2020-10-19 22:32:12,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-19 22:32:12,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 22:32:12,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 22:32:12,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-19 22:32:12,866 INFO L87 Difference]: Start difference. First operand 1414 states and 1486 transitions. Second operand 5 states. [2020-10-19 22:32:13,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 22:32:13,770 INFO L93 Difference]: Finished difference Result 2854 states and 3005 transitions. [2020-10-19 22:32:13,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 22:32:13,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2020-10-19 22:32:13,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 22:32:13,773 INFO L225 Difference]: With dead ends: 2854 [2020-10-19 22:32:13,773 INFO L226 Difference]: Without dead ends: 1293 [2020-10-19 22:32:13,775 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-19 22:32:13,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2020-10-19 22:32:13,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1132. [2020-10-19 22:32:13,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2020-10-19 22:32:13,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1163 transitions. [2020-10-19 22:32:13,790 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1163 transitions. Word has length 189 [2020-10-19 22:32:13,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 22:32:13,790 INFO L481 AbstractCegarLoop]: Abstraction has 1132 states and 1163 transitions. [2020-10-19 22:32:13,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-19 22:32:13,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1163 transitions. [2020-10-19 22:32:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2020-10-19 22:32:13,794 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 22:32:13,794 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-10-19 22:32:13,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-19 22:32:13,795 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 22:32:13,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 22:32:13,795 INFO L82 PathProgramCache]: Analyzing trace with hash 573201033, now seen corresponding path program 1 times [2020-10-19 22:32:13,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 22:32:13,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121950167] [2020-10-19 22:32:13,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 22:32:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 22:32:14,128 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 165 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 22:32:14,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121950167] [2020-10-19 22:32:14,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582441254] [2020-10-19 22:32:14,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 22:32:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 22:32:14,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-19 22:32:14,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 22:32:14,335 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-19 22:32:14,475 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 234 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 22:32:14,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 22:32:14,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-10-19 22:32:14,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123090137] [2020-10-19 22:32:14,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-19 22:32:14,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 22:32:14,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-19 22:32:14,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-19 22:32:14,478 INFO L87 Difference]: Start difference. First operand 1132 states and 1163 transitions. Second operand 9 states. [2020-10-19 22:32:16,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 22:32:16,321 INFO L93 Difference]: Finished difference Result 2591 states and 2664 transitions. [2020-10-19 22:32:16,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-19 22:32:16,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 217 [2020-10-19 22:32:16,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 22:32:16,336 INFO L225 Difference]: With dead ends: 2591 [2020-10-19 22:32:16,336 INFO L226 Difference]: Without dead ends: 1595 [2020-10-19 22:32:16,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2020-10-19 22:32:16,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2020-10-19 22:32:16,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 850. [2020-10-19 22:32:16,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2020-10-19 22:32:16,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 871 transitions. [2020-10-19 22:32:16,373 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 871 transitions. Word has length 217 [2020-10-19 22:32:16,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 22:32:16,374 INFO L481 AbstractCegarLoop]: Abstraction has 850 states and 871 transitions. [2020-10-19 22:32:16,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-19 22:32:16,375 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 871 transitions. [2020-10-19 22:32:16,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2020-10-19 22:32:16,381 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 22:32:16,381 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 22:32:16,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-10-19 22:32:16,594 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 22:32:16,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 22:32:16,595 INFO L82 PathProgramCache]: Analyzing trace with hash -2101433562, now seen corresponding path program 1 times [2020-10-19 22:32:16,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 22:32:16,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104364452] [2020-10-19 22:32:16,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 22:32:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 22:32:16,700 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 22:32:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 22:32:16,758 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 22:32:16,899 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 22:32:16,900 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-19 22:32:16,901 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-19 22:32:17,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.10 10:32:17 BoogieIcfgContainer [2020-10-19 22:32:17,162 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-19 22:32:17,162 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 22:32:17,162 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 22:32:17,163 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 22:32:17,163 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 10:31:59" (3/4) ... [2020-10-19 22:32:17,166 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-19 22:32:17,419 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-19 22:32:17,419 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 22:32:17,422 INFO L168 Benchmark]: Toolchain (without parser) took 20312.84 ms. Allocated memory was 41.4 MB in the beginning and 195.0 MB in the end (delta: 153.6 MB). Free memory was 18.1 MB in the beginning and 109.4 MB in the end (delta: -91.3 MB). Peak memory consumption was 62.3 MB. Max. memory is 14.3 GB. [2020-10-19 22:32:17,423 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 32.0 MB. Free memory was 9.2 MB in the beginning and 9.1 MB in the end (delta: 47.4 kB). Peak memory consumption was 47.4 kB. Max. memory is 14.3 GB. [2020-10-19 22:32:17,423 INFO L168 Benchmark]: CACSL2BoogieTranslator took 748.51 ms. Allocated memory was 41.4 MB in the beginning and 43.0 MB in the end (delta: 1.6 MB). Free memory was 17.2 MB in the beginning and 16.7 MB in the end (delta: 511.4 kB). Peak memory consumption was 8.3 MB. Max. memory is 14.3 GB. [2020-10-19 22:32:17,423 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.26 ms. Allocated memory is still 43.0 MB. Free memory was 16.7 MB in the beginning and 11.1 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 14.3 GB. [2020-10-19 22:32:17,424 INFO L168 Benchmark]: Boogie Preprocessor took 100.00 ms. Allocated memory was 43.0 MB in the beginning and 43.5 MB in the end (delta: 524.3 kB). Free memory was 11.1 MB in the beginning and 22.5 MB in the end (delta: -11.4 MB). Peak memory consumption was 3.7 MB. Max. memory is 14.3 GB. [2020-10-19 22:32:17,425 INFO L168 Benchmark]: RCFGBuilder took 1365.04 ms. Allocated memory was 43.5 MB in the beginning and 54.0 MB in the end (delta: 10.5 MB). Free memory was 22.2 MB in the beginning and 20.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 20.2 MB. Max. memory is 14.3 GB. [2020-10-19 22:32:17,425 INFO L168 Benchmark]: TraceAbstraction took 17740.24 ms. Allocated memory was 54.0 MB in the beginning and 195.0 MB in the end (delta: 141.0 MB). Free memory was 20.5 MB in the beginning and 149.3 MB in the end (delta: -128.9 MB). Peak memory consumption was 150.9 MB. Max. memory is 14.3 GB. [2020-10-19 22:32:17,425 INFO L168 Benchmark]: Witness Printer took 257.43 ms. Allocated memory is still 195.0 MB. Free memory was 149.3 MB in the beginning and 109.4 MB in the end (delta: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 14.3 GB. [2020-10-19 22:32:17,429 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 32.0 MB. Free memory was 9.2 MB in the beginning and 9.1 MB in the end (delta: 47.4 kB). Peak memory consumption was 47.4 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 748.51 ms. Allocated memory was 41.4 MB in the beginning and 43.0 MB in the end (delta: 1.6 MB). Free memory was 17.2 MB in the beginning and 16.7 MB in the end (delta: 511.4 kB). Peak memory consumption was 8.3 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 86.26 ms. Allocated memory is still 43.0 MB. Free memory was 16.7 MB in the beginning and 11.1 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 100.00 ms. Allocated memory was 43.0 MB in the beginning and 43.5 MB in the end (delta: 524.3 kB). Free memory was 11.1 MB in the beginning and 22.5 MB in the end (delta: -11.4 MB). Peak memory consumption was 3.7 MB. Max. memory is 14.3 GB. * RCFGBuilder took 1365.04 ms. Allocated memory was 43.5 MB in the beginning and 54.0 MB in the end (delta: 10.5 MB). Free memory was 22.2 MB in the beginning and 20.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 20.2 MB. Max. memory is 14.3 GB. * TraceAbstraction took 17740.24 ms. Allocated memory was 54.0 MB in the beginning and 195.0 MB in the end (delta: 141.0 MB). Free memory was 20.5 MB in the beginning and 149.3 MB in the end (delta: -128.9 MB). Peak memory consumption was 150.9 MB. Max. memory is 14.3 GB. * Witness Printer took 257.43 ms. Allocated memory is still 195.0 MB. Free memory was 149.3 MB in the beginning and 109.4 MB in the end (delta: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] int a= 1; [L10] int e= 5; [L11] int d= 4; [L12] int f= 6; [L13] int c= 3; [L16] int u = 21; [L17] int v = 22; [L18] int w = 23; [L19] int x = 24; [L20] int y = 25; [L21] int z = 26; [L24] int a25 = 0; [L25] int a11 = 0; [L26] int a28 = 7; [L27] int a19 = 1; [L28] int a21 = 1; [L29] int a17 = 8; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L605] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L608] COND TRUE 1 [L611] int input; [L612] input = __VERIFIER_nondet_int() [L613] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L32] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L37] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L40] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L44] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L56] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L61] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L67] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L71] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L76] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L93] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L115] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L121] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L125] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L132] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L141] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L145] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L156] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L161] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L167] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L171] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L177] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L181] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L193] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L200] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L217] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L220] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L227] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L236] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L237] a28 = 9 [L238] return 23; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L616] output = calculate_output(input) [L608] COND TRUE 1 [L611] int input; [L612] input = __VERIFIER_nondet_int() [L613] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L32] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L37] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L40] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L44] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L56] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L61] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L67] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L71] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L76] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L93] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L115] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L121] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L125] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L132] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L141] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L145] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L156] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L161] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L167] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L171] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L177] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L181] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L193] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L200] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L217] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L220] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L227] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L236] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L239] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L282] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L285] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L295] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L311] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L330] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L351] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L356] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L370] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L391] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L396] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L397] a19 = 0 [L398] a28 = 7 [L399] return 25; VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L616] output = calculate_output(input) [L608] COND TRUE 1 [L611] int input; [L612] input = __VERIFIER_nondet_int() [L613] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L32] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L37] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L40] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L44] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L56] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L61] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L67] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L71] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L76] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L93] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L115] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L121] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L125] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L132] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L141] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L145] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L156] COND TRUE ((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8)))) [L157] a25 = 1 [L158] a19 = 1 [L159] a28 = 7 [L160] return -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L616] output = calculate_output(input) [L608] COND TRUE 1 [L611] int input; [L612] input = __VERIFIER_nondet_int() [L613] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L32] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L37] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L40] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L44] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L56] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L61] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L67] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L71] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L76] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L93] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L115] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L121] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L125] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L132] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L141] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L145] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L156] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L161] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L167] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L171] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L177] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L181] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L193] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L200] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L217] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L220] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L227] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L236] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L239] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L282] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L285] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L295] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L311] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L330] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L351] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L356] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L370] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L391] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L396] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L400] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L406] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L411] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L416] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L422] COND TRUE ((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L4] __assert_fail("0", "Problem02_label59.c", 4, "reach_error") VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 228 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.3s, OverallIterations: 17, TraceHistogramMax: 6, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2001 SDtfs, 2861 SDslu, 321 SDs, 0 SdLazy, 7850 SolverSat, 942 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 787 GetRequests, 746 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4117occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 2755 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 3049 NumberOfCodeBlocks, 3049 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2797 ConstructedInterpolants, 0 QuantifiedInterpolants, 1505284 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1596 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 21 InterpolantComputations, 15 PerfectInterpolantSequences, 1585/1691 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...