./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label29.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/Problem11_label29.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c85e7c8ad743232eaf67a454bcaf99f6a95fa82483af46e6e34deddca8a203f7 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 09:35:56,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 09:35:56,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 09:35:56,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 09:35:56,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 09:35:56,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 09:35:56,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 09:35:56,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 09:35:56,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 09:35:56,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 09:35:56,198 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 09:35:56,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 09:35:56,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 09:35:56,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 09:35:56,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 09:35:56,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 09:35:56,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 09:35:56,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 09:35:56,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 09:35:56,214 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 09:35:56,214 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 09:35:56,215 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 09:35:56,216 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 09:35:56,217 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 09:35:56,221 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 09:35:56,222 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 09:35:56,222 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 09:35:56,223 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 09:35:56,223 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 09:35:56,224 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 09:35:56,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 09:35:56,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 09:35:56,226 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 09:35:56,227 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 09:35:56,228 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 09:35:56,229 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 09:35:56,229 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 09:35:56,229 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 09:35:56,229 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 09:35:56,230 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 09:35:56,230 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 09:35:56,232 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 09:35:56,256 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 09:35:56,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 09:35:56,257 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 09:35:56,257 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 09:35:56,258 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 09:35:56,258 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 09:35:56,258 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 09:35:56,258 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 09:35:56,259 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 09:35:56,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 09:35:56,259 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 09:35:56,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 09:35:56,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 09:35:56,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 09:35:56,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 09:35:56,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 09:35:56,260 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 09:35:56,261 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 09:35:56,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 09:35:56,261 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 09:35:56,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 09:35:56,261 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 09:35:56,261 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 09:35:56,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 09:35:56,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 09:35:56,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 09:35:56,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 09:35:56,263 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 09:35:56,263 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 09:35:56,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 09:35:56,263 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 09:35:56,264 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 09:35:56,264 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 09:35:56,264 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 09:35:56,264 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c85e7c8ad743232eaf67a454bcaf99f6a95fa82483af46e6e34deddca8a203f7 [2021-12-15 09:35:56,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 09:35:56,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 09:35:56,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 09:35:56,480 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 09:35:56,499 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 09:35:56,501 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label29.c [2021-12-15 09:35:56,548 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/242f36a83/6e7cfdc8310d48b8b2987ca7fd58b2b5/FLAGb64b47317 [2021-12-15 09:35:57,008 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 09:35:57,009 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label29.c [2021-12-15 09:35:57,019 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/242f36a83/6e7cfdc8310d48b8b2987ca7fd58b2b5/FLAGb64b47317 [2021-12-15 09:35:57,350 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/242f36a83/6e7cfdc8310d48b8b2987ca7fd58b2b5 [2021-12-15 09:35:57,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 09:35:57,354 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 09:35:57,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 09:35:57,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 09:35:57,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 09:35:57,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:35:57" (1/1) ... [2021-12-15 09:35:57,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d5ff5bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:57, skipping insertion in model container [2021-12-15 09:35:57,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:35:57" (1/1) ... [2021-12-15 09:35:57,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 09:35:57,413 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 09:35:57,611 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label29.c[2990,3003] [2021-12-15 09:35:57,857 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 09:35:57,863 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 09:35:57,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label29.c[2990,3003] [2021-12-15 09:35:57,967 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 09:35:57,977 INFO L208 MainTranslator]: Completed translation [2021-12-15 09:35:57,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:57 WrapperNode [2021-12-15 09:35:57,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 09:35:57,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 09:35:57,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 09:35:57,980 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 09:35:57,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:57" (1/1) ... [2021-12-15 09:35:58,026 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:57" (1/1) ... [2021-12-15 09:35:58,133 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2021-12-15 09:35:58,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 09:35:58,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 09:35:58,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 09:35:58,134 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 09:35:58,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:57" (1/1) ... [2021-12-15 09:35:58,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:57" (1/1) ... [2021-12-15 09:35:58,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:57" (1/1) ... [2021-12-15 09:35:58,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:57" (1/1) ... [2021-12-15 09:35:58,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:57" (1/1) ... [2021-12-15 09:35:58,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:57" (1/1) ... [2021-12-15 09:35:58,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:57" (1/1) ... [2021-12-15 09:35:58,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 09:35:58,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 09:35:58,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 09:35:58,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 09:35:58,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:57" (1/1) ... [2021-12-15 09:35:58,223 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 09:35:58,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 09:35:58,241 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-15 09:35:58,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-15 09:35:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 09:35:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 09:35:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 09:35:58,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 09:35:58,348 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 09:35:58,350 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 09:35:59,438 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 09:35:59,450 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 09:35:59,450 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 09:35:59,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:35:59 BoogieIcfgContainer [2021-12-15 09:35:59,453 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 09:35:59,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 09:35:59,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 09:35:59,457 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 09:35:59,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:35:57" (1/3) ... [2021-12-15 09:35:59,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5acf1180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:35:59, skipping insertion in model container [2021-12-15 09:35:59,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:35:57" (2/3) ... [2021-12-15 09:35:59,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5acf1180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:35:59, skipping insertion in model container [2021-12-15 09:35:59,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:35:59" (3/3) ... [2021-12-15 09:35:59,459 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem11_label29.c [2021-12-15 09:35:59,462 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 09:35:59,462 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 09:35:59,504 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 09:35:59,511 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 09:35:59,511 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 09:35:59,533 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:35:59,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 09:35:59,537 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 09:35:59,537 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 09:35:59,538 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 09:35:59,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 09:35:59,542 INFO L85 PathProgramCache]: Analyzing trace with hash -279853278, now seen corresponding path program 1 times [2021-12-15 09:35:59,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 09:35:59,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785015906] [2021-12-15 09:35:59,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 09:35:59,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 09:35:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 09:35:59,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 09:35:59,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 09:35:59,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785015906] [2021-12-15 09:35:59,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785015906] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 09:35:59,666 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 09:35:59,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 09:35:59,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583680209] [2021-12-15 09:35:59,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 09:35:59,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 09:35:59,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 09:35:59,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 09:35:59,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 09:35:59,692 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:00,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 09:36:00,491 INFO L93 Difference]: Finished difference Result 761 states and 1345 transitions. [2021-12-15 09:36:00,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 09:36:00,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-15 09:36:00,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 09:36:00,504 INFO L225 Difference]: With dead ends: 761 [2021-12-15 09:36:00,505 INFO L226 Difference]: Without dead ends: 413 [2021-12-15 09:36:00,508 INFO L932 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 [2021-12-15 09:36:00,510 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 208 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-15 09:36:00,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 222 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-15 09:36:00,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-12-15 09:36:00,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2021-12-15 09:36:00,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:00,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2021-12-15 09:36:00,553 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 20 [2021-12-15 09:36:00,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 09:36:00,554 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2021-12-15 09:36:00,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:00,554 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2021-12-15 09:36:00,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-15 09:36:00,556 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 09:36:00,556 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 09:36:00,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 09:36:00,557 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 09:36:00,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 09:36:00,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1457732326, now seen corresponding path program 1 times [2021-12-15 09:36:00,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 09:36:00,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521691927] [2021-12-15 09:36:00,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 09:36:00,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 09:36:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 09:36:00,669 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 09:36:00,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 09:36:00,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521691927] [2021-12-15 09:36:00,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521691927] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 09:36:00,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 09:36:00,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 09:36:00,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196638413] [2021-12-15 09:36:00,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 09:36:00,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 09:36:00,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 09:36:00,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 09:36:00,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 09:36:00,674 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:01,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 09:36:01,279 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2021-12-15 09:36:01,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 09:36:01,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-12-15 09:36:01,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 09:36:01,282 INFO L225 Difference]: With dead ends: 1211 [2021-12-15 09:36:01,282 INFO L226 Difference]: Without dead ends: 800 [2021-12-15 09:36:01,284 INFO L932 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 [2021-12-15 09:36:01,285 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-15 09:36:01,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 118 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-15 09:36:01,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2021-12-15 09:36:01,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2021-12-15 09:36:01,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3756345177664975) internal successors, (1084), 788 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:01,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1084 transitions. [2021-12-15 09:36:01,310 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1084 transitions. Word has length 88 [2021-12-15 09:36:01,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 09:36:01,311 INFO L470 AbstractCegarLoop]: Abstraction has 789 states and 1084 transitions. [2021-12-15 09:36:01,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:01,311 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1084 transitions. [2021-12-15 09:36:01,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-15 09:36:01,313 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 09:36:01,313 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 09:36:01,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 09:36:01,314 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 09:36:01,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 09:36:01,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1315830044, now seen corresponding path program 1 times [2021-12-15 09:36:01,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 09:36:01,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783921116] [2021-12-15 09:36:01,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 09:36:01,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 09:36:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 09:36:01,394 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 09:36:01,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 09:36:01,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783921116] [2021-12-15 09:36:01,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783921116] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 09:36:01,395 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 09:36:01,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 09:36:01,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966833937] [2021-12-15 09:36:01,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 09:36:01,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 09:36:01,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 09:36:01,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 09:36:01,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 09:36:01,397 INFO L87 Difference]: Start difference. First operand 789 states and 1084 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:02,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 09:36:02,045 INFO L93 Difference]: Finished difference Result 2314 states and 3184 transitions. [2021-12-15 09:36:02,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 09:36:02,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-12-15 09:36:02,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 09:36:02,052 INFO L225 Difference]: With dead ends: 2314 [2021-12-15 09:36:02,052 INFO L226 Difference]: Without dead ends: 1527 [2021-12-15 09:36:02,053 INFO L932 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 [2021-12-15 09:36:02,059 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 120 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-15 09:36:02,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 193 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-15 09:36:02,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2021-12-15 09:36:02,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1526. [2021-12-15 09:36:02,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1525 states have (on average 1.2177049180327868) internal successors, (1857), 1525 states have internal predecessors, (1857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:02,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1857 transitions. [2021-12-15 09:36:02,088 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1857 transitions. Word has length 89 [2021-12-15 09:36:02,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 09:36:02,089 INFO L470 AbstractCegarLoop]: Abstraction has 1526 states and 1857 transitions. [2021-12-15 09:36:02,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:02,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1857 transitions. [2021-12-15 09:36:02,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-12-15 09:36:02,097 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 09:36:02,098 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 09:36:02,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 09:36:02,098 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 09:36:02,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 09:36:02,099 INFO L85 PathProgramCache]: Analyzing trace with hash -773142089, now seen corresponding path program 1 times [2021-12-15 09:36:02,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 09:36:02,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816267873] [2021-12-15 09:36:02,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 09:36:02,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 09:36:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 09:36:02,237 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 09:36:02,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 09:36:02,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816267873] [2021-12-15 09:36:02,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816267873] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 09:36:02,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 09:36:02,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 09:36:02,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239556675] [2021-12-15 09:36:02,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 09:36:02,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 09:36:02,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 09:36:02,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 09:36:02,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 09:36:02,242 INFO L87 Difference]: Start difference. First operand 1526 states and 1857 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:02,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 09:36:02,967 INFO L93 Difference]: Finished difference Result 3257 states and 4126 transitions. [2021-12-15 09:36:02,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 09:36:02,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2021-12-15 09:36:02,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 09:36:02,974 INFO L225 Difference]: With dead ends: 3257 [2021-12-15 09:36:02,974 INFO L226 Difference]: Without dead ends: 1917 [2021-12-15 09:36:02,976 INFO L932 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 [2021-12-15 09:36:02,985 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 215 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-15 09:36:02,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 321 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-15 09:36:02,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2021-12-15 09:36:03,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1914. [2021-12-15 09:36:03,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1913 states have (on average 1.246732880292734) internal successors, (2385), 1913 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:03,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2385 transitions. [2021-12-15 09:36:03,011 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2385 transitions. Word has length 147 [2021-12-15 09:36:03,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 09:36:03,012 INFO L470 AbstractCegarLoop]: Abstraction has 1914 states and 2385 transitions. [2021-12-15 09:36:03,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:03,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2385 transitions. [2021-12-15 09:36:03,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-12-15 09:36:03,016 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 09:36:03,016 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-15 09:36:03,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 09:36:03,017 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 09:36:03,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 09:36:03,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1844234710, now seen corresponding path program 1 times [2021-12-15 09:36:03,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 09:36:03,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023009856] [2021-12-15 09:36:03,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 09:36:03,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 09:36:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 09:36:03,141 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 09:36:03,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 09:36:03,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023009856] [2021-12-15 09:36:03,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023009856] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 09:36:03,142 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 09:36:03,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 09:36:03,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449834181] [2021-12-15 09:36:03,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 09:36:03,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 09:36:03,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 09:36:03,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 09:36:03,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 09:36:03,144 INFO L87 Difference]: Start difference. First operand 1914 states and 2385 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:03,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 09:36:03,818 INFO L93 Difference]: Finished difference Result 4579 states and 5797 transitions. [2021-12-15 09:36:03,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 09:36:03,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2021-12-15 09:36:03,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 09:36:03,827 INFO L225 Difference]: With dead ends: 4579 [2021-12-15 09:36:03,827 INFO L226 Difference]: Without dead ends: 2851 [2021-12-15 09:36:03,829 INFO L932 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 [2021-12-15 09:36:03,830 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 136 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-15 09:36:03,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 338 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-15 09:36:03,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2021-12-15 09:36:03,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2469. [2021-12-15 09:36:03,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2469 states, 2468 states have (on average 1.2374392220421393) internal successors, (3054), 2468 states have internal predecessors, (3054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:03,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3054 transitions. [2021-12-15 09:36:03,864 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3054 transitions. Word has length 200 [2021-12-15 09:36:03,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 09:36:03,865 INFO L470 AbstractCegarLoop]: Abstraction has 2469 states and 3054 transitions. [2021-12-15 09:36:03,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:03,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3054 transitions. [2021-12-15 09:36:03,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-12-15 09:36:03,869 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 09:36:03,870 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-15 09:36:03,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 09:36:03,871 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 09:36:03,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 09:36:03,872 INFO L85 PathProgramCache]: Analyzing trace with hash 597593056, now seen corresponding path program 1 times [2021-12-15 09:36:03,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 09:36:03,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164908581] [2021-12-15 09:36:03,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 09:36:03,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 09:36:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 09:36:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 09:36:03,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 09:36:03,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164908581] [2021-12-15 09:36:03,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164908581] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 09:36:03,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 09:36:03,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 09:36:03,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706393413] [2021-12-15 09:36:03,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 09:36:03,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 09:36:03,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 09:36:03,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 09:36:03,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 09:36:03,993 INFO L87 Difference]: Start difference. First operand 2469 states and 3054 transitions. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:05,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 09:36:05,091 INFO L93 Difference]: Finished difference Result 7725 states and 9788 transitions. [2021-12-15 09:36:05,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 09:36:05,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 201 [2021-12-15 09:36:05,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 09:36:05,105 INFO L225 Difference]: With dead ends: 7725 [2021-12-15 09:36:05,105 INFO L226 Difference]: Without dead ends: 5258 [2021-12-15 09:36:05,108 INFO L932 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 [2021-12-15 09:36:05,109 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 364 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-15 09:36:05,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [364 Valid, 70 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-15 09:36:05,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2021-12-15 09:36:05,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5059. [2021-12-15 09:36:05,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5059 states, 5058 states have (on average 1.2370502174772637) internal successors, (6257), 5058 states have internal predecessors, (6257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:05,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5059 states to 5059 states and 6257 transitions. [2021-12-15 09:36:05,180 INFO L78 Accepts]: Start accepts. Automaton has 5059 states and 6257 transitions. Word has length 201 [2021-12-15 09:36:05,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 09:36:05,181 INFO L470 AbstractCegarLoop]: Abstraction has 5059 states and 6257 transitions. [2021-12-15 09:36:05,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:05,181 INFO L276 IsEmpty]: Start isEmpty. Operand 5059 states and 6257 transitions. [2021-12-15 09:36:05,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2021-12-15 09:36:05,183 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 09:36:05,183 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-15 09:36:05,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 09:36:05,184 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 09:36:05,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 09:36:05,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1437713679, now seen corresponding path program 1 times [2021-12-15 09:36:05,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 09:36:05,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867001756] [2021-12-15 09:36:05,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 09:36:05,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 09:36:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 09:36:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-15 09:36:05,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 09:36:05,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867001756] [2021-12-15 09:36:05,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867001756] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 09:36:05,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 09:36:05,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 09:36:05,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256383264] [2021-12-15 09:36:05,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 09:36:05,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 09:36:05,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 09:36:05,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 09:36:05,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 09:36:05,287 INFO L87 Difference]: Start difference. First operand 5059 states and 6257 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:06,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 09:36:06,101 INFO L93 Difference]: Finished difference Result 11235 states and 14124 transitions. [2021-12-15 09:36:06,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 09:36:06,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 202 [2021-12-15 09:36:06,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 09:36:06,125 INFO L225 Difference]: With dead ends: 11235 [2021-12-15 09:36:06,125 INFO L226 Difference]: Without dead ends: 6546 [2021-12-15 09:36:06,131 INFO L932 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 [2021-12-15 09:36:06,132 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 177 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-15 09:36:06,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 371 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-15 09:36:06,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6546 states. [2021-12-15 09:36:06,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6546 to 6347. [2021-12-15 09:36:06,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6347 states, 6346 states have (on average 1.219193192562244) internal successors, (7737), 6346 states have internal predecessors, (7737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:06,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6347 states to 6347 states and 7737 transitions. [2021-12-15 09:36:06,290 INFO L78 Accepts]: Start accepts. Automaton has 6347 states and 7737 transitions. Word has length 202 [2021-12-15 09:36:06,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 09:36:06,290 INFO L470 AbstractCegarLoop]: Abstraction has 6347 states and 7737 transitions. [2021-12-15 09:36:06,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 6347 states and 7737 transitions. [2021-12-15 09:36:06,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2021-12-15 09:36:06,292 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 09:36:06,292 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 09:36:06,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-15 09:36:06,293 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 09:36:06,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 09:36:06,294 INFO L85 PathProgramCache]: Analyzing trace with hash 547583793, now seen corresponding path program 1 times [2021-12-15 09:36:06,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 09:36:06,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158452320] [2021-12-15 09:36:06,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 09:36:06,294 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 09:36:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 09:36:06,401 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 09:36:06,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 09:36:06,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158452320] [2021-12-15 09:36:06,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158452320] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 09:36:06,401 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 09:36:06,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 09:36:06,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331966170] [2021-12-15 09:36:06,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 09:36:06,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 09:36:06,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 09:36:06,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 09:36:06,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 09:36:06,402 INFO L87 Difference]: Start difference. First operand 6347 states and 7737 transitions. Second operand has 4 states, 4 states have (on average 53.0) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:07,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 09:36:07,499 INFO L93 Difference]: Finished difference Result 14179 states and 17456 transitions. [2021-12-15 09:36:07,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 09:36:07,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 212 [2021-12-15 09:36:07,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 09:36:07,530 INFO L225 Difference]: With dead ends: 14179 [2021-12-15 09:36:07,530 INFO L226 Difference]: Without dead ends: 8202 [2021-12-15 09:36:07,536 INFO L932 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 [2021-12-15 09:36:07,536 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 258 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-15 09:36:07,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 138 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-15 09:36:07,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8202 states. [2021-12-15 09:36:07,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8202 to 8191. [2021-12-15 09:36:07,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8191 states, 8190 states have (on average 1.1989010989010989) internal successors, (9819), 8190 states have internal predecessors, (9819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:07,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8191 states to 8191 states and 9819 transitions. [2021-12-15 09:36:07,645 INFO L78 Accepts]: Start accepts. Automaton has 8191 states and 9819 transitions. Word has length 212 [2021-12-15 09:36:07,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 09:36:07,645 INFO L470 AbstractCegarLoop]: Abstraction has 8191 states and 9819 transitions. [2021-12-15 09:36:07,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:07,646 INFO L276 IsEmpty]: Start isEmpty. Operand 8191 states and 9819 transitions. [2021-12-15 09:36:07,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2021-12-15 09:36:07,648 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 09:36:07,648 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-15 09:36:07,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-15 09:36:07,650 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 09:36:07,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 09:36:07,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1040471553, now seen corresponding path program 1 times [2021-12-15 09:36:07,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 09:36:07,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406806284] [2021-12-15 09:36:07,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 09:36:07,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 09:36:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 09:36:07,732 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-12-15 09:36:07,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 09:36:07,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406806284] [2021-12-15 09:36:07,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406806284] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 09:36:07,733 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 09:36:07,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 09:36:07,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473205901] [2021-12-15 09:36:07,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 09:36:07,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 09:36:07,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 09:36:07,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 09:36:07,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 09:36:07,735 INFO L87 Difference]: Start difference. First operand 8191 states and 9819 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:08,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 09:36:08,289 INFO L93 Difference]: Finished difference Result 17691 states and 21335 transitions. [2021-12-15 09:36:08,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 09:36:08,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 222 [2021-12-15 09:36:08,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 09:36:08,306 INFO L225 Difference]: With dead ends: 17691 [2021-12-15 09:36:08,306 INFO L226 Difference]: Without dead ends: 9871 [2021-12-15 09:36:08,317 INFO L932 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 [2021-12-15 09:36:08,319 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 182 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-15 09:36:08,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 161 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-15 09:36:08,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9871 states. [2021-12-15 09:36:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9871 to 9478. [2021-12-15 09:36:08,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9478 states, 9477 states have (on average 1.1978474200696423) internal successors, (11352), 9477 states have internal predecessors, (11352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:08,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9478 states to 9478 states and 11352 transitions. [2021-12-15 09:36:08,423 INFO L78 Accepts]: Start accepts. Automaton has 9478 states and 11352 transitions. Word has length 222 [2021-12-15 09:36:08,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 09:36:08,424 INFO L470 AbstractCegarLoop]: Abstraction has 9478 states and 11352 transitions. [2021-12-15 09:36:08,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:08,424 INFO L276 IsEmpty]: Start isEmpty. Operand 9478 states and 11352 transitions. [2021-12-15 09:36:08,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2021-12-15 09:36:08,426 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 09:36:08,427 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-15 09:36:08,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-15 09:36:08,427 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 09:36:08,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 09:36:08,427 INFO L85 PathProgramCache]: Analyzing trace with hash 924427962, now seen corresponding path program 1 times [2021-12-15 09:36:08,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 09:36:08,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767010714] [2021-12-15 09:36:08,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 09:36:08,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 09:36:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 09:36:08,495 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-12-15 09:36:08,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 09:36:08,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767010714] [2021-12-15 09:36:08,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767010714] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 09:36:08,495 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 09:36:08,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 09:36:08,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079421588] [2021-12-15 09:36:08,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 09:36:08,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 09:36:08,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 09:36:08,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 09:36:08,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 09:36:08,497 INFO L87 Difference]: Start difference. First operand 9478 states and 11352 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:09,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 09:36:09,136 INFO L93 Difference]: Finished difference Result 18963 states and 22726 transitions. [2021-12-15 09:36:09,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 09:36:09,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229 [2021-12-15 09:36:09,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 09:36:09,147 INFO L225 Difference]: With dead ends: 18963 [2021-12-15 09:36:09,147 INFO L226 Difference]: Without dead ends: 9671 [2021-12-15 09:36:09,154 INFO L932 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 [2021-12-15 09:36:09,155 INFO L933 BasicCegarLoop]: 356 mSDtfsCounter, 181 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-15 09:36:09,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 378 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-15 09:36:09,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9671 states. [2021-12-15 09:36:09,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9671 to 9661. [2021-12-15 09:36:09,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9661 states, 9660 states have (on average 1.162008281573499) internal successors, (11225), 9660 states have internal predecessors, (11225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:09,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9661 states to 9661 states and 11225 transitions. [2021-12-15 09:36:09,244 INFO L78 Accepts]: Start accepts. Automaton has 9661 states and 11225 transitions. Word has length 229 [2021-12-15 09:36:09,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 09:36:09,245 INFO L470 AbstractCegarLoop]: Abstraction has 9661 states and 11225 transitions. [2021-12-15 09:36:09,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:09,245 INFO L276 IsEmpty]: Start isEmpty. Operand 9661 states and 11225 transitions. [2021-12-15 09:36:09,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2021-12-15 09:36:09,248 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 09:36:09,248 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 09:36:09,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-15 09:36:09,249 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 09:36:09,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 09:36:09,249 INFO L85 PathProgramCache]: Analyzing trace with hash 799814215, now seen corresponding path program 1 times [2021-12-15 09:36:09,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 09:36:09,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576860532] [2021-12-15 09:36:09,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 09:36:09,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 09:36:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 09:36:09,365 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-12-15 09:36:09,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 09:36:09,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576860532] [2021-12-15 09:36:09,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576860532] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 09:36:09,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001607597] [2021-12-15 09:36:09,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 09:36:09,366 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 09:36:09,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 09:36:09,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 09:36:09,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-15 09:36:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 09:36:09,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 09:36:09,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 09:36:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-12-15 09:36:09,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 09:36:10,344 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-12-15 09:36:10,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001607597] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-15 09:36:10,345 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-15 09:36:10,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2021-12-15 09:36:10,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799853910] [2021-12-15 09:36:10,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 09:36:10,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 09:36:10,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 09:36:10,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 09:36:10,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-15 09:36:10,347 INFO L87 Difference]: Start difference. First operand 9661 states and 11225 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:11,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 09:36:11,151 INFO L93 Difference]: Finished difference Result 21895 states and 25740 transitions. [2021-12-15 09:36:11,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 09:36:11,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 255 [2021-12-15 09:36:11,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 09:36:11,169 INFO L225 Difference]: With dead ends: 21895 [2021-12-15 09:36:11,169 INFO L226 Difference]: Without dead ends: 12605 [2021-12-15 09:36:11,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 507 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-15 09:36:11,178 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 204 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-15 09:36:11,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 158 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-15 09:36:11,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12605 states. [2021-12-15 09:36:11,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12605 to 12421. [2021-12-15 09:36:11,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12421 states, 12420 states have (on average 1.1477455716586151) internal successors, (14255), 12420 states have internal predecessors, (14255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:11,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12421 states to 12421 states and 14255 transitions. [2021-12-15 09:36:11,313 INFO L78 Accepts]: Start accepts. Automaton has 12421 states and 14255 transitions. Word has length 255 [2021-12-15 09:36:11,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 09:36:11,314 INFO L470 AbstractCegarLoop]: Abstraction has 12421 states and 14255 transitions. [2021-12-15 09:36:11,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:11,314 INFO L276 IsEmpty]: Start isEmpty. Operand 12421 states and 14255 transitions. [2021-12-15 09:36:11,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-12-15 09:36:11,318 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 09:36:11,318 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 09:36:11,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-15 09:36:11,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-15 09:36:11,532 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 09:36:11,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 09:36:11,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1145868587, now seen corresponding path program 1 times [2021-12-15 09:36:11,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 09:36:11,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244335680] [2021-12-15 09:36:11,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 09:36:11,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 09:36:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 09:36:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-15 09:36:11,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 09:36:11,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244335680] [2021-12-15 09:36:11,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244335680] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 09:36:11,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 09:36:11,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 09:36:11,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305772505] [2021-12-15 09:36:11,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 09:36:11,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 09:36:11,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 09:36:11,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 09:36:11,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 09:36:11,615 INFO L87 Difference]: Start difference. First operand 12421 states and 14255 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:12,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 09:36:12,360 INFO L93 Difference]: Finished difference Result 29092 states and 33751 transitions. [2021-12-15 09:36:12,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 09:36:12,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 279 [2021-12-15 09:36:12,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 09:36:12,383 INFO L225 Difference]: With dead ends: 29092 [2021-12-15 09:36:12,383 INFO L226 Difference]: Without dead ends: 17042 [2021-12-15 09:36:12,391 INFO L932 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 [2021-12-15 09:36:12,393 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 137 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-15 09:36:12,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 116 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-15 09:36:12,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17042 states. [2021-12-15 09:36:12,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17042 to 17038. [2021-12-15 09:36:12,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17038 states, 17037 states have (on average 1.1472090156717731) internal successors, (19545), 17037 states have internal predecessors, (19545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17038 states to 17038 states and 19545 transitions. [2021-12-15 09:36:12,546 INFO L78 Accepts]: Start accepts. Automaton has 17038 states and 19545 transitions. Word has length 279 [2021-12-15 09:36:12,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 09:36:12,546 INFO L470 AbstractCegarLoop]: Abstraction has 17038 states and 19545 transitions. [2021-12-15 09:36:12,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:12,546 INFO L276 IsEmpty]: Start isEmpty. Operand 17038 states and 19545 transitions. [2021-12-15 09:36:12,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2021-12-15 09:36:12,551 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 09:36:12,552 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 09:36:12,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-15 09:36:12,552 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 09:36:12,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 09:36:12,553 INFO L85 PathProgramCache]: Analyzing trace with hash 272564974, now seen corresponding path program 1 times [2021-12-15 09:36:12,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 09:36:12,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133119] [2021-12-15 09:36:12,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 09:36:12,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 09:36:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 09:36:12,637 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 09:36:12,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 09:36:12,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133119] [2021-12-15 09:36:12,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133119] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 09:36:12,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 09:36:12,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 09:36:12,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155301593] [2021-12-15 09:36:12,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 09:36:12,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 09:36:12,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 09:36:12,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 09:36:12,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 09:36:12,640 INFO L87 Difference]: Start difference. First operand 17038 states and 19545 transitions. Second operand has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:13,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 09:36:13,888 INFO L93 Difference]: Finished difference Result 38879 states and 44608 transitions. [2021-12-15 09:36:13,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 09:36:13,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 289 [2021-12-15 09:36:13,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 09:36:13,922 INFO L225 Difference]: With dead ends: 38879 [2021-12-15 09:36:13,922 INFO L226 Difference]: Without dead ends: 22212 [2021-12-15 09:36:13,937 INFO L932 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 [2021-12-15 09:36:13,938 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 290 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-15 09:36:13,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 103 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-15 09:36:13,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22212 states. [2021-12-15 09:36:14,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22212 to 22200. [2021-12-15 09:36:14,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22200 states, 22199 states have (on average 1.1317626920131538) internal successors, (25124), 22199 states have internal predecessors, (25124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:14,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22200 states to 22200 states and 25124 transitions. [2021-12-15 09:36:14,176 INFO L78 Accepts]: Start accepts. Automaton has 22200 states and 25124 transitions. Word has length 289 [2021-12-15 09:36:14,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 09:36:14,177 INFO L470 AbstractCegarLoop]: Abstraction has 22200 states and 25124 transitions. [2021-12-15 09:36:14,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:14,177 INFO L276 IsEmpty]: Start isEmpty. Operand 22200 states and 25124 transitions. [2021-12-15 09:36:14,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2021-12-15 09:36:14,182 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 09:36:14,182 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 09:36:14,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-15 09:36:14,182 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 09:36:14,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 09:36:14,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1575757596, now seen corresponding path program 1 times [2021-12-15 09:36:14,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 09:36:14,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502670650] [2021-12-15 09:36:14,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 09:36:14,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 09:36:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 09:36:14,276 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 134 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 09:36:14,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 09:36:14,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502670650] [2021-12-15 09:36:14,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502670650] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 09:36:14,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410048752] [2021-12-15 09:36:14,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 09:36:14,277 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 09:36:14,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 09:36:14,278 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 09:36:14,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-15 09:36:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 09:36:14,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 09:36:14,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 09:36:14,886 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-15 09:36:14,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 09:36:14,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410048752] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 09:36:14,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 09:36:14,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-12-15 09:36:14,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295500774] [2021-12-15 09:36:14,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 09:36:14,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 09:36:14,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 09:36:14,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 09:36:14,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-15 09:36:14,888 INFO L87 Difference]: Start difference. First operand 22200 states and 25124 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:15,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 09:36:15,527 INFO L93 Difference]: Finished difference Result 44967 states and 50932 transitions. [2021-12-15 09:36:15,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 09:36:15,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 293 [2021-12-15 09:36:15,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 09:36:15,551 INFO L225 Difference]: With dead ends: 44967 [2021-12-15 09:36:15,551 INFO L226 Difference]: Without dead ends: 23138 [2021-12-15 09:36:15,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-15 09:36:15,567 INFO L933 BasicCegarLoop]: 354 mSDtfsCounter, 132 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-15 09:36:15,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 376 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-15 09:36:15,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23138 states. [2021-12-15 09:36:15,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23138 to 23130. [2021-12-15 09:36:15,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23130 states, 23129 states have (on average 1.130312594578235) internal successors, (26143), 23129 states have internal predecessors, (26143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:15,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23130 states to 23130 states and 26143 transitions. [2021-12-15 09:36:15,816 INFO L78 Accepts]: Start accepts. Automaton has 23130 states and 26143 transitions. Word has length 293 [2021-12-15 09:36:15,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 09:36:15,816 INFO L470 AbstractCegarLoop]: Abstraction has 23130 states and 26143 transitions. [2021-12-15 09:36:15,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:15,816 INFO L276 IsEmpty]: Start isEmpty. Operand 23130 states and 26143 transitions. [2021-12-15 09:36:15,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2021-12-15 09:36:15,821 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 09:36:15,821 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 09:36:15,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-15 09:36:16,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-15 09:36:16,038 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 09:36:16,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 09:36:16,039 INFO L85 PathProgramCache]: Analyzing trace with hash 22573387, now seen corresponding path program 1 times [2021-12-15 09:36:16,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 09:36:16,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303935656] [2021-12-15 09:36:16,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 09:36:16,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 09:36:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 09:36:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-12-15 09:36:16,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 09:36:16,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303935656] [2021-12-15 09:36:16,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303935656] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 09:36:16,125 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 09:36:16,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 09:36:16,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431187909] [2021-12-15 09:36:16,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 09:36:16,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 09:36:16,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 09:36:16,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 09:36:16,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 09:36:16,127 INFO L87 Difference]: Start difference. First operand 23130 states and 26143 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:16,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 09:36:16,711 INFO L93 Difference]: Finished difference Result 43271 states and 48757 transitions. [2021-12-15 09:36:16,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 09:36:16,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 299 [2021-12-15 09:36:16,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 09:36:16,730 INFO L225 Difference]: With dead ends: 43271 [2021-12-15 09:36:16,731 INFO L226 Difference]: Without dead ends: 20512 [2021-12-15 09:36:16,744 INFO L932 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 [2021-12-15 09:36:16,746 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 163 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-15 09:36:16,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 151 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-15 09:36:16,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20512 states. [2021-12-15 09:36:16,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20512 to 18668. [2021-12-15 09:36:16,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18668 states, 18667 states have (on average 1.1011410510526598) internal successors, (20555), 18667 states have internal predecessors, (20555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:16,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18668 states to 18668 states and 20555 transitions. [2021-12-15 09:36:16,975 INFO L78 Accepts]: Start accepts. Automaton has 18668 states and 20555 transitions. Word has length 299 [2021-12-15 09:36:16,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 09:36:16,976 INFO L470 AbstractCegarLoop]: Abstraction has 18668 states and 20555 transitions. [2021-12-15 09:36:16,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:16,976 INFO L276 IsEmpty]: Start isEmpty. Operand 18668 states and 20555 transitions. [2021-12-15 09:36:16,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2021-12-15 09:36:16,981 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 09:36:16,982 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 09:36:16,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-15 09:36:16,982 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 09:36:16,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 09:36:16,982 INFO L85 PathProgramCache]: Analyzing trace with hash -253728649, now seen corresponding path program 1 times [2021-12-15 09:36:16,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 09:36:16,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826207820] [2021-12-15 09:36:16,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 09:36:16,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 09:36:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 09:36:17,076 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 53 proven. 153 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2021-12-15 09:36:17,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 09:36:17,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826207820] [2021-12-15 09:36:17,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826207820] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 09:36:17,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119880392] [2021-12-15 09:36:17,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 09:36:17,077 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 09:36:17,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 09:36:17,078 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 09:36:17,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-15 09:36:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 09:36:17,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 09:36:17,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 09:36:17,820 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2021-12-15 09:36:17,820 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 09:36:17,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119880392] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 09:36:17,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 09:36:17,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-12-15 09:36:17,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802986322] [2021-12-15 09:36:17,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 09:36:17,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 09:36:17,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 09:36:17,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 09:36:17,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-15 09:36:17,822 INFO L87 Difference]: Start difference. First operand 18668 states and 20555 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:18,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 09:36:18,441 INFO L93 Difference]: Finished difference Result 37337 states and 41148 transitions. [2021-12-15 09:36:18,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 09:36:18,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 336 [2021-12-15 09:36:18,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 09:36:18,460 INFO L225 Difference]: With dead ends: 37337 [2021-12-15 09:36:18,461 INFO L226 Difference]: Without dead ends: 19039 [2021-12-15 09:36:18,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-15 09:36:18,473 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 111 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-15 09:36:18,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 372 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-15 09:36:18,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19039 states. [2021-12-15 09:36:18,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19039 to 19036. [2021-12-15 09:36:18,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19036 states, 19035 states have (on average 1.1001313370107697) internal successors, (20941), 19035 states have internal predecessors, (20941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19036 states to 19036 states and 20941 transitions. [2021-12-15 09:36:18,684 INFO L78 Accepts]: Start accepts. Automaton has 19036 states and 20941 transitions. Word has length 336 [2021-12-15 09:36:18,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 09:36:18,685 INFO L470 AbstractCegarLoop]: Abstraction has 19036 states and 20941 transitions. [2021-12-15 09:36:18,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:18,685 INFO L276 IsEmpty]: Start isEmpty. Operand 19036 states and 20941 transitions. [2021-12-15 09:36:18,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2021-12-15 09:36:18,691 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 09:36:18,691 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 09:36:18,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-15 09:36:18,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 09:36:18,909 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 09:36:18,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 09:36:18,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1125356190, now seen corresponding path program 1 times [2021-12-15 09:36:18,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 09:36:18,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936440548] [2021-12-15 09:36:18,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 09:36:18,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 09:36:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 09:36:19,033 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2021-12-15 09:36:19,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 09:36:19,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936440548] [2021-12-15 09:36:19,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936440548] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 09:36:19,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 09:36:19,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 09:36:19,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955575962] [2021-12-15 09:36:19,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 09:36:19,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 09:36:19,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 09:36:19,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 09:36:19,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 09:36:19,036 INFO L87 Difference]: Start difference. First operand 19036 states and 20941 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:19,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 09:36:19,678 INFO L93 Difference]: Finished difference Result 39925 states and 43983 transitions. [2021-12-15 09:36:19,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 09:36:19,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 341 [2021-12-15 09:36:19,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 09:36:19,699 INFO L225 Difference]: With dead ends: 39925 [2021-12-15 09:36:19,699 INFO L226 Difference]: Without dead ends: 21259 [2021-12-15 09:36:19,711 INFO L932 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 [2021-12-15 09:36:19,712 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 206 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-15 09:36:19,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 129 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-15 09:36:19,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21259 states. [2021-12-15 09:36:19,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21259 to 19411. [2021-12-15 09:36:19,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19411 states, 19410 states have (on average 1.1005151983513652) internal successors, (21361), 19410 states have internal predecessors, (21361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:19,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19411 states to 19411 states and 21361 transitions. [2021-12-15 09:36:19,915 INFO L78 Accepts]: Start accepts. Automaton has 19411 states and 21361 transitions. Word has length 341 [2021-12-15 09:36:19,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 09:36:19,915 INFO L470 AbstractCegarLoop]: Abstraction has 19411 states and 21361 transitions. [2021-12-15 09:36:19,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:19,915 INFO L276 IsEmpty]: Start isEmpty. Operand 19411 states and 21361 transitions. [2021-12-15 09:36:19,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2021-12-15 09:36:19,922 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 09:36:19,922 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 09:36:19,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-15 09:36:19,923 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 09:36:19,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 09:36:19,923 INFO L85 PathProgramCache]: Analyzing trace with hash -285753362, now seen corresponding path program 1 times [2021-12-15 09:36:19,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 09:36:19,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776511000] [2021-12-15 09:36:19,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 09:36:19,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 09:36:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 09:36:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 53 proven. 200 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-12-15 09:36:20,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 09:36:20,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776511000] [2021-12-15 09:36:20,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776511000] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 09:36:20,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691245139] [2021-12-15 09:36:20,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 09:36:20,059 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 09:36:20,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 09:36:20,076 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 09:36:20,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-15 09:36:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 09:36:20,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-15 09:36:20,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 09:36:21,868 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 151 proven. 179 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 09:36:21,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 09:36:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 151 proven. 179 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 09:36:24,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691245139] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 09:36:24,766 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 09:36:24,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2021-12-15 09:36:24,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041174572] [2021-12-15 09:36:24,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 09:36:24,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 09:36:24,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 09:36:24,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 09:36:24,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-15 09:36:24,768 INFO L87 Difference]: Start difference. First operand 19411 states and 21361 transitions. Second operand has 12 states, 12 states have (on average 71.0) internal successors, (852), 11 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:29,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 09:36:29,904 INFO L93 Difference]: Finished difference Result 56522 states and 61938 transitions. [2021-12-15 09:36:29,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-15 09:36:29,905 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 71.0) internal successors, (852), 11 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 358 [2021-12-15 09:36:29,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 09:36:29,944 INFO L225 Difference]: With dead ends: 56522 [2021-12-15 09:36:29,944 INFO L226 Difference]: Without dead ends: 37481 [2021-12-15 09:36:29,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 747 GetRequests, 707 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=464, Invalid=1176, Unknown=0, NotChecked=0, Total=1640 [2021-12-15 09:36:29,960 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 4381 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 7507 mSolverCounterSat, 1672 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4381 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 9179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1672 IncrementalHoareTripleChecker+Valid, 7507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2021-12-15 09:36:29,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4381 Valid, 209 Invalid, 9179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1672 Valid, 7507 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2021-12-15 09:36:29,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37481 states. [2021-12-15 09:36:30,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37481 to 26765. [2021-12-15 09:36:30,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26765 states, 26764 states have (on average 1.0894485129278135) internal successors, (29158), 26764 states have internal predecessors, (29158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:30,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26765 states to 26765 states and 29158 transitions. [2021-12-15 09:36:30,289 INFO L78 Accepts]: Start accepts. Automaton has 26765 states and 29158 transitions. Word has length 358 [2021-12-15 09:36:30,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 09:36:30,289 INFO L470 AbstractCegarLoop]: Abstraction has 26765 states and 29158 transitions. [2021-12-15 09:36:30,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 71.0) internal successors, (852), 11 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 09:36:30,289 INFO L276 IsEmpty]: Start isEmpty. Operand 26765 states and 29158 transitions. [2021-12-15 09:36:30,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2021-12-15 09:36:30,297 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 09:36:30,297 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-15 09:36:30,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-15 09:36:30,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-15 09:36:30,514 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 09:36:30,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 09:36:30,515 INFO L85 PathProgramCache]: Analyzing trace with hash 480560374, now seen corresponding path program 1 times [2021-12-15 09:36:30,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 09:36:30,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130494420] [2021-12-15 09:36:30,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 09:36:30,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 09:36:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 09:36:30,726 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 09:36:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 09:36:30,865 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 09:36:30,866 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-15 09:36:30,867 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-15 09:36:30,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-15 09:36:30,870 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 09:36:30,873 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-15 09:36:30,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:36:30 BoogieIcfgContainer [2021-12-15 09:36:30,985 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-15 09:36:30,985 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 09:36:30,985 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 09:36:30,985 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 09:36:30,986 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:35:59" (3/4) ... [2021-12-15 09:36:30,987 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-15 09:36:31,111 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-15 09:36:31,111 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 09:36:31,112 INFO L158 Benchmark]: Toolchain (without parser) took 33757.91ms. Allocated memory was 104.9MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 72.7MB in the beginning and 1.1GB in the end (delta: -998.5MB). Peak memory consumption was 335.0MB. Max. memory is 16.1GB. [2021-12-15 09:36:31,113 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory was 63.8MB in the beginning and 63.7MB in the end (delta: 47.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 09:36:31,113 INFO L158 Benchmark]: CACSL2BoogieTranslator took 622.29ms. Allocated memory was 104.9MB in the beginning and 138.4MB in the end (delta: 33.6MB). Free memory was 72.5MB in the beginning and 81.3MB in the end (delta: -8.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2021-12-15 09:36:31,113 INFO L158 Benchmark]: Boogie Procedure Inliner took 153.86ms. Allocated memory is still 138.4MB. Free memory was 81.3MB in the beginning and 98.8MB in the end (delta: -17.5MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2021-12-15 09:36:31,113 INFO L158 Benchmark]: Boogie Preprocessor took 81.96ms. Allocated memory is still 138.4MB. Free memory was 98.8MB in the beginning and 89.6MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 09:36:31,113 INFO L158 Benchmark]: RCFGBuilder took 1236.06ms. Allocated memory is still 138.4MB. Free memory was 89.6MB in the beginning and 83.2MB in the end (delta: 6.4MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2021-12-15 09:36:31,114 INFO L158 Benchmark]: TraceAbstraction took 31530.81ms. Allocated memory was 138.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 82.4MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 268.2MB. Max. memory is 16.1GB. [2021-12-15 09:36:31,114 INFO L158 Benchmark]: Witness Printer took 126.18ms. Allocated memory is still 1.4GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2021-12-15 09:36:31,117 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory was 63.8MB in the beginning and 63.7MB in the end (delta: 47.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 622.29ms. Allocated memory was 104.9MB in the beginning and 138.4MB in the end (delta: 33.6MB). Free memory was 72.5MB in the beginning and 81.3MB in the end (delta: -8.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 153.86ms. Allocated memory is still 138.4MB. Free memory was 81.3MB in the beginning and 98.8MB in the end (delta: -17.5MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.96ms. Allocated memory is still 138.4MB. Free memory was 98.8MB in the beginning and 89.6MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1236.06ms. Allocated memory is still 138.4MB. Free memory was 89.6MB in the beginning and 83.2MB in the end (delta: 6.4MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. * TraceAbstraction took 31530.81ms. Allocated memory was 138.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 82.4MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 268.2MB. Max. memory is 16.1GB. * Witness Printer took 126.18ms. Allocated memory is still 1.4GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 76]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int inputA = 1; [L18] int inputD = 4; [L19] int inputB = 2; [L20] int inputE = 5; [L21] int inputF = 6; [L22] int inputC = 3; [L25] int a29 = 130; [L26] int a4 = 1; [L27] int a23 = 312; [L28] int a8 = 15; [L29] int a25 = 10; [L30] int a3 = 1; VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1041] int output = -1; VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L1044] COND TRUE 1 [L1047] int input; [L1048] input = __VERIFIER_nondet_int() [L1049] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1052] CALL, EXPR calculate_output(input) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L204] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L213] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L217] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L237] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L243] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L250] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L278] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L332] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L344] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L356] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L368] COND FALSE !(((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(( 306 < a23 && ((a4==1) && (((((((a25==11) || (a25==12)) || (a25==13)) && (input == 3)) && (a8==15)) && (a3==1)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L387] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && (((a8==15) && ((input == 2) && ((( a29 <= 140 && (a25==13)) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ((a25==10) && ((140 < a29) && (245 >= a29)) )))) && (a3==1))) && !(a4==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L401] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L421] COND FALSE !(((a8==15) && ((( 306 < a23 && (((((a25==11) || (a25==12)) || (a25==13)) && (input == 6)) && ((245 < a29) && (277 >= a29)) )) && (a4==1)) && (a3==1)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L427] COND FALSE !((((((!(a4==1) && ((a8==15) && (input == 2))) && (a3==1)) && ((140 < a29) && (245 >= a29)) ) && (a25==12)) && a23 <= -43 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L432] COND FALSE !(( a23 <= -43 && (( a29 <= 140 && ((a8==15) && (!(a4==1) && (((a25==12) || (a25==13)) && (input == 3))))) && (a3==1)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L439] COND FALSE !(((((((input == 6) && ((((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ( ((140 < a29) && (245 >= a29)) && (a25==10)))) && (a8==15)) && (a3==1)) && !(a4==1)) && ((-43 < a23) && (138 >= a23)) )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((!(a4==1) && (((((a3==1) && (input == 4)) && (a25==11)) && ((245 < a29) && (277 >= a29)) ) && a23 <= -43 )) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L453] COND FALSE !(((a3==1) && ( ((140 < a29) && (245 >= a29)) && ( a23 <= -43 && ((a8==15) && (!(a4==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 3)))))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L460] COND FALSE !(((((!(a4==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 4)) && 277 < a29 )) && a23 <= -43 ) && (a8==15)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L466] COND FALSE !(( ((140 < a29) && (245 >= a29)) && ((a8==15) && (((a25==12) && (!(a4==1) && ( a23 <= -43 && (input == 4)))) && (a3==1))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L473] COND FALSE !(((a3==1) && ((((((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || (((a25==9) && (!(a4==1) && a29 <= 140 )) && a23 <= -43 )) && (input == 2)) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L480] COND FALSE !(((((input == 5) && (((((a25==12) && ((a4==1) && 277 < a29 )) && 306 < a23 ) || ((( 277 < a29 && (a4==1)) && (a25==13)) && 306 < a23 )) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ))) && (a8==15)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !(((a25==12) && (((a3==1) && ((((input == 1) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) ) && !(a4==1))) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L497] COND FALSE !((((a8==15) && (( ((-43 < a23) && (138 >= a23)) && ((input == 1) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (((a25==13) && a29 <= 140 ) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))))) && (a3==1))) && !(a4==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L510] COND FALSE !(((a3==1) && ((a8==15) && (((((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 3)) && !(a4==1)) && a23 <= -43 )))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !((( a29 <= 140 && ( ((-43 < a23) && (138 >= a23)) && ((a3==1) && ((a8==15) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 2)))))) && !(a4==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((a4==1) && ( 306 < a23 && ((((input == 3) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L536] COND FALSE !(((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L541] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 5)) && (a3==1))) && (a25==9)) && a29 <= 140 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L547] COND FALSE !(( 306 < a23 && (((a8==15) && ((((input == 1) && ((a25==11) || (a25==12))) && (a4==1)) && (a3==1))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L552] COND FALSE !(((((a8==15) && ( a23 <= -43 && (((input == 1) && ((a25==10) || (a25==11))) && a29 <= 140 ))) && !(a4==1)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L559] COND FALSE !(((( a23 <= -43 && (!(a4==1) && ((a3==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 5))))) && (a8==15)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L565] COND FALSE !(((a3==1) && ( ((-43 < a23) && (138 >= a23)) && ((a8==15) && ((((((a25==10) || (a25==11)) || (a25==12)) && (input == 5)) && a29 <= 140 ) && !(a4==1)))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L571] COND FALSE !(( 306 < a23 && (((a3==1) && ( 277 < a29 && (((input == 4) && (((a25==9) || (a25==10)) || (a25==11))) && (a8==15)))) && (a4==1)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L576] COND FALSE !((!(a4==1) && ( a23 <= -43 && ((a8==15) && (((((a25==12) || ((a25==10) || (a25==11))) && (input == 1)) && (a3==1)) && 277 < a29 ))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L582] COND FALSE !(( 277 < a29 && (((a25==13) && ( a23 <= -43 && (!(a4==1) && ((input == 1) && (a3==1))))) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L585] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (((a25==9) && ((input == 4) && !(a4==1))) && a29 <= 140 )) && (a3==1)) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L591] COND FALSE !(((a8==15) && ((((a3==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 3)) && (a4==1))) && 306 < a23 ) && a29 <= 140 ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L596] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && ((a3==1) && (!(a4==1) && ((input == 4) && (((a25==10) && ((140 < a29) && (245 >= a29)) ) || (((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9)))))))) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L608] COND FALSE !(((((a8==15) && ((!(a4==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 6))) && (a3==1))) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L613] COND FALSE !(( a29 <= 140 && (((a4==1) && ((a8==15) && (((input == 6) && (((a25==10) || (a25==11)) || (a25==12))) && 306 < a23 ))) && (a3==1)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L625] COND FALSE !(((((((a3==1) && ((input == 5) && ((a25==11) || (a25==12)))) && (a4==1)) && 306 < a23 ) && ((140 < a29) && (245 >= a29)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L631] COND FALSE !(((((a4==1) && ( 306 < a23 && ((a8==15) && (((a25==11) || (a25==12)) && (input == 2))))) && ((140 < a29) && (245 >= a29)) ) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L638] COND FALSE !(((((a8==15) && ( a23 <= -43 && (!(a4==1) && ((a25==11) && (input == 5))))) && (a3==1)) && ((245 < a29) && (277 >= a29)) )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L645] COND FALSE !((((((((input == 2) && ((a25==9) || (a25==10))) && (a8==15)) && ((140 < a29) && (245 >= a29)) ) && 306 < a23 ) && (a3==1)) && (a4==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L652] COND FALSE !(((a8==15) && (((( 277 < a29 && ((input == 2) && ((a25==11) || ((a25==9) || (a25==10))))) && (a4==1)) && (a3==1)) && 306 < a23 ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L657] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 3) && ((a25==12) || ((a25==10) || (a25==11))))) && !(a4==1)) && (a8==15)) && a29 <= 140 ) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L668] COND FALSE !((((!(a4==1) && ((((input == 6) && ((a25==12) || ((a25==10) || (a25==11)))) && (a8==15)) && ((-43 < a23) && (138 >= a23)) )) && (a3==1)) && a29 <= 140 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L673] COND FALSE !(((a25==9) && (( a29 <= 140 && ((a3==1) && (!(a4==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 2))))) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L680] COND FALSE !((!(a4==1) && ( a23 <= -43 && (((a8==15) && (((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ( ((245 < a29) && (277 >= a29)) && (a25==13))) || ((a25==9) && 277 < a29 )) && (input == 3))) && (a3==1))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L685] COND FALSE !((((!(a4==1) && ((a3==1) && ((input == 5) && ((( ((245 < a29) && (277 >= a29)) && (a25==12)) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ((a25==9) && 277 < a29 ))))) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L691] COND FALSE !(( a23 <= -43 && (!(a4==1) && ( ((245 < a29) && (277 >= a29)) && ((a8==15) && ((a25==11) && ((a3==1) && (input == 3)))))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L698] COND FALSE !(((((a8==15) && ( 306 < a23 && ( ((140 < a29) && (245 >= a29)) && ((input == 1) && ((a25==9) || (a25==10)))))) && (a4==1)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L704] COND FALSE !((!(a4==1) && (((((a3==1) && ((input == 2) && (((a25==9) || (a25==10)) || (a25==11)))) && ((140 < a29) && (245 >= a29)) ) && a23 <= -43 ) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L716] COND FALSE !(((((((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))) && (input == 6)) && (a3==1)) && 306 < a23 ) && (a4==1)) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !(( 306 < a23 && ((a8==15) && ( 277 < a29 && ((a4==1) && ((a3==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 5)))))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L727] COND FALSE !(((( 277 < a29 && ((a8==15) && (((input == 6) && a23 <= -43 ) && (a25==13)))) && !(a4==1)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L741] COND FALSE !(((a3==1) && (((!(a4==1) && ((( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))) && (input == 3))) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L748] COND FALSE !(((a3==1) && (( 306 < a23 && (((a4==1) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 1))) && a29 <= 140 )) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L753] COND FALSE !((((( a23 <= -43 && ((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))))) && (a3==1)) && !(a4==1)) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L760] COND FALSE !(((!(a4==1) && (((a8==15) && ( a29 <= 140 && (((a25==10) || (a25==11)) && (input == 5)))) && a23 <= -43 )) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L767] COND FALSE !((((((a8==15) && ((a3==1) && ( a23 <= -43 && (input == 5)))) && !(a4==1)) && (a25==13)) && 277 < a29 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L779] COND FALSE !(((a8==15) && ((a3==1) && ( 306 < a23 && ((((((a25==11) || (a25==12)) || (a25==13)) && (input == 1)) && (a4==1)) && ((245 < a29) && (277 >= a29)) ))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L784] COND FALSE !((!(a4==1) && (((((((a25==12) || (a25==13)) && (input == 6)) && (a8==15)) && a23 <= -43 ) && (a3==1)) && a29 <= 140 ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L790] COND FALSE !(((a3==1) && (( a23 <= -43 && (((input == 6) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && !(a4==1))) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L797] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 6)) && (a25==9))) && a29 <= 140 ) && (a3==1)) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L802] COND FALSE !((( a29 <= 140 && ((a3==1) && ((a8==15) && ((a25==13) && ( 306 < a23 && (input == 1)))))) && (a4==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L809] COND FALSE !(((a3==1) && (((a8==15) && (((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9)))) && (input == 5)) && 306 < a23 )) && (a4==1)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L814] COND FALSE !((((((a8==15) && ((input == 4) && (( 277 < a29 && (a25==9)) || (( ((245 < a29) && (277 >= a29)) && (a25==12)) || ( ((245 < a29) && (277 >= a29)) && (a25==13)))))) && !(a4==1)) && a23 <= -43 ) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L826] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (!(a4==1) && ((input == 5) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) )))))) && (a8==15)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L832] COND FALSE !(( a29 <= 140 && ((((( 306 < a23 && (input == 2)) && (a25==13)) && (a4==1)) && (a3==1)) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L835] COND FALSE !(((a8==15) && ((((a3==1) && ((((a25==10) || (a25==11)) && (input == 6)) && a29 <= 140 )) && a23 <= -43 ) && !(a4==1)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L841] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((a8==15) && (((a25==13) || ((a25==11) || (a25==12))) && (input == 4))) && (a4==1)) && (a3==1)) && 306 < a23 ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L846] COND FALSE !((((a3==1) && ((a8==15) && ((((a25==13) && (input == 4)) && (a4==1)) && a29 <= 140 ))) && 306 < a23 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L851] COND FALSE !((( 306 < a23 && ((a25==13) && ((((input == 3) && a29 <= 140 ) && (a3==1)) && (a4==1)))) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L856] COND FALSE !((!(a4==1) && (( 277 < a29 && ((((input == 4) && a23 <= -43 ) && (a8==15)) && (a3==1))) && (a25==13)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L862] COND FALSE !(((a3==1) && (((((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ) || (( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==12))) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13))))) && (input == 1)) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L869] COND FALSE !(( 277 < a29 && ((a3==1) && ((a8==15) && ((a4==1) && ( 306 < a23 && ((input == 6) && (((a25==9) || (a25==10)) || (a25==11))))))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L875] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 4) && ((a25==12) || ((a25==10) || (a25==11))))) && (a8==15)) && !(a4==1)) && (a3==1)) && a29 <= 140 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L886] COND FALSE !(((((( a23 <= -43 && ((input == 5) && ((a25==12) || ((a25==10) || (a25==11))))) && (a3==1)) && !(a4==1)) && 277 < a29 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L891] COND FALSE !(((((a8==15) && ((a4==1) && (((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 2)))) && (a3==1)) && 306 < a23 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L896] COND FALSE !((( a23 <= -43 && ((( ((140 < a29) && (245 >= a29)) && ((input == 1) && (((a25==9) || (a25==10)) || (a25==11)))) && !(a4==1)) && (a8==15))) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L903] COND TRUE ((((a3==1) && ((((input == 2) && ((a25==12) || ((a25==10) || (a25==11)))) && (a4==1)) && (a8==15))) && a29 <= 140 ) && 306 < a23 ) [L905] a25 = 13 [L907] return 23; VAL [\old(input)=2, \result=23, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1052] RET, EXPR calculate_output(input) [L1052] output = calculate_output(input) [L1044] COND TRUE 1 [L1047] int input; [L1048] input = __VERIFIER_nondet_int() [L1049] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1052] CALL, EXPR calculate_output(input) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L204] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L213] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L217] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L237] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L243] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L250] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L278] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L332] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L344] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L356] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L368] COND FALSE !(((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(( 306 < a23 && ((a4==1) && (((((((a25==11) || (a25==12)) || (a25==13)) && (input == 3)) && (a8==15)) && (a3==1)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L387] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && (((a8==15) && ((input == 2) && ((( a29 <= 140 && (a25==13)) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ((a25==10) && ((140 < a29) && (245 >= a29)) )))) && (a3==1))) && !(a4==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L401] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L421] COND FALSE !(((a8==15) && ((( 306 < a23 && (((((a25==11) || (a25==12)) || (a25==13)) && (input == 6)) && ((245 < a29) && (277 >= a29)) )) && (a4==1)) && (a3==1)))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L427] COND FALSE !((((((!(a4==1) && ((a8==15) && (input == 2))) && (a3==1)) && ((140 < a29) && (245 >= a29)) ) && (a25==12)) && a23 <= -43 )) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L432] COND FALSE !(( a23 <= -43 && (( a29 <= 140 && ((a8==15) && (!(a4==1) && (((a25==12) || (a25==13)) && (input == 3))))) && (a3==1)))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L439] COND FALSE !(((((((input == 6) && ((((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ( ((140 < a29) && (245 >= a29)) && (a25==10)))) && (a8==15)) && (a3==1)) && !(a4==1)) && ((-43 < a23) && (138 >= a23)) )) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((!(a4==1) && (((((a3==1) && (input == 4)) && (a25==11)) && ((245 < a29) && (277 >= a29)) ) && a23 <= -43 )) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L453] COND FALSE !(((a3==1) && ( ((140 < a29) && (245 >= a29)) && ( a23 <= -43 && ((a8==15) && (!(a4==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 3)))))))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L460] COND FALSE !(((((!(a4==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 4)) && 277 < a29 )) && a23 <= -43 ) && (a8==15)) && (a3==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L466] COND FALSE !(( ((140 < a29) && (245 >= a29)) && ((a8==15) && (((a25==12) && (!(a4==1) && ( a23 <= -43 && (input == 4)))) && (a3==1))))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L473] COND FALSE !(((a3==1) && ((((((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || (((a25==9) && (!(a4==1) && a29 <= 140 )) && a23 <= -43 )) && (input == 2)) && (a8==15)))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L480] COND FALSE !(((((input == 5) && (((((a25==12) && ((a4==1) && 277 < a29 )) && 306 < a23 ) || ((( 277 < a29 && (a4==1)) && (a25==13)) && 306 < a23 )) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ))) && (a8==15)) && (a3==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !(((a25==12) && (((a3==1) && ((((input == 1) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) ) && !(a4==1))) && (a8==15)))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L497] COND FALSE !((((a8==15) && (( ((-43 < a23) && (138 >= a23)) && ((input == 1) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (((a25==13) && a29 <= 140 ) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))))) && (a3==1))) && !(a4==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L510] COND FALSE !(((a3==1) && ((a8==15) && (((((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 3)) && !(a4==1)) && a23 <= -43 )))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !((( a29 <= 140 && ( ((-43 < a23) && (138 >= a23)) && ((a3==1) && ((a8==15) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 2)))))) && !(a4==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((a4==1) && ( 306 < a23 && ((((input == 3) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L536] COND FALSE !(((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15)))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L541] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 5)) && (a3==1))) && (a25==9)) && a29 <= 140 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L547] COND FALSE !(( 306 < a23 && (((a8==15) && ((((input == 1) && ((a25==11) || (a25==12))) && (a4==1)) && (a3==1))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L552] COND FALSE !(((((a8==15) && ( a23 <= -43 && (((input == 1) && ((a25==10) || (a25==11))) && a29 <= 140 ))) && !(a4==1)) && (a3==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L559] COND FALSE !(((( a23 <= -43 && (!(a4==1) && ((a3==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 5))))) && (a8==15)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L565] COND FALSE !(((a3==1) && ( ((-43 < a23) && (138 >= a23)) && ((a8==15) && ((((((a25==10) || (a25==11)) || (a25==12)) && (input == 5)) && a29 <= 140 ) && !(a4==1)))))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L571] COND FALSE !(( 306 < a23 && (((a3==1) && ( 277 < a29 && (((input == 4) && (((a25==9) || (a25==10)) || (a25==11))) && (a8==15)))) && (a4==1)))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L576] COND FALSE !((!(a4==1) && ( a23 <= -43 && ((a8==15) && (((((a25==12) || ((a25==10) || (a25==11))) && (input == 1)) && (a3==1)) && 277 < a29 ))))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L582] COND FALSE !(( 277 < a29 && (((a25==13) && ( a23 <= -43 && (!(a4==1) && ((input == 1) && (a3==1))))) && (a8==15)))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L585] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (((a25==9) && ((input == 4) && !(a4==1))) && a29 <= 140 )) && (a3==1)) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L591] COND FALSE !(((a8==15) && ((((a3==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 3)) && (a4==1))) && 306 < a23 ) && a29 <= 140 ))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L596] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && ((a3==1) && (!(a4==1) && ((input == 4) && (((a25==10) && ((140 < a29) && (245 >= a29)) ) || (((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9)))))))) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L608] COND FALSE !(((((a8==15) && ((!(a4==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 6))) && (a3==1))) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) )) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L613] COND FALSE !(( a29 <= 140 && (((a4==1) && ((a8==15) && (((input == 6) && (((a25==10) || (a25==11)) || (a25==12))) && 306 < a23 ))) && (a3==1)))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L625] COND FALSE !(((((((a3==1) && ((input == 5) && ((a25==11) || (a25==12)))) && (a4==1)) && 306 < a23 ) && ((140 < a29) && (245 >= a29)) ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L631] COND FALSE !(((((a4==1) && ( 306 < a23 && ((a8==15) && (((a25==11) || (a25==12)) && (input == 2))))) && ((140 < a29) && (245 >= a29)) ) && (a3==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L638] COND FALSE !(((((a8==15) && ( a23 <= -43 && (!(a4==1) && ((a25==11) && (input == 5))))) && (a3==1)) && ((245 < a29) && (277 >= a29)) )) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L645] COND FALSE !((((((((input == 2) && ((a25==9) || (a25==10))) && (a8==15)) && ((140 < a29) && (245 >= a29)) ) && 306 < a23 ) && (a3==1)) && (a4==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L652] COND FALSE !(((a8==15) && (((( 277 < a29 && ((input == 2) && ((a25==11) || ((a25==9) || (a25==10))))) && (a4==1)) && (a3==1)) && 306 < a23 ))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L657] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 3) && ((a25==12) || ((a25==10) || (a25==11))))) && !(a4==1)) && (a8==15)) && a29 <= 140 ) && (a3==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L668] COND FALSE !((((!(a4==1) && ((((input == 6) && ((a25==12) || ((a25==10) || (a25==11)))) && (a8==15)) && ((-43 < a23) && (138 >= a23)) )) && (a3==1)) && a29 <= 140 )) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L673] COND FALSE !(((a25==9) && (( a29 <= 140 && ((a3==1) && (!(a4==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 2))))) && (a8==15)))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L680] COND FALSE !((!(a4==1) && ( a23 <= -43 && (((a8==15) && (((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ( ((245 < a29) && (277 >= a29)) && (a25==13))) || ((a25==9) && 277 < a29 )) && (input == 3))) && (a3==1))))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L685] COND FALSE !((((!(a4==1) && ((a3==1) && ((input == 5) && ((( ((245 < a29) && (277 >= a29)) && (a25==12)) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ((a25==9) && 277 < a29 ))))) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L691] COND FALSE !(( a23 <= -43 && (!(a4==1) && ( ((245 < a29) && (277 >= a29)) && ((a8==15) && ((a25==11) && ((a3==1) && (input == 3)))))))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L698] COND FALSE !(((((a8==15) && ( 306 < a23 && ( ((140 < a29) && (245 >= a29)) && ((input == 1) && ((a25==9) || (a25==10)))))) && (a4==1)) && (a3==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L704] COND FALSE !((!(a4==1) && (((((a3==1) && ((input == 2) && (((a25==9) || (a25==10)) || (a25==11)))) && ((140 < a29) && (245 >= a29)) ) && a23 <= -43 ) && (a8==15)))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L716] COND FALSE !(((((((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))) && (input == 6)) && (a3==1)) && 306 < a23 ) && (a4==1)) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !(( 306 < a23 && ((a8==15) && ( 277 < a29 && ((a4==1) && ((a3==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 5)))))))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L727] COND FALSE !(((( 277 < a29 && ((a8==15) && (((input == 6) && a23 <= -43 ) && (a25==13)))) && !(a4==1)) && (a3==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L741] COND FALSE !(((a3==1) && (((!(a4==1) && ((( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))) && (input == 3))) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L748] COND FALSE !(((a3==1) && (( 306 < a23 && (((a4==1) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 1))) && a29 <= 140 )) && (a8==15)))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L753] COND FALSE !((((( a23 <= -43 && ((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))))) && (a3==1)) && !(a4==1)) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L760] COND FALSE !(((!(a4==1) && (((a8==15) && ( a29 <= 140 && (((a25==10) || (a25==11)) && (input == 5)))) && a23 <= -43 )) && (a3==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L767] COND FALSE !((((((a8==15) && ((a3==1) && ( a23 <= -43 && (input == 5)))) && !(a4==1)) && (a25==13)) && 277 < a29 )) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L779] COND FALSE !(((a8==15) && ((a3==1) && ( 306 < a23 && ((((((a25==11) || (a25==12)) || (a25==13)) && (input == 1)) && (a4==1)) && ((245 < a29) && (277 >= a29)) ))))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L784] COND FALSE !((!(a4==1) && (((((((a25==12) || (a25==13)) && (input == 6)) && (a8==15)) && a23 <= -43 ) && (a3==1)) && a29 <= 140 ))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L790] COND FALSE !(((a3==1) && (( a23 <= -43 && (((input == 6) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && !(a4==1))) && (a8==15)))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L797] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 6)) && (a25==9))) && a29 <= 140 ) && (a3==1)) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L802] COND FALSE !((( a29 <= 140 && ((a3==1) && ((a8==15) && ((a25==13) && ( 306 < a23 && (input == 1)))))) && (a4==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L809] COND FALSE !(((a3==1) && (((a8==15) && (((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9)))) && (input == 5)) && 306 < a23 )) && (a4==1)))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L814] COND FALSE !((((((a8==15) && ((input == 4) && (( 277 < a29 && (a25==9)) || (( ((245 < a29) && (277 >= a29)) && (a25==12)) || ( ((245 < a29) && (277 >= a29)) && (a25==13)))))) && !(a4==1)) && a23 <= -43 ) && (a3==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L826] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (!(a4==1) && ((input == 5) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) )))))) && (a8==15)) && (a3==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L832] COND FALSE !(( a29 <= 140 && ((((( 306 < a23 && (input == 2)) && (a25==13)) && (a4==1)) && (a3==1)) && (a8==15)))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L835] COND FALSE !(((a8==15) && ((((a3==1) && ((((a25==10) || (a25==11)) && (input == 6)) && a29 <= 140 )) && a23 <= -43 ) && !(a4==1)))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L841] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((a8==15) && (((a25==13) || ((a25==11) || (a25==12))) && (input == 4))) && (a4==1)) && (a3==1)) && 306 < a23 ))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L846] COND FALSE !((((a3==1) && ((a8==15) && ((((a25==13) && (input == 4)) && (a4==1)) && a29 <= 140 ))) && 306 < a23 )) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L851] COND FALSE !((( 306 < a23 && ((a25==13) && ((((input == 3) && a29 <= 140 ) && (a3==1)) && (a4==1)))) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L856] COND FALSE !((!(a4==1) && (( 277 < a29 && ((((input == 4) && a23 <= -43 ) && (a8==15)) && (a3==1))) && (a25==13)))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L862] COND FALSE !(((a3==1) && (((((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ) || (( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==12))) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13))))) && (input == 1)) && (a8==15)))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L869] COND FALSE !(( 277 < a29 && ((a3==1) && ((a8==15) && ((a4==1) && ( 306 < a23 && ((input == 6) && (((a25==9) || (a25==10)) || (a25==11))))))))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L875] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 4) && ((a25==12) || ((a25==10) || (a25==11))))) && (a8==15)) && !(a4==1)) && (a3==1)) && a29 <= 140 )) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L886] COND FALSE !(((((( a23 <= -43 && ((input == 5) && ((a25==12) || ((a25==10) || (a25==11))))) && (a3==1)) && !(a4==1)) && 277 < a29 ) && (a8==15))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L891] COND FALSE !(((((a8==15) && ((a4==1) && (((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 2)))) && (a3==1)) && 306 < a23 )) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L896] COND FALSE !((( a23 <= -43 && ((( ((140 < a29) && (245 >= a29)) && ((input == 1) && (((a25==9) || (a25==10)) || (a25==11)))) && !(a4==1)) && (a8==15))) && (a3==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L903] COND FALSE !(((((a3==1) && ((((input == 2) && ((a25==12) || ((a25==10) || (a25==11)))) && (a4==1)) && (a8==15))) && a29 <= 140 ) && 306 < a23 )) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L908] COND FALSE !((((((a3==1) && (((input == 1) && (((a25==9) || (a25==10)) || (a25==11))) && 277 < a29 )) && (a4==1)) && (a8==15)) && 306 < a23 )) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L913] COND FALSE !((((a3==1) && ( a23 <= -43 && ((a8==15) && ((input == 2) && (((a25==9) && 277 < a29 ) || (( ((245 < a29) && (277 >= a29)) && (a25==12)) || ((a25==13) && ((245 < a29) && (277 >= a29)) ))))))) && !(a4==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L925] COND FALSE !((((((a8==15) && ((a4==1) && ((input == 4) && ((a25==9) || (a25==10))))) && 306 < a23 ) && (a3==1)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L937] COND FALSE !(((( 277 < a29 && ( a23 <= -43 && (((a25==13) && (input == 3)) && (a3==1)))) && (a8==15)) && !(a4==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L942] COND FALSE !((((a8==15) && ( a23 <= -43 && (((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9)))) && (input == 2)) && !(a4==1)))) && (a3==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L949] COND FALSE !((((a8==15) && ( 277 < a29 && (!(a4==1) && ( a23 <= -43 && ((((a25==10) || (a25==11)) || (a25==12)) && (input == 2)))))) && (a3==1))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L963] COND FALSE !(((a3==1) && (( ((-43 < a23) && (138 >= a23)) && ((a8==15) && ((a25==9) && (!(a4==1) && (input == 3))))) && a29 <= 140 ))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L968] COND FALSE !(((a4==1) && ( ((140 < a29) && (245 >= a29)) && ((a3==1) && ( 306 < a23 && (((input == 3) && ((a25==11) || (a25==12))) && (a8==15))))))) VAL [\old(input)=6, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L973] COND TRUE (((a4==1) && ((a3==1) && ((a25==13) && ( 306 < a23 && ((input == 6) && (a8==15)))))) && a29 <= 140 ) [L974] a29 = (((((a29 % 15)- -260) / 5) + -306402) - -306603) [L975] a23 = (((((a23 % 90)- -12) / 5) * 9)/ 10) [L976] a25 = 9 [L978] return -1; VAL [\old(input)=6, \result=-1, a23=9, a25=9, a29=255, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1052] RET, EXPR calculate_output(input) [L1052] output = calculate_output(input) [L1044] COND TRUE 1 [L1047] int input; [L1048] input = __VERIFIER_nondet_int() [L1049] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1052] CALL calculate_output(input) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=9, a25=9, a29=255, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=9, a25=9, a29=255, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=9, a25=9, a29=255, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=9, a25=9, a29=255, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=9, a25=9, a29=255, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=9, a25=9, a29=255, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=9, a25=9, a29=255, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=9, a25=9, a29=255, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=9, a25=9, a29=255, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=9, a25=9, a29=255, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=6, a23=9, a25=9, a29=255, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=9, a25=9, a29=255, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=9, a25=9, a29=255, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=6, a23=9, a25=9, a29=255, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND TRUE ((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)) VAL [\old(input)=6, a23=9, a25=9, a29=255, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] reach_error() VAL [\old(input)=6, a23=9, a25=9, a29=255, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.4s, OverallIterations: 19, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7609 SdHoareTripleChecker+Valid, 16.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7609 mSDsluCounter, 3924 SdHoareTripleChecker+Invalid, 13.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 602 mSDsCounter, 3733 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18484 IncrementalHoareTripleChecker+Invalid, 22217 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3733 mSolverCounterUnsat, 3322 mSDtfsCounter, 18484 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1935 GetRequests, 1865 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26765occurred in iteration=18, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 15828 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 5665 NumberOfCodeBlocks, 5665 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 5891 ConstructedInterpolants, 0 QuantifiedInterpolants, 21428 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1813 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 24 InterpolantComputations, 17 PerfectInterpolantSequences, 3421/4339 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-15 09:36:31,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE