./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 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 22ec766384c93b05d1b8a0b6b07fbbb9335a4030 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:40:40,314 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:40:40,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:40:40,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:40:40,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:40:40,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:40:40,337 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:40:40,346 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:40:40,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:40:40,355 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:40:40,356 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:40:40,357 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:40:40,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:40:40,360 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:40:40,361 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:40:40,363 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:40:40,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:40:40,366 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:40:40,369 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:40:40,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:40:40,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:40:40,381 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:40:40,382 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:40:40,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:40:40,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:40:40,387 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:40:40,387 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:40:40,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:40:40,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:40:40,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:40:40,389 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:40:40,390 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:40:40,390 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:40:40,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:40:40,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:40:40,395 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:40:40,396 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:40:40,396 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:40:40,396 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:40:40,397 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:40:40,398 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:40:40,399 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:40:40,433 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:40:40,434 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:40:40,437 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:40:40,437 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:40:40,437 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:40:40,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:40:40,438 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:40:40,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:40:40,439 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:40:40,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:40:40,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:40:40,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:40:40,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:40:40,440 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:40:40,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:40:40,440 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:40:40,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:40:40,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:40:40,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:40:40,441 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:40:40,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:40:40,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:40:40,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:40:40,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:40:40,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:40:40,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:40:40,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:40:40,443 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:40:40,443 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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 22ec766384c93b05d1b8a0b6b07fbbb9335a4030 [2019-11-27 22:40:40,745 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:40:40,766 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:40:40,770 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:40:40,771 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:40:40,772 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:40:40,773 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label59.c [2019-11-27 22:40:40,858 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/053f1751b/1bc8f604d0e94612be27faf1d945945d/FLAGb86cf7033 [2019-11-27 22:40:41,490 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:40:41,493 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label59.c [2019-11-27 22:40:41,520 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/053f1751b/1bc8f604d0e94612be27faf1d945945d/FLAGb86cf7033 [2019-11-27 22:40:41,732 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/053f1751b/1bc8f604d0e94612be27faf1d945945d [2019-11-27 22:40:41,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:40:41,737 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:40:41,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:40:41,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:40:41,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:40:41,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:40:41" (1/1) ... [2019-11-27 22:40:41,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f061439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:41, skipping insertion in model container [2019-11-27 22:40:41,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:40:41" (1/1) ... [2019-11-27 22:40:41,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:40:41,823 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:40:42,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:40:42,333 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:40:42,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:40:42,481 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:40:42,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:42 WrapperNode [2019-11-27 22:40:42,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:40:42,483 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:40:42,483 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:40:42,483 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:40:42,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:42" (1/1) ... [2019-11-27 22:40:42,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:42" (1/1) ... [2019-11-27 22:40:42,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:40:42,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:40:42,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:40:42,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:40:42,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:42" (1/1) ... [2019-11-27 22:40:42,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:42" (1/1) ... [2019-11-27 22:40:42,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:42" (1/1) ... [2019-11-27 22:40:42,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:42" (1/1) ... [2019-11-27 22:40:42,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:42" (1/1) ... [2019-11-27 22:40:42,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:42" (1/1) ... [2019-11-27 22:40:42,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:42" (1/1) ... [2019-11-27 22:40:42,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:40:42,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:40:42,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:40:42,655 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:40:42,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:42" (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 [2019-11-27 22:40:42,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:40:42,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:40:44,095 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:40:44,095 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:40:44,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:40:44 BoogieIcfgContainer [2019-11-27 22:40:44,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:40:44,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:40:44,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:40:44,102 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:40:44,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:40:41" (1/3) ... [2019-11-27 22:40:44,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@140ab651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:40:44, skipping insertion in model container [2019-11-27 22:40:44,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:42" (2/3) ... [2019-11-27 22:40:44,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@140ab651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:40:44, skipping insertion in model container [2019-11-27 22:40:44,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:40:44" (3/3) ... [2019-11-27 22:40:44,106 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label59.c [2019-11-27 22:40:44,117 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:40:44,126 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:40:44,140 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:40:44,169 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:40:44,169 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:40:44,169 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:40:44,169 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:40:44,170 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:40:44,170 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:40:44,170 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:40:44,170 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:40:44,194 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-11-27 22:40:44,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-27 22:40:44,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:44,206 INFO L410 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] [2019-11-27 22:40:44,206 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:44,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:44,213 INFO L82 PathProgramCache]: Analyzing trace with hash -742425229, now seen corresponding path program 1 times [2019-11-27 22:40:44,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:44,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120465311] [2019-11-27 22:40:44,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:44,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:40:44,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120465311] [2019-11-27 22:40:44,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:44,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:40:44,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944873453] [2019-11-27 22:40:44,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:40:44,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:44,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:40:44,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:44,692 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-11-27 22:40:46,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:46,129 INFO L93 Difference]: Finished difference Result 789 states and 1377 transitions. [2019-11-27 22:40:46,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:40:46,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-11-27 22:40:46,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:46,149 INFO L225 Difference]: With dead ends: 789 [2019-11-27 22:40:46,149 INFO L226 Difference]: Without dead ends: 465 [2019-11-27 22:40:46,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:46,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-11-27 22:40:46,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 309. [2019-11-27 22:40:46,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-11-27 22:40:46,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 453 transitions. [2019-11-27 22:40:46,220 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 453 transitions. Word has length 83 [2019-11-27 22:40:46,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:46,221 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 453 transitions. [2019-11-27 22:40:46,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:40:46,221 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 453 transitions. [2019-11-27 22:40:46,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-27 22:40:46,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:46,226 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:40:46,226 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:46,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:46,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1010911192, now seen corresponding path program 1 times [2019-11-27 22:40:46,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:46,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192156619] [2019-11-27 22:40:46,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:46,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:40:46,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192156619] [2019-11-27 22:40:46,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:46,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:40:46,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912474789] [2019-11-27 22:40:46,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:40:46,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:46,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:40:46,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:40:46,362 INFO L87 Difference]: Start difference. First operand 309 states and 453 transitions. Second operand 3 states. [2019-11-27 22:40:46,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:46,926 INFO L93 Difference]: Finished difference Result 899 states and 1323 transitions. [2019-11-27 22:40:46,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:40:46,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-11-27 22:40:46,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:46,932 INFO L225 Difference]: With dead ends: 899 [2019-11-27 22:40:46,932 INFO L226 Difference]: Without dead ends: 592 [2019-11-27 22:40:46,935 INFO L630 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 [2019-11-27 22:40:46,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-11-27 22:40:46,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-11-27 22:40:46,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-27 22:40:46,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 765 transitions. [2019-11-27 22:40:46,968 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 765 transitions. Word has length 87 [2019-11-27 22:40:46,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:46,969 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 765 transitions. [2019-11-27 22:40:46,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:40:46,969 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 765 transitions. [2019-11-27 22:40:46,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-27 22:40:46,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:46,975 INFO L410 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] [2019-11-27 22:40:46,975 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:46,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:46,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1389241170, now seen corresponding path program 1 times [2019-11-27 22:40:46,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:46,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318317114] [2019-11-27 22:40:46,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:47,065 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:40:47,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318317114] [2019-11-27 22:40:47,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:47,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:40:47,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527945340] [2019-11-27 22:40:47,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:40:47,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:47,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:40:47,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:47,068 INFO L87 Difference]: Start difference. First operand 592 states and 765 transitions. Second operand 4 states. [2019-11-27 22:40:48,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:48,184 INFO L93 Difference]: Finished difference Result 2169 states and 2837 transitions. [2019-11-27 22:40:48,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:40:48,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-27 22:40:48,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:48,193 INFO L225 Difference]: With dead ends: 2169 [2019-11-27 22:40:48,194 INFO L226 Difference]: Without dead ends: 1437 [2019-11-27 22:40:48,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:48,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2019-11-27 22:40:48,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1150. [2019-11-27 22:40:48,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2019-11-27 22:40:48,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1467 transitions. [2019-11-27 22:40:48,237 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1467 transitions. Word has length 92 [2019-11-27 22:40:48,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:48,238 INFO L462 AbstractCegarLoop]: Abstraction has 1150 states and 1467 transitions. [2019-11-27 22:40:48,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:40:48,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1467 transitions. [2019-11-27 22:40:48,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-27 22:40:48,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:48,246 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:40:48,246 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:48,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:48,246 INFO L82 PathProgramCache]: Analyzing trace with hash 961132773, now seen corresponding path program 1 times [2019-11-27 22:40:48,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:48,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956006673] [2019-11-27 22:40:48,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:48,304 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:40:48,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956006673] [2019-11-27 22:40:48,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:48,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:40:48,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121838709] [2019-11-27 22:40:48,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:40:48,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:48,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:40:48,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:40:48,307 INFO L87 Difference]: Start difference. First operand 1150 states and 1467 transitions. Second operand 3 states. [2019-11-27 22:40:49,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:49,013 INFO L93 Difference]: Finished difference Result 3278 states and 4207 transitions. [2019-11-27 22:40:49,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:40:49,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-27 22:40:49,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:49,025 INFO L225 Difference]: With dead ends: 3278 [2019-11-27 22:40:49,025 INFO L226 Difference]: Without dead ends: 2130 [2019-11-27 22:40:49,028 INFO L630 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 [2019-11-27 22:40:49,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2019-11-27 22:40:49,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 1850. [2019-11-27 22:40:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1850 states. [2019-11-27 22:40:49,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2333 transitions. [2019-11-27 22:40:49,079 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2333 transitions. Word has length 100 [2019-11-27 22:40:49,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:49,079 INFO L462 AbstractCegarLoop]: Abstraction has 1850 states and 2333 transitions. [2019-11-27 22:40:49,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:40:49,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2333 transitions. [2019-11-27 22:40:49,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-27 22:40:49,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:49,085 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:40:49,085 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:49,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:49,086 INFO L82 PathProgramCache]: Analyzing trace with hash 568521515, now seen corresponding path program 1 times [2019-11-27 22:40:49,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:49,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909987562] [2019-11-27 22:40:49,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:49,186 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:40:49,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909987562] [2019-11-27 22:40:49,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:49,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:40:49,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917524604] [2019-11-27 22:40:49,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:40:49,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:49,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:40:49,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:49,190 INFO L87 Difference]: Start difference. First operand 1850 states and 2333 transitions. Second operand 4 states. [2019-11-27 22:40:50,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:50,093 INFO L93 Difference]: Finished difference Result 3984 states and 4981 transitions. [2019-11-27 22:40:50,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:40:50,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-11-27 22:40:50,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:50,106 INFO L225 Difference]: With dead ends: 3984 [2019-11-27 22:40:50,107 INFO L226 Difference]: Without dead ends: 2136 [2019-11-27 22:40:50,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:50,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2019-11-27 22:40:50,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 2131. [2019-11-27 22:40:50,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-11-27 22:40:50,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2423 transitions. [2019-11-27 22:40:50,167 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2423 transitions. Word has length 141 [2019-11-27 22:40:50,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:50,167 INFO L462 AbstractCegarLoop]: Abstraction has 2131 states and 2423 transitions. [2019-11-27 22:40:50,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:40:50,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2423 transitions. [2019-11-27 22:40:50,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-27 22:40:50,173 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:50,173 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:40:50,174 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:50,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:50,175 INFO L82 PathProgramCache]: Analyzing trace with hash -825838518, now seen corresponding path program 1 times [2019-11-27 22:40:50,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:50,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288990649] [2019-11-27 22:40:50,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:40:50,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288990649] [2019-11-27 22:40:50,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:50,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:40:50,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403278110] [2019-11-27 22:40:50,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:40:50,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:50,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:40:50,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:40:50,282 INFO L87 Difference]: Start difference. First operand 2131 states and 2423 transitions. Second operand 3 states. [2019-11-27 22:40:50,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:50,810 INFO L93 Difference]: Finished difference Result 4266 states and 4853 transitions. [2019-11-27 22:40:50,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:40:50,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-11-27 22:40:50,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:50,821 INFO L225 Difference]: With dead ends: 4266 [2019-11-27 22:40:50,821 INFO L226 Difference]: Without dead ends: 2137 [2019-11-27 22:40:50,825 INFO L630 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 [2019-11-27 22:40:50,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2019-11-27 22:40:50,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 2131. [2019-11-27 22:40:50,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-11-27 22:40:50,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2379 transitions. [2019-11-27 22:40:50,872 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2379 transitions. Word has length 150 [2019-11-27 22:40:50,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:50,873 INFO L462 AbstractCegarLoop]: Abstraction has 2131 states and 2379 transitions. [2019-11-27 22:40:50,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:40:50,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2379 transitions. [2019-11-27 22:40:50,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-27 22:40:50,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:50,878 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:40:50,879 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:50,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:50,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1004727621, now seen corresponding path program 1 times [2019-11-27 22:40:50,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:50,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990145641] [2019-11-27 22:40:50,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:50,970 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-27 22:40:50,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990145641] [2019-11-27 22:40:50,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:50,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:40:50,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134752810] [2019-11-27 22:40:50,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:40:50,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:50,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:40:50,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:50,975 INFO L87 Difference]: Start difference. First operand 2131 states and 2379 transitions. Second operand 4 states. [2019-11-27 22:40:51,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:51,565 INFO L93 Difference]: Finished difference Result 4258 states and 4754 transitions. [2019-11-27 22:40:51,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:40:51,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-27 22:40:51,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:51,575 INFO L225 Difference]: With dead ends: 4258 [2019-11-27 22:40:51,575 INFO L226 Difference]: Without dead ends: 2129 [2019-11-27 22:40:51,578 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:51,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2019-11-27 22:40:51,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 2129. [2019-11-27 22:40:51,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2129 states. [2019-11-27 22:40:51,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 2307 transitions. [2019-11-27 22:40:51,619 INFO L78 Accepts]: Start accepts. Automaton has 2129 states and 2307 transitions. Word has length 152 [2019-11-27 22:40:51,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:51,619 INFO L462 AbstractCegarLoop]: Abstraction has 2129 states and 2307 transitions. [2019-11-27 22:40:51,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:40:51,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 2307 transitions. [2019-11-27 22:40:51,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-27 22:40:51,623 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:51,624 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:40:51,624 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:51,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:51,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1027607493, now seen corresponding path program 1 times [2019-11-27 22:40:51,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:51,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805481058] [2019-11-27 22:40:51,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-27 22:40:51,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805481058] [2019-11-27 22:40:51,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:51,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:40:51,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464888318] [2019-11-27 22:40:51,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:40:51,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:51,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:40:51,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:40:51,679 INFO L87 Difference]: Start difference. First operand 2129 states and 2307 transitions. Second operand 3 states. [2019-11-27 22:40:52,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:52,181 INFO L93 Difference]: Finished difference Result 4538 states and 4924 transitions. [2019-11-27 22:40:52,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:40:52,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-11-27 22:40:52,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:52,191 INFO L225 Difference]: With dead ends: 4538 [2019-11-27 22:40:52,192 INFO L226 Difference]: Without dead ends: 2270 [2019-11-27 22:40:52,195 INFO L630 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 [2019-11-27 22:40:52,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2019-11-27 22:40:52,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 2268. [2019-11-27 22:40:52,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2268 states. [2019-11-27 22:40:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 2449 transitions. [2019-11-27 22:40:52,236 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 2449 transitions. Word has length 161 [2019-11-27 22:40:52,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:52,236 INFO L462 AbstractCegarLoop]: Abstraction has 2268 states and 2449 transitions. [2019-11-27 22:40:52,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:40:52,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 2449 transitions. [2019-11-27 22:40:52,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-27 22:40:52,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:52,241 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-27 22:40:52,242 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:52,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:52,242 INFO L82 PathProgramCache]: Analyzing trace with hash -89793530, now seen corresponding path program 1 times [2019-11-27 22:40:52,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:52,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126756218] [2019-11-27 22:40:52,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:52,328 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-27 22:40:52,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126756218] [2019-11-27 22:40:52,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:52,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:40:52,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391776558] [2019-11-27 22:40:52,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:40:52,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:52,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:40:52,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:52,337 INFO L87 Difference]: Start difference. First operand 2268 states and 2449 transitions. Second operand 4 states. [2019-11-27 22:40:53,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:53,221 INFO L93 Difference]: Finished difference Result 5239 states and 5687 transitions. [2019-11-27 22:40:53,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:40:53,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-11-27 22:40:53,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:53,234 INFO L225 Difference]: With dead ends: 5239 [2019-11-27 22:40:53,235 INFO L226 Difference]: Without dead ends: 2973 [2019-11-27 22:40:53,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:53,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2019-11-27 22:40:53,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2689. [2019-11-27 22:40:53,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2689 states. [2019-11-27 22:40:53,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 2886 transitions. [2019-11-27 22:40:53,293 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 2886 transitions. Word has length 162 [2019-11-27 22:40:53,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:53,293 INFO L462 AbstractCegarLoop]: Abstraction has 2689 states and 2886 transitions. [2019-11-27 22:40:53,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:40:53,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 2886 transitions. [2019-11-27 22:40:53,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-27 22:40:53,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:53,300 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-27 22:40:53,300 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:53,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:53,301 INFO L82 PathProgramCache]: Analyzing trace with hash -258096497, now seen corresponding path program 1 times [2019-11-27 22:40:53,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:53,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079575078] [2019-11-27 22:40:53,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:53,437 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:40:53,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079575078] [2019-11-27 22:40:53,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:53,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:40:53,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031553938] [2019-11-27 22:40:53,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:40:53,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:53,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:40:53,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:53,440 INFO L87 Difference]: Start difference. First operand 2689 states and 2886 transitions. Second operand 4 states. [2019-11-27 22:40:54,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:54,218 INFO L93 Difference]: Finished difference Result 5658 states and 6067 transitions. [2019-11-27 22:40:54,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:40:54,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-11-27 22:40:54,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:54,234 INFO L225 Difference]: With dead ends: 5658 [2019-11-27 22:40:54,235 INFO L226 Difference]: Without dead ends: 2550 [2019-11-27 22:40:54,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:54,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2019-11-27 22:40:54,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2406. [2019-11-27 22:40:54,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2406 states. [2019-11-27 22:40:54,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 2525 transitions. [2019-11-27 22:40:54,279 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 2525 transitions. Word has length 185 [2019-11-27 22:40:54,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:54,279 INFO L462 AbstractCegarLoop]: Abstraction has 2406 states and 2525 transitions. [2019-11-27 22:40:54,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:40:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 2525 transitions. [2019-11-27 22:40:54,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-27 22:40:54,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:54,285 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-27 22:40:54,286 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:54,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:54,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1619030631, now seen corresponding path program 1 times [2019-11-27 22:40:54,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:54,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090595572] [2019-11-27 22:40:54,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:54,375 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 106 proven. 8 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-27 22:40:54,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090595572] [2019-11-27 22:40:54,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629841592] [2019-11-27 22:40:54,376 INFO L94 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 [2019-11-27 22:40:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:54,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:40:54,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:40:54,598 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-27 22:40:54,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:40:54,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2019-11-27 22:40:54,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347362522] [2019-11-27 22:40:54,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:40:54,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:54,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:40:54,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:40:54,604 INFO L87 Difference]: Start difference. First operand 2406 states and 2525 transitions. Second operand 3 states. [2019-11-27 22:40:54,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:54,870 INFO L93 Difference]: Finished difference Result 4380 states and 4595 transitions. [2019-11-27 22:40:54,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:40:54,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-11-27 22:40:54,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:54,876 INFO L225 Difference]: With dead ends: 4380 [2019-11-27 22:40:54,877 INFO L226 Difference]: Without dead ends: 992 [2019-11-27 22:40:54,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 191 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:40:54,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-11-27 22:40:54,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2019-11-27 22:40:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2019-11-27 22:40:54,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1026 transitions. [2019-11-27 22:40:54,924 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1026 transitions. Word has length 192 [2019-11-27 22:40:54,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:54,924 INFO L462 AbstractCegarLoop]: Abstraction has 992 states and 1026 transitions. [2019-11-27 22:40:54,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:40:54,925 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1026 transitions. [2019-11-27 22:40:54,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-27 22:40:54,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:54,932 INFO L410 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] [2019-11-27 22:40:55,141 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:40:55,142 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:55,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:55,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1600594216, now seen corresponding path program 1 times [2019-11-27 22:40:55,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:55,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807425356] [2019-11-27 22:40:55,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:40:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:40:55,415 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 22:40:55,416 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 22:40:55,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:40:55 BoogieIcfgContainer [2019-11-27 22:40:55,607 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:40:55,608 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:40:55,608 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:40:55,608 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:40:55,609 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:40:44" (3/4) ... [2019-11-27 22:40:55,611 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 22:40:55,810 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:40:55,811 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:40:55,815 INFO L168 Benchmark]: Toolchain (without parser) took 14076.28 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 422.6 MB). Free memory was 956.3 MB in the beginning and 986.7 MB in the end (delta: -30.4 MB). Peak memory consumption was 392.2 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:55,815 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:40:55,816 INFO L168 Benchmark]: CACSL2BoogieTranslator took 744.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:55,816 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:55,817 INFO L168 Benchmark]: Boogie Preprocessor took 82.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:55,817 INFO L168 Benchmark]: RCFGBuilder took 1442.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.9 MB). Peak memory consumption was 104.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:55,818 INFO L168 Benchmark]: TraceAbstraction took 11509.04 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 275.3 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -7.9 MB). Peak memory consumption was 267.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:55,819 INFO L168 Benchmark]: Witness Printer took 203.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 986.7 MB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:55,821 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 744.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 89.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1442.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.9 MB). Peak memory consumption was 104.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11509.04 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 275.3 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -7.9 MB). Peak memory consumption was 267.4 MB. Max. memory is 11.5 GB. * Witness Printer took 203.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 986.7 MB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 421]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L603] int output = -1; VAL [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] [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] 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] [L35] 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] [L38] 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] [L42] 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] [L47] 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] [L50] 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] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [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] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [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] [L65] 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] [L69] 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] [L74] 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] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [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] [L91] 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] [L95] 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] [L99] 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] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [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] [L113] 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] [L119] 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] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [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] [L130] 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] [L134] 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] [L139] 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] [L143] 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] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [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] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [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] [L159] 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] [L165] 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] [L169] 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] [L175] 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] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [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] [L185] 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] [L187] 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] [L189] 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] [L191] 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] [L194] 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] [L198] 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] [L202] 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] [L212] 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] [L215] 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] [L218] 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] [L223] 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] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [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] [L232] 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] [L234] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L235] a28 = 9 [L236] 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] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] 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] [L35] 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] [L38] 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] [L42] 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] [L47] 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] [L50] 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] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [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] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [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] [L65] 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] [L69] 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] [L74] 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] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [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] [L91] 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] [L95] 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] [L99] 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] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [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] [L113] 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] [L119] 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] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [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] [L130] 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] [L134] 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] [L139] 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] [L143] 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] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [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] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [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] [L159] 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] [L165] 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] [L169] 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] [L175] 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] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [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] [L185] 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] [L187] 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] [L189] 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] [L191] 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] [L194] 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] [L198] 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] [L202] 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] [L212] 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] [L215] 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] [L218] 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] [L223] 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] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [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] [L232] 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] [L234] 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] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [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] [L248] 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] [L253] 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] [L259] 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] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [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] [L276] 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] [L280] 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] [L283] 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] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [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] [L291] 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] [L293] 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] [L297] 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] [L309] 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] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [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] [L328] 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] [L331] 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] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [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] [L349] 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] [L354] 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] [L361] 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] [L368] 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] [L375] 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] [L378] 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] [L380] 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] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [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] [L394] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L395] a19 = 0 [L396] a28 = 7 [L397] return 25; VAL [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] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] 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] [L35] 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] [L38] 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] [L42] 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] [L47] 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] [L50] 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] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [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] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [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] [L65] 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] [L69] 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] [L74] 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] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [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] [L91] 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] [L95] 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] [L99] 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] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [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] [L113] 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] [L119] 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] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [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] [L130] 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] [L134] 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] [L139] 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] [L143] 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] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [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] [L154] COND TRUE ((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8)))) [L155] a25 = 1 [L156] a19 = 1 [L157] a28 = 7 [L158] return -1; VAL [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] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] 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] [L35] 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] [L38] 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] [L42] 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] [L47] 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] [L50] 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] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [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] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [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] [L65] 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] [L69] 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] [L74] 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] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [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] [L91] 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] [L95] 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] [L99] 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] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [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] [L113] 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] [L119] 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] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [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] [L130] 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] [L134] 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] [L139] 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] [L143] 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] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [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] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [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] [L159] 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] [L165] 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] [L169] 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] [L175] 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] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [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] [L185] 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] [L187] 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] [L189] 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] [L191] 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] [L194] 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] [L198] 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] [L202] 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] [L212] 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] [L215] 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] [L218] 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] [L223] 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] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [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] [L232] 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] [L234] 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] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [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] [L248] 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] [L253] 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] [L259] 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] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [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] [L276] 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] [L280] 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] [L283] 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] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [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] [L291] 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] [L293] 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] [L297] 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] [L309] 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] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [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] [L328] 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] [L331] 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] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [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] [L349] 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] [L354] 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] [L361] 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] [L368] 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] [L375] 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] [L378] 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] [L380] 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] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [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] [L394] 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] [L398] 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] [L402] 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] [L404] 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] [L407] 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] [L409] 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] [L414] 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] [L417] 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] [L420] 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] [L421] __VERIFIER_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, 227 locations, 1 error locations. Result: UNSAFE, OverallTime: 11.2s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1526 SDtfs, 2245 SDslu, 267 SDs, 0 SdLazy, 5828 SolverSat, 946 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 230 GetRequests, 207 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2689occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1164 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1928 NumberOfCodeBlocks, 1928 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1685 ConstructedInterpolants, 0 QuantifiedInterpolants, 433658 SizeOfPredicates, 1 NumberOfNonLiveVariables, 381 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 1046/1054 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...