./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label43.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 57096758 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label43.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3 --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 eda729e1e5fb1e87f95dd0bd693b465bb2522219 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-5709675 [2021-10-15 20:28:14,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-15 20:28:14,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-15 20:28:14,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-15 20:28:14,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-15 20:28:14,940 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-15 20:28:14,942 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-15 20:28:14,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-15 20:28:14,951 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-15 20:28:14,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-15 20:28:14,960 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-15 20:28:14,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-15 20:28:14,963 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-15 20:28:14,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-15 20:28:14,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-15 20:28:14,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-15 20:28:14,977 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-15 20:28:14,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-15 20:28:14,982 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-15 20:28:14,992 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-15 20:28:14,995 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-15 20:28:14,997 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-15 20:28:15,001 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-15 20:28:15,002 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-15 20:28:15,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-15 20:28:15,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-15 20:28:15,015 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-15 20:28:15,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-15 20:28:15,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-15 20:28:15,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-15 20:28:15,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-15 20:28:15,022 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-15 20:28:15,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-15 20:28:15,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-15 20:28:15,029 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-15 20:28:15,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-15 20:28:15,030 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-15 20:28:15,031 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-15 20:28:15,031 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-15 20:28:15,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-15 20:28:15,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-15 20:28:15,034 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-15 20:28:15,092 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-15 20:28:15,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-15 20:28:15,094 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-15 20:28:15,094 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-15 20:28:15,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-15 20:28:15,097 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-15 20:28:15,097 INFO L138 SettingsManager]: * Use SBE=true [2021-10-15 20:28:15,098 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-15 20:28:15,098 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-15 20:28:15,098 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-15 20:28:15,099 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-15 20:28:15,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-15 20:28:15,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-15 20:28:15,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-15 20:28:15,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-15 20:28:15,101 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-15 20:28:15,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-15 20:28:15,102 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-15 20:28:15,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-15 20:28:15,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-15 20:28:15,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-15 20:28:15,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-15 20:28:15,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-15 20:28:15,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-15 20:28:15,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-15 20:28:15,104 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-15 20:28:15,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-15 20:28:15,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-15 20:28:15,105 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-15 20:28:15,107 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-15 20:28:15,107 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-15 20:28:15,108 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-15 20:28:15,108 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3 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 -> eda729e1e5fb1e87f95dd0bd693b465bb2522219 [2021-10-15 20:28:15,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-15 20:28:15,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-15 20:28:15,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-15 20:28:15,509 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-15 20:28:15,510 INFO L275 PluginConnector]: CDTParser initialized [2021-10-15 20:28:15,511 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3/../../sv-benchmarks/c/eca-rers2012/Problem11_label43.c [2021-10-15 20:28:15,605 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3/data/cf2035aa9/cb85d517b5b4470496c7f6d3a06ab1de/FLAGae6cb3bba [2021-10-15 20:28:16,458 INFO L306 CDTParser]: Found 1 translation units. [2021-10-15 20:28:16,459 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/sv-benchmarks/c/eca-rers2012/Problem11_label43.c [2021-10-15 20:28:16,496 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3/data/cf2035aa9/cb85d517b5b4470496c7f6d3a06ab1de/FLAGae6cb3bba [2021-10-15 20:28:16,610 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3/data/cf2035aa9/cb85d517b5b4470496c7f6d3a06ab1de [2021-10-15 20:28:16,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-15 20:28:16,615 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-15 20:28:16,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-15 20:28:16,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-15 20:28:16,626 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-15 20:28:16,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 08:28:16" (1/1) ... [2021-10-15 20:28:16,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25e692ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:16, skipping insertion in model container [2021-10-15 20:28:16,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 08:28:16" (1/1) ... [2021-10-15 20:28:16,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-15 20:28:16,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-15 20:28:17,020 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/sv-benchmarks/c/eca-rers2012/Problem11_label43.c[1890,1903] [2021-10-15 20:28:17,503 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-15 20:28:17,514 INFO L203 MainTranslator]: Completed pre-run [2021-10-15 20:28:17,534 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/sv-benchmarks/c/eca-rers2012/Problem11_label43.c[1890,1903] [2021-10-15 20:28:17,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-15 20:28:17,776 INFO L208 MainTranslator]: Completed translation [2021-10-15 20:28:17,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:17 WrapperNode [2021-10-15 20:28:17,778 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-15 20:28:17,779 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-15 20:28:17,779 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-15 20:28:17,780 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-15 20:28:17,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:17" (1/1) ... [2021-10-15 20:28:17,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:17" (1/1) ... [2021-10-15 20:28:17,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-15 20:28:17,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-15 20:28:17,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-15 20:28:17,962 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-15 20:28:17,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:17" (1/1) ... [2021-10-15 20:28:17,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:17" (1/1) ... [2021-10-15 20:28:18,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:17" (1/1) ... [2021-10-15 20:28:18,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:17" (1/1) ... [2021-10-15 20:28:18,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:17" (1/1) ... [2021-10-15 20:28:18,134 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:17" (1/1) ... [2021-10-15 20:28:18,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:17" (1/1) ... [2021-10-15 20:28:18,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-15 20:28:18,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-15 20:28:18,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-15 20:28:18,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-15 20:28:18,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:17" (1/1) ... [2021-10-15 20:28:18,172 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-15 20:28:18,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3/z3 [2021-10-15 20:28:18,199 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-15 20:28:18,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-15 20:28:18,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-15 20:28:18,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-15 20:28:18,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-15 20:28:18,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-15 20:28:20,346 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-15 20:28:20,347 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-15 20:28:20,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 08:28:20 BoogieIcfgContainer [2021-10-15 20:28:20,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-15 20:28:20,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-15 20:28:20,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-15 20:28:20,360 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-15 20:28:20,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 08:28:16" (1/3) ... [2021-10-15 20:28:20,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f306b5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 08:28:20, skipping insertion in model container [2021-10-15 20:28:20,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:28:17" (2/3) ... [2021-10-15 20:28:20,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f306b5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 08:28:20, skipping insertion in model container [2021-10-15 20:28:20,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 08:28:20" (3/3) ... [2021-10-15 20:28:20,366 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem11_label43.c [2021-10-15 20:28:20,373 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-15 20:28:20,373 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-15 20:28:20,428 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-15 20:28:20,436 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, mConcurrency=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-10-15 20:28:20,437 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-15 20:28:20,465 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 283 places, 482 transitions, 964 flow [2021-10-15 20:28:20,646 INFO L129 PetriNetUnfolder]: 200/482 cut-off events. [2021-10-15 20:28:20,647 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-15 20:28:20,649 INFO L84 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 482 events. 200/482 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 334 event pairs, 0 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 0. Up to 121 conditions per place. [2021-10-15 20:28:20,650 INFO L82 GeneralOperation]: Start removeDead. Operand has 283 places, 482 transitions, 964 flow [2021-10-15 20:28:20,666 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 280 places, 477 transitions, 954 flow [2021-10-15 20:28:20,670 INFO L129 PetriNetUnfolder]: 8/28 cut-off events. [2021-10-15 20:28:20,670 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-15 20:28:20,671 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:28:20,672 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 20:28:20,672 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:28:20,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:28:20,680 INFO L82 PathProgramCache]: Analyzing trace with hash -569068670, now seen corresponding path program 1 times [2021-10-15 20:28:20,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:28:20,692 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019630693] [2021-10-15 20:28:20,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:28:20,694 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:28:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:28:20,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 20:28:20,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:28:20,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019630693] [2021-10-15 20:28:20,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019630693] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:28:20,988 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 20:28:20,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-15 20:28:20,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617434638] [2021-10-15 20:28:21,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 20:28:21,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:28:21,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 20:28:21,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 20:28:21,030 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 482 [2021-10-15 20:28:21,034 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 477 transitions, 954 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-10-15 20:28:21,035 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:28:21,035 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 482 [2021-10-15 20:28:21,037 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:28:22,736 INFO L129 PetriNetUnfolder]: 250/731 cut-off events. [2021-10-15 20:28:22,736 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-15 20:28:22,738 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1431 conditions, 731 events. 250/731 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 862 event pairs, 0 based on Foata normal form. 61/483 useless extension candidates. Maximal degree in co-relation 2. Up to 352 conditions per place. [2021-10-15 20:28:22,746 INFO L132 encePairwiseOnDemand]: 223/482 looper letters, 496 selfloop transitions, 117 changer transitions 85/720 dead transitions. [2021-10-15 20:28:22,746 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 720 transitions, 2836 flow [2021-10-15 20:28:22,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 20:28:22,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 20:28:22,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 912 transitions. [2021-10-15 20:28:22,769 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6307053941908713 [2021-10-15 20:28:22,770 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 912 transitions. [2021-10-15 20:28:22,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 912 transitions. [2021-10-15 20:28:22,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:28:22,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 912 transitions. [2021-10-15 20:28:22,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 304.0) internal successors, (912), 3 states have internal predecessors, (912), 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-10-15 20:28:22,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 482.0) internal successors, (1928), 4 states have internal predecessors, (1928), 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-10-15 20:28:22,802 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 482.0) internal successors, (1928), 4 states have internal predecessors, (1928), 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-10-15 20:28:22,804 INFO L186 Difference]: Start difference. First operand has 280 places, 477 transitions, 954 flow. Second operand 3 states and 912 transitions. [2021-10-15 20:28:22,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 720 transitions, 2836 flow [2021-10-15 20:28:22,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 720 transitions, 2836 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-10-15 20:28:22,841 INFO L242 Difference]: Finished difference. Result has 284 places, 444 transitions, 1574 flow [2021-10-15 20:28:22,844 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=482, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1574, PETRI_PLACES=284, PETRI_TRANSITIONS=444} [2021-10-15 20:28:22,845 INFO L334 CegarLoopForPetriNet]: 280 programPoint places, 4 predicate places. [2021-10-15 20:28:22,846 INFO L470 AbstractCegarLoop]: Abstraction has has 284 places, 444 transitions, 1574 flow [2021-10-15 20:28:22,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-10-15 20:28:22,846 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:28:22,847 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 20:28:22,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-15 20:28:22,848 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:28:22,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:28:22,849 INFO L82 PathProgramCache]: Analyzing trace with hash -2114151713, now seen corresponding path program 1 times [2021-10-15 20:28:22,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:28:22,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547674171] [2021-10-15 20:28:22,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:28:22,850 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:28:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:28:23,106 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 20:28:23,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:28:23,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547674171] [2021-10-15 20:28:23,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547674171] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:28:23,108 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 20:28:23,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-15 20:28:23,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097747319] [2021-10-15 20:28:23,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 20:28:23,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:28:23,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 20:28:23,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 20:28:23,119 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 482 [2021-10-15 20:28:23,120 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 444 transitions, 1574 flow. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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-10-15 20:28:23,120 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:28:23,120 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 482 [2021-10-15 20:28:23,121 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:28:24,647 INFO L129 PetriNetUnfolder]: 302/1095 cut-off events. [2021-10-15 20:28:24,648 INFO L130 PetriNetUnfolder]: For 196/196 co-relation queries the response was YES. [2021-10-15 20:28:24,650 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2591 conditions, 1095 events. 302/1095 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1652 event pairs, 0 based on Foata normal form. 104/1169 useless extension candidates. Maximal degree in co-relation 600. Up to 607 conditions per place. [2021-10-15 20:28:24,660 INFO L132 encePairwiseOnDemand]: 340/482 looper letters, 480 selfloop transitions, 183 changer transitions 0/701 dead transitions. [2021-10-15 20:28:24,660 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 701 transitions, 3640 flow [2021-10-15 20:28:24,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 20:28:24,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 20:28:24,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 731 transitions. [2021-10-15 20:28:24,666 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5055325034578146 [2021-10-15 20:28:24,666 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 731 transitions. [2021-10-15 20:28:24,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 731 transitions. [2021-10-15 20:28:24,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:28:24,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 731 transitions. [2021-10-15 20:28:24,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 243.66666666666666) internal successors, (731), 3 states have internal predecessors, (731), 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-10-15 20:28:24,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 482.0) internal successors, (1928), 4 states have internal predecessors, (1928), 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-10-15 20:28:24,683 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 482.0) internal successors, (1928), 4 states have internal predecessors, (1928), 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-10-15 20:28:24,683 INFO L186 Difference]: Start difference. First operand has 284 places, 444 transitions, 1574 flow. Second operand 3 states and 731 transitions. [2021-10-15 20:28:24,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 701 transitions, 3640 flow [2021-10-15 20:28:24,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 701 transitions, 3330 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-15 20:28:24,738 INFO L242 Difference]: Finished difference. Result has 226 places, 520 transitions, 2606 flow [2021-10-15 20:28:24,739 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=482, PETRI_DIFFERENCE_MINUEND_FLOW=1332, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2606, PETRI_PLACES=226, PETRI_TRANSITIONS=520} [2021-10-15 20:28:24,747 INFO L334 CegarLoopForPetriNet]: 280 programPoint places, -54 predicate places. [2021-10-15 20:28:24,748 INFO L470 AbstractCegarLoop]: Abstraction has has 226 places, 520 transitions, 2606 flow [2021-10-15 20:28:24,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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-10-15 20:28:24,749 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:28:24,750 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 20:28:24,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-15 20:28:24,750 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:28:24,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:28:24,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1222833429, now seen corresponding path program 1 times [2021-10-15 20:28:24,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:28:24,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362239352] [2021-10-15 20:28:24,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:28:24,752 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:28:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:28:24,985 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 20:28:24,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:28:24,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362239352] [2021-10-15 20:28:24,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362239352] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:28:24,987 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 20:28:24,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-15 20:28:24,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748696868] [2021-10-15 20:28:24,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 20:28:24,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:28:24,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 20:28:24,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 20:28:24,993 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 482 [2021-10-15 20:28:24,994 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 520 transitions, 2606 flow. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-10-15 20:28:24,994 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:28:24,994 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 482 [2021-10-15 20:28:24,994 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:28:26,579 INFO L129 PetriNetUnfolder]: 320/1484 cut-off events. [2021-10-15 20:28:26,580 INFO L130 PetriNetUnfolder]: For 669/669 co-relation queries the response was YES. [2021-10-15 20:28:26,582 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3758 conditions, 1484 events. 320/1484 cut-off events. For 669/669 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 3540 event pairs, 0 based on Foata normal form. 61/1537 useless extension candidates. Maximal degree in co-relation 1819. Up to 1063 conditions per place. [2021-10-15 20:28:26,594 INFO L132 encePairwiseOnDemand]: 431/482 looper letters, 676 selfloop transitions, 21 changer transitions 0/720 dead transitions. [2021-10-15 20:28:26,595 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 720 transitions, 4480 flow [2021-10-15 20:28:26,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 20:28:26,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 20:28:26,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 641 transitions. [2021-10-15 20:28:26,601 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4432918395573997 [2021-10-15 20:28:26,601 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 641 transitions. [2021-10-15 20:28:26,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 641 transitions. [2021-10-15 20:28:26,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:28:26,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 641 transitions. [2021-10-15 20:28:26,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 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-10-15 20:28:26,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 482.0) internal successors, (1928), 4 states have internal predecessors, (1928), 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-10-15 20:28:26,613 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 482.0) internal successors, (1928), 4 states have internal predecessors, (1928), 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-10-15 20:28:26,614 INFO L186 Difference]: Start difference. First operand has 226 places, 520 transitions, 2606 flow. Second operand 3 states and 641 transitions. [2021-10-15 20:28:26,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 720 transitions, 4480 flow [2021-10-15 20:28:26,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 720 transitions, 4108 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-15 20:28:26,686 INFO L242 Difference]: Finished difference. Result has 227 places, 536 transitions, 2553 flow [2021-10-15 20:28:26,687 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=482, PETRI_DIFFERENCE_MINUEND_FLOW=2240, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2553, PETRI_PLACES=227, PETRI_TRANSITIONS=536} [2021-10-15 20:28:26,687 INFO L334 CegarLoopForPetriNet]: 280 programPoint places, -53 predicate places. [2021-10-15 20:28:26,688 INFO L470 AbstractCegarLoop]: Abstraction has has 227 places, 536 transitions, 2553 flow [2021-10-15 20:28:26,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-10-15 20:28:26,688 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:28:26,689 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 20:28:26,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-15 20:28:26,689 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:28:26,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:28:26,690 INFO L82 PathProgramCache]: Analyzing trace with hash -815332674, now seen corresponding path program 1 times [2021-10-15 20:28:26,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:28:26,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043477171] [2021-10-15 20:28:26,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:28:26,692 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:28:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:28:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 20:28:26,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:28:26,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043477171] [2021-10-15 20:28:26,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043477171] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:28:26,876 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 20:28:26,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 20:28:26,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136972424] [2021-10-15 20:28:26,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 20:28:26,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:28:26,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 20:28:26,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 20:28:26,889 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 482 [2021-10-15 20:28:26,890 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 536 transitions, 2553 flow. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-10-15 20:28:26,890 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:28:26,890 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 482 [2021-10-15 20:28:26,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:28:28,759 INFO L129 PetriNetUnfolder]: 410/2134 cut-off events. [2021-10-15 20:28:28,759 INFO L130 PetriNetUnfolder]: For 764/764 co-relation queries the response was YES. [2021-10-15 20:28:28,762 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5194 conditions, 2134 events. 410/2134 cut-off events. For 764/764 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 5951 event pairs, 0 based on Foata normal form. 98/2224 useless extension candidates. Maximal degree in co-relation 2281. Up to 1441 conditions per place. [2021-10-15 20:28:28,775 INFO L132 encePairwiseOnDemand]: 349/482 looper letters, 659 selfloop transitions, 132 changer transitions 0/813 dead transitions. [2021-10-15 20:28:28,776 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 813 transitions, 5111 flow [2021-10-15 20:28:28,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 20:28:28,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 20:28:28,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2021-10-15 20:28:28,781 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5 [2021-10-15 20:28:28,781 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 723 transitions. [2021-10-15 20:28:28,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 723 transitions. [2021-10-15 20:28:28,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:28:28,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 723 transitions. [2021-10-15 20:28:28,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 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-10-15 20:28:28,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 482.0) internal successors, (1928), 4 states have internal predecessors, (1928), 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-10-15 20:28:28,793 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 482.0) internal successors, (1928), 4 states have internal predecessors, (1928), 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-10-15 20:28:28,794 INFO L186 Difference]: Start difference. First operand has 227 places, 536 transitions, 2553 flow. Second operand 3 states and 723 transitions. [2021-10-15 20:28:28,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 813 transitions, 5111 flow [2021-10-15 20:28:28,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 813 transitions, 5084 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-15 20:28:28,836 INFO L242 Difference]: Finished difference. Result has 230 places, 624 transitions, 3984 flow [2021-10-15 20:28:28,838 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=482, PETRI_DIFFERENCE_MINUEND_FLOW=2532, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3984, PETRI_PLACES=230, PETRI_TRANSITIONS=624} [2021-10-15 20:28:28,838 INFO L334 CegarLoopForPetriNet]: 280 programPoint places, -50 predicate places. [2021-10-15 20:28:28,838 INFO L470 AbstractCegarLoop]: Abstraction has has 230 places, 624 transitions, 3984 flow [2021-10-15 20:28:28,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-10-15 20:28:28,839 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:28:28,840 INFO L254 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 20:28:28,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-15 20:28:28,841 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:28:28,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:28:28,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1622931631, now seen corresponding path program 1 times [2021-10-15 20:28:28,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:28:28,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710049645] [2021-10-15 20:28:28,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:28:28,843 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:28:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:28:29,064 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-10-15 20:28:29,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:28:29,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710049645] [2021-10-15 20:28:29,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710049645] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:28:29,072 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 20:28:29,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 20:28:29,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797228496] [2021-10-15 20:28:29,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 20:28:29,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:28:29,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 20:28:29,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 20:28:29,080 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 482 [2021-10-15 20:28:29,080 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 624 transitions, 3984 flow. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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-10-15 20:28:29,081 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:28:29,081 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 482 [2021-10-15 20:28:29,081 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:28:31,519 INFO L129 PetriNetUnfolder]: 498/2780 cut-off events. [2021-10-15 20:28:31,520 INFO L130 PetriNetUnfolder]: For 2460/2460 co-relation queries the response was YES. [2021-10-15 20:28:31,524 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7215 conditions, 2780 events. 498/2780 cut-off events. For 2460/2460 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 9630 event pairs, 0 based on Foata normal form. 98/2869 useless extension candidates. Maximal degree in co-relation 3238. Up to 2086 conditions per place. [2021-10-15 20:28:31,542 INFO L132 encePairwiseOnDemand]: 354/482 looper letters, 742 selfloop transitions, 133 changer transitions 0/897 dead transitions. [2021-10-15 20:28:31,542 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 897 transitions, 6900 flow [2021-10-15 20:28:31,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 20:28:31,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 20:28:31,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2021-10-15 20:28:31,547 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4972337482710927 [2021-10-15 20:28:31,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 719 transitions. [2021-10-15 20:28:31,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 719 transitions. [2021-10-15 20:28:31,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:28:31,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 719 transitions. [2021-10-15 20:28:31,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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-10-15 20:28:31,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 482.0) internal successors, (1928), 4 states have internal predecessors, (1928), 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-10-15 20:28:31,559 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 482.0) internal successors, (1928), 4 states have internal predecessors, (1928), 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-10-15 20:28:31,559 INFO L186 Difference]: Start difference. First operand has 230 places, 624 transitions, 3984 flow. Second operand 3 states and 719 transitions. [2021-10-15 20:28:31,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 897 transitions, 6900 flow [2021-10-15 20:28:31,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 897 transitions, 6502 flow, removed 46 selfloop flow, removed 2 redundant places. [2021-10-15 20:28:31,630 INFO L242 Difference]: Finished difference. Result has 232 places, 710 transitions, 5244 flow [2021-10-15 20:28:31,632 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=482, PETRI_DIFFERENCE_MINUEND_FLOW=3628, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=624, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=5244, PETRI_PLACES=232, PETRI_TRANSITIONS=710} [2021-10-15 20:28:31,632 INFO L334 CegarLoopForPetriNet]: 280 programPoint places, -48 predicate places. [2021-10-15 20:28:31,632 INFO L470 AbstractCegarLoop]: Abstraction has has 232 places, 710 transitions, 5244 flow [2021-10-15 20:28:31,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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-10-15 20:28:31,633 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:28:31,634 INFO L254 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 20:28:31,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-15 20:28:31,635 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:28:31,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:28:31,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1330539034, now seen corresponding path program 1 times [2021-10-15 20:28:31,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:28:31,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965632869] [2021-10-15 20:28:31,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:28:31,637 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:28:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:28:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 20:28:31,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:28:31,833 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965632869] [2021-10-15 20:28:31,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965632869] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:28:31,833 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 20:28:31,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 20:28:31,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723339955] [2021-10-15 20:28:31,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 20:28:31,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:28:31,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 20:28:31,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 20:28:31,837 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 482 [2021-10-15 20:28:31,838 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 710 transitions, 5244 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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-10-15 20:28:31,838 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:28:31,838 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 482 [2021-10-15 20:28:31,839 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:28:35,363 INFO L129 PetriNetUnfolder]: 722/4304 cut-off events. [2021-10-15 20:28:35,364 INFO L130 PetriNetUnfolder]: For 4791/4791 co-relation queries the response was YES. [2021-10-15 20:28:35,369 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11268 conditions, 4304 events. 722/4304 cut-off events. For 4791/4791 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 20730 event pairs, 0 based on Foata normal form. 96/4394 useless extension candidates. Maximal degree in co-relation 7938. Up to 2214 conditions per place. [2021-10-15 20:28:35,394 INFO L132 encePairwiseOnDemand]: 361/482 looper letters, 787 selfloop transitions, 285 changer transitions 0/1107 dead transitions. [2021-10-15 20:28:35,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 1107 transitions, 9744 flow [2021-10-15 20:28:35,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 20:28:35,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 20:28:35,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2021-10-15 20:28:35,400 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.49930843706777317 [2021-10-15 20:28:35,401 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 722 transitions. [2021-10-15 20:28:35,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 722 transitions. [2021-10-15 20:28:35,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:28:35,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 722 transitions. [2021-10-15 20:28:35,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 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-10-15 20:28:35,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 482.0) internal successors, (1928), 4 states have internal predecessors, (1928), 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-10-15 20:28:35,412 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 482.0) internal successors, (1928), 4 states have internal predecessors, (1928), 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-10-15 20:28:35,413 INFO L186 Difference]: Start difference. First operand has 232 places, 710 transitions, 5244 flow. Second operand 3 states and 722 transitions. [2021-10-15 20:28:35,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 1107 transitions, 9744 flow [2021-10-15 20:28:35,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 1107 transitions, 9236 flow, removed 64 selfloop flow, removed 2 redundant places. [2021-10-15 20:28:35,535 INFO L242 Difference]: Finished difference. Result has 234 places, 903 transitions, 8222 flow [2021-10-15 20:28:35,536 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=482, PETRI_DIFFERENCE_MINUEND_FLOW=4882, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=8222, PETRI_PLACES=234, PETRI_TRANSITIONS=903} [2021-10-15 20:28:35,537 INFO L334 CegarLoopForPetriNet]: 280 programPoint places, -46 predicate places. [2021-10-15 20:28:35,537 INFO L470 AbstractCegarLoop]: Abstraction has has 234 places, 903 transitions, 8222 flow [2021-10-15 20:28:35,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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-10-15 20:28:35,540 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:28:35,540 INFO L254 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 20:28:35,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-15 20:28:35,541 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:28:35,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:28:35,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1430201629, now seen corresponding path program 1 times [2021-10-15 20:28:35,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:28:35,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767792243] [2021-10-15 20:28:35,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:28:35,543 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:28:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:28:35,758 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2021-10-15 20:28:35,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:28:35,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767792243] [2021-10-15 20:28:35,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767792243] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:28:35,760 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 20:28:35,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 20:28:35,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756283287] [2021-10-15 20:28:35,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 20:28:35,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:28:35,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 20:28:35,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 20:28:35,768 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 482 [2021-10-15 20:28:35,768 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 903 transitions, 8222 flow. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 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-10-15 20:28:35,768 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:28:35,769 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 482 [2021-10-15 20:28:35,769 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:28:40,291 INFO L129 PetriNetUnfolder]: 952/6204 cut-off events. [2021-10-15 20:28:40,292 INFO L130 PetriNetUnfolder]: For 9188/9188 co-relation queries the response was YES. [2021-10-15 20:28:40,300 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16945 conditions, 6204 events. 952/6204 cut-off events. For 9188/9188 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 34906 event pairs, 0 based on Foata normal form. 4/6208 useless extension candidates. Maximal degree in co-relation 9209. Up to 3833 conditions per place. [2021-10-15 20:28:40,329 INFO L132 encePairwiseOnDemand]: 442/482 looper letters, 1114 selfloop transitions, 150 changer transitions 0/1303 dead transitions. [2021-10-15 20:28:40,329 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 1303 transitions, 13994 flow [2021-10-15 20:28:40,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 20:28:40,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 20:28:40,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 659 transitions. [2021-10-15 20:28:40,334 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4557399723374827 [2021-10-15 20:28:40,334 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 659 transitions. [2021-10-15 20:28:40,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 659 transitions. [2021-10-15 20:28:40,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:28:40,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 659 transitions. [2021-10-15 20:28:40,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 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-10-15 20:28:40,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 482.0) internal successors, (1928), 4 states have internal predecessors, (1928), 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-10-15 20:28:40,353 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 482.0) internal successors, (1928), 4 states have internal predecessors, (1928), 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-10-15 20:28:40,353 INFO L186 Difference]: Start difference. First operand has 234 places, 903 transitions, 8222 flow. Second operand 3 states and 659 transitions. [2021-10-15 20:28:40,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 1303 transitions, 13994 flow [2021-10-15 20:28:40,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 1303 transitions, 13232 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-15 20:28:40,493 INFO L242 Difference]: Finished difference. Result has 235 places, 982 transitions, 9254 flow [2021-10-15 20:28:40,494 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=482, PETRI_DIFFERENCE_MINUEND_FLOW=7652, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=903, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=753, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=9254, PETRI_PLACES=235, PETRI_TRANSITIONS=982} [2021-10-15 20:28:40,494 INFO L334 CegarLoopForPetriNet]: 280 programPoint places, -45 predicate places. [2021-10-15 20:28:40,494 INFO L470 AbstractCegarLoop]: Abstraction has has 235 places, 982 transitions, 9254 flow [2021-10-15 20:28:40,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 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-10-15 20:28:40,495 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:28:40,495 INFO L254 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 20:28:40,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-15 20:28:40,496 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:28:40,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:28:40,497 INFO L82 PathProgramCache]: Analyzing trace with hash -441499856, now seen corresponding path program 1 times [2021-10-15 20:28:40,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:28:40,497 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491230875] [2021-10-15 20:28:40,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:28:40,498 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:28:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:28:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-10-15 20:28:40,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:28:40,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491230875] [2021-10-15 20:28:40,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491230875] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-15 20:28:40,831 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304150510] [2021-10-15 20:28:40,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:28:40,831 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-15 20:28:40,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3/z3 [2021-10-15 20:28:40,840 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-15 20:28:40,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-15 20:28:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:28:40,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-15 20:28:41,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-15 20:28:42,179 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-10-15 20:28:42,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304150510] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:28:42,180 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-15 20:28:42,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2021-10-15 20:28:42,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750542696] [2021-10-15 20:28:42,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-15 20:28:42,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:28:42,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-15 20:28:42,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-15 20:28:42,196 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 482 [2021-10-15 20:28:42,196 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 982 transitions, 9254 flow. Second operand has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 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-10-15 20:28:42,196 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:28:42,197 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 482 [2021-10-15 20:28:42,197 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:28:50,599 INFO L129 PetriNetUnfolder]: 1582/10919 cut-off events. [2021-10-15 20:28:50,599 INFO L130 PetriNetUnfolder]: For 16829/16829 co-relation queries the response was YES. [2021-10-15 20:28:50,611 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29754 conditions, 10919 events. 1582/10919 cut-off events. For 16829/16829 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 74619 event pairs, 0 based on Foata normal form. 8/10927 useless extension candidates. Maximal degree in co-relation 18669. Up to 3828 conditions per place. [2021-10-15 20:28:50,652 INFO L132 encePairwiseOnDemand]: 434/482 looper letters, 1382 selfloop transitions, 408 changer transitions 0/1829 dead transitions. [2021-10-15 20:28:50,652 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 1829 transitions, 20014 flow [2021-10-15 20:28:50,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-15 20:28:50,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-10-15 20:28:50,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 926 transitions. [2021-10-15 20:28:50,661 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4802904564315353 [2021-10-15 20:28:50,661 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 926 transitions. [2021-10-15 20:28:50,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 926 transitions. [2021-10-15 20:28:50,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:28:50,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 926 transitions. [2021-10-15 20:28:50,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 231.5) internal successors, (926), 4 states have internal predecessors, (926), 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-10-15 20:28:50,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 482.0) internal successors, (2410), 5 states have internal predecessors, (2410), 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-10-15 20:28:50,675 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 482.0) internal successors, (2410), 5 states have internal predecessors, (2410), 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-10-15 20:28:50,676 INFO L186 Difference]: Start difference. First operand has 235 places, 982 transitions, 9254 flow. Second operand 4 states and 926 transitions. [2021-10-15 20:28:50,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 1829 transitions, 20014 flow [2021-10-15 20:28:50,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 1829 transitions, 19788 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-15 20:28:50,912 INFO L242 Difference]: Finished difference. Result has 239 places, 1220 transitions, 13930 flow [2021-10-15 20:28:50,914 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=482, PETRI_DIFFERENCE_MINUEND_FLOW=9104, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=982, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=242, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=13930, PETRI_PLACES=239, PETRI_TRANSITIONS=1220} [2021-10-15 20:28:50,914 INFO L334 CegarLoopForPetriNet]: 280 programPoint places, -41 predicate places. [2021-10-15 20:28:50,914 INFO L470 AbstractCegarLoop]: Abstraction has has 239 places, 1220 transitions, 13930 flow [2021-10-15 20:28:50,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 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-10-15 20:28:50,915 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:28:50,916 INFO L254 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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-10-15 20:28:50,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-15 20:28:51,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-15 20:28:51,132 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:28:51,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:28:51,132 INFO L82 PathProgramCache]: Analyzing trace with hash 2101129075, now seen corresponding path program 1 times [2021-10-15 20:28:51,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:28:51,133 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437497130] [2021-10-15 20:28:51,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:28:51,133 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:28:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:28:51,405 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 20:28:51,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:28:51,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437497130] [2021-10-15 20:28:51,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437497130] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:28:51,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 20:28:51,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-15 20:28:51,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457486980] [2021-10-15 20:28:51,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-15 20:28:51,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:28:51,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-15 20:28:51,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-15 20:28:51,411 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 482 [2021-10-15 20:28:51,412 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 1220 transitions, 13930 flow. Second operand has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 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-10-15 20:28:51,412 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:28:51,412 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 482 [2021-10-15 20:28:51,413 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:29:09,452 INFO L129 PetriNetUnfolder]: 2988/22666 cut-off events. [2021-10-15 20:29:09,452 INFO L130 PetriNetUnfolder]: For 48417/48417 co-relation queries the response was YES. [2021-10-15 20:29:09,480 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61646 conditions, 22666 events. 2988/22666 cut-off events. For 48417/48417 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 193346 event pairs, 0 based on Foata normal form. 770/23431 useless extension candidates. Maximal degree in co-relation 41593. Up to 9425 conditions per place. [2021-10-15 20:29:09,594 INFO L132 encePairwiseOnDemand]: 335/482 looper letters, 1436 selfloop transitions, 1314 changer transitions 0/2785 dead transitions. [2021-10-15 20:29:09,595 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 2785 transitions, 33821 flow [2021-10-15 20:29:09,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-15 20:29:09,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-10-15 20:29:09,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1383 transitions. [2021-10-15 20:29:09,603 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5738589211618257 [2021-10-15 20:29:09,603 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1383 transitions. [2021-10-15 20:29:09,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1383 transitions. [2021-10-15 20:29:09,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:29:09,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1383 transitions. [2021-10-15 20:29:09,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 276.6) internal successors, (1383), 5 states have internal predecessors, (1383), 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-10-15 20:29:09,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 482.0) internal successors, (2892), 6 states have internal predecessors, (2892), 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-10-15 20:29:09,619 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 482.0) internal successors, (2892), 6 states have internal predecessors, (2892), 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-10-15 20:29:09,619 INFO L186 Difference]: Start difference. First operand has 239 places, 1220 transitions, 13930 flow. Second operand 5 states and 1383 transitions. [2021-10-15 20:29:09,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 2785 transitions, 33821 flow [2021-10-15 20:29:10,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 2785 transitions, 33555 flow, removed 133 selfloop flow, removed 0 redundant places. [2021-10-15 20:29:10,091 INFO L242 Difference]: Finished difference. Result has 247 places, 2128 transitions, 32416 flow [2021-10-15 20:29:10,093 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=482, PETRI_DIFFERENCE_MINUEND_FLOW=13581, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=497, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=32416, PETRI_PLACES=247, PETRI_TRANSITIONS=2128} [2021-10-15 20:29:10,093 INFO L334 CegarLoopForPetriNet]: 280 programPoint places, -33 predicate places. [2021-10-15 20:29:10,093 INFO L470 AbstractCegarLoop]: Abstraction has has 247 places, 2128 transitions, 32416 flow [2021-10-15 20:29:10,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 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-10-15 20:29:10,094 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:29:10,095 INFO L254 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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-10-15 20:29:10,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-15 20:29:10,096 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:29:10,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:29:10,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1022321550, now seen corresponding path program 1 times [2021-10-15 20:29:10,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:29:10,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020400477] [2021-10-15 20:29:10,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:29:10,098 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:29:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:29:10,250 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-10-15 20:29:10,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:29:10,254 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020400477] [2021-10-15 20:29:10,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020400477] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:29:10,255 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 20:29:10,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 20:29:10,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311172248] [2021-10-15 20:29:10,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 20:29:10,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:29:10,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 20:29:10,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-15 20:29:10,262 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 482 [2021-10-15 20:29:10,262 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 2128 transitions, 32416 flow. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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-10-15 20:29:10,262 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:29:10,262 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 482 [2021-10-15 20:29:10,263 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:29:38,539 INFO L129 PetriNetUnfolder]: 2654/22330 cut-off events. [2021-10-15 20:29:38,540 INFO L130 PetriNetUnfolder]: For 67805/67805 co-relation queries the response was YES. [2021-10-15 20:29:38,578 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64206 conditions, 22330 events. 2654/22330 cut-off events. For 67805/67805 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 193284 event pairs, 0 based on Foata normal form. 334/22661 useless extension candidates. Maximal degree in co-relation 42676. Up to 18222 conditions per place. [2021-10-15 20:29:38,647 INFO L132 encePairwiseOnDemand]: 370/482 looper letters, 1339 selfloop transitions, 612 changer transitions 0/2010 dead transitions. [2021-10-15 20:29:38,647 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 2010 transitions, 32676 flow [2021-10-15 20:29:38,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 20:29:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 20:29:38,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 657 transitions. [2021-10-15 20:29:38,652 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.45435684647302904 [2021-10-15 20:29:38,652 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 657 transitions. [2021-10-15 20:29:38,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 657 transitions. [2021-10-15 20:29:38,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:29:38,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 657 transitions. [2021-10-15 20:29:38,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 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-10-15 20:29:38,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 482.0) internal successors, (1928), 4 states have internal predecessors, (1928), 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-10-15 20:29:38,661 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 482.0) internal successors, (1928), 4 states have internal predecessors, (1928), 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-10-15 20:29:38,661 INFO L186 Difference]: Start difference. First operand has 247 places, 2128 transitions, 32416 flow. Second operand 3 states and 657 transitions. [2021-10-15 20:29:38,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 2010 transitions, 32676 flow [2021-10-15 20:29:38,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 2010 transitions, 32676 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-10-15 20:29:39,030 INFO L242 Difference]: Finished difference. Result has 249 places, 1829 transitions, 29636 flow [2021-10-15 20:29:39,033 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=482, PETRI_DIFFERENCE_MINUEND_FLOW=28412, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1829, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=612, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=29636, PETRI_PLACES=249, PETRI_TRANSITIONS=1829} [2021-10-15 20:29:39,033 INFO L334 CegarLoopForPetriNet]: 280 programPoint places, -31 predicate places. [2021-10-15 20:29:39,034 INFO L470 AbstractCegarLoop]: Abstraction has has 249 places, 1829 transitions, 29636 flow [2021-10-15 20:29:39,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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-10-15 20:29:39,034 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:29:39,035 INFO L254 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 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-10-15 20:29:39,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-15 20:29:39,035 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:29:39,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:29:39,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1859129399, now seen corresponding path program 1 times [2021-10-15 20:29:39,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:29:39,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30558935] [2021-10-15 20:29:39,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:29:39,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:29:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:29:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 19 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 20:29:39,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:29:39,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30558935] [2021-10-15 20:29:39,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30558935] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-15 20:29:39,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518477775] [2021-10-15 20:29:39,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:29:39,239 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-15 20:29:39,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3/z3 [2021-10-15 20:29:39,241 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-15 20:29:39,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-15 20:29:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:29:39,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-15 20:29:39,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-15 20:29:40,981 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 20:29:40,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518477775] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:29:40,982 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-15 20:29:40,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-10-15 20:29:40,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861780020] [2021-10-15 20:29:40,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-15 20:29:40,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:29:40,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-15 20:29:40,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-15 20:29:40,986 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 482 [2021-10-15 20:29:40,987 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 1829 transitions, 29636 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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-10-15 20:29:40,987 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:29:40,987 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 482 [2021-10-15 20:29:40,988 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:30:08,052 INFO L129 PetriNetUnfolder]: 2750/23175 cut-off events. [2021-10-15 20:30:08,052 INFO L130 PetriNetUnfolder]: For 70390/70390 co-relation queries the response was YES. [2021-10-15 20:30:08,094 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67197 conditions, 23175 events. 2750/23175 cut-off events. For 70390/70390 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 204075 event pairs, 0 based on Foata normal form. 30/23202 useless extension candidates. Maximal degree in co-relation 45454. Up to 21680 conditions per place. [2021-10-15 20:30:08,158 INFO L132 encePairwiseOnDemand]: 440/482 looper letters, 1831 selfloop transitions, 249 changer transitions 0/2102 dead transitions. [2021-10-15 20:30:08,159 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 2102 transitions, 35527 flow [2021-10-15 20:30:08,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-15 20:30:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-15 20:30:08,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 632 transitions. [2021-10-15 20:30:08,163 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.43706777316735823 [2021-10-15 20:30:08,163 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 632 transitions. [2021-10-15 20:30:08,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 632 transitions. [2021-10-15 20:30:08,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:30:08,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 632 transitions. [2021-10-15 20:30:08,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 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-10-15 20:30:08,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 482.0) internal successors, (1928), 4 states have internal predecessors, (1928), 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-10-15 20:30:08,172 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 482.0) internal successors, (1928), 4 states have internal predecessors, (1928), 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-10-15 20:30:08,173 INFO L186 Difference]: Start difference. First operand has 249 places, 1829 transitions, 29636 flow. Second operand 3 states and 632 transitions. [2021-10-15 20:30:08,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 2102 transitions, 35527 flow [2021-10-15 20:30:08,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 2102 transitions, 34860 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-15 20:30:08,602 INFO L242 Difference]: Finished difference. Result has 251 places, 1899 transitions, 31061 flow [2021-10-15 20:30:08,605 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=482, PETRI_DIFFERENCE_MINUEND_FLOW=28940, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1823, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=31061, PETRI_PLACES=251, PETRI_TRANSITIONS=1899} [2021-10-15 20:30:08,605 INFO L334 CegarLoopForPetriNet]: 280 programPoint places, -29 predicate places. [2021-10-15 20:30:08,605 INFO L470 AbstractCegarLoop]: Abstraction has has 251 places, 1899 transitions, 31061 flow [2021-10-15 20:30:08,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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-10-15 20:30:08,606 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:30:08,607 INFO L254 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 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-10-15 20:30:08,640 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-10-15 20:30:08,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-10-15 20:30:08,828 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:30:08,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:30:08,829 INFO L82 PathProgramCache]: Analyzing trace with hash 835820326, now seen corresponding path program 1 times [2021-10-15 20:30:08,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:30:08,829 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800864743] [2021-10-15 20:30:08,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:30:08,830 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:30:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-15 20:30:09,047 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-15 20:30:09,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-15 20:30:09,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800864743] [2021-10-15 20:30:09,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800864743] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-15 20:30:09,048 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-15 20:30:09,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-15 20:30:09,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166263263] [2021-10-15 20:30:09,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-15 20:30:09,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-15 20:30:09,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-15 20:30:09,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-15 20:30:09,053 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 482 [2021-10-15 20:30:09,054 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 1899 transitions, 31061 flow. Second operand has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 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-10-15 20:30:09,054 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-15 20:30:09,054 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 482 [2021-10-15 20:30:09,055 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-15 20:30:33,714 INFO L129 PetriNetUnfolder]: 2910/25366 cut-off events. [2021-10-15 20:30:33,714 INFO L130 PetriNetUnfolder]: For 79451/79451 co-relation queries the response was YES. [2021-10-15 20:30:33,753 INFO L84 FinitePrefix]: Finished finitePrefix Result has 72622 conditions, 25366 events. 2910/25366 cut-off events. For 79451/79451 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 227925 event pairs, 0 based on Foata normal form. 144/25507 useless extension candidates. Maximal degree in co-relation 47922. Up to 9835 conditions per place. [2021-10-15 20:30:33,800 INFO L132 encePairwiseOnDemand]: 347/482 looper letters, 1204 selfloop transitions, 1188 changer transitions 0/2429 dead transitions. [2021-10-15 20:30:33,801 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 2429 transitions, 39193 flow [2021-10-15 20:30:33,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-15 20:30:33,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-10-15 20:30:33,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1025 transitions. [2021-10-15 20:30:33,805 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5316390041493776 [2021-10-15 20:30:33,805 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1025 transitions. [2021-10-15 20:30:33,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1025 transitions. [2021-10-15 20:30:33,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-15 20:30:33,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1025 transitions. [2021-10-15 20:30:33,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 256.25) internal successors, (1025), 4 states have internal predecessors, (1025), 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-10-15 20:30:33,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 482.0) internal successors, (2410), 5 states have internal predecessors, (2410), 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-10-15 20:30:33,814 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 482.0) internal successors, (2410), 5 states have internal predecessors, (2410), 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-10-15 20:30:33,815 INFO L186 Difference]: Start difference. First operand has 251 places, 1899 transitions, 31061 flow. Second operand 4 states and 1025 transitions. [2021-10-15 20:30:33,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 2429 transitions, 39193 flow [2021-10-15 20:30:34,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 2429 transitions, 38925 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-15 20:30:34,247 INFO L242 Difference]: Finished difference. Result has 255 places, 1999 transitions, 36765 flow [2021-10-15 20:30:34,249 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=482, PETRI_DIFFERENCE_MINUEND_FLOW=30812, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1899, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1088, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=734, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=36765, PETRI_PLACES=255, PETRI_TRANSITIONS=1999} [2021-10-15 20:30:34,249 INFO L334 CegarLoopForPetriNet]: 280 programPoint places, -25 predicate places. [2021-10-15 20:30:34,249 INFO L470 AbstractCegarLoop]: Abstraction has has 255 places, 1999 transitions, 36765 flow [2021-10-15 20:30:34,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 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-10-15 20:30:34,250 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-15 20:30:34,250 INFO L254 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-15 20:30:34,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-15 20:30:34,251 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-15 20:30:34,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-15 20:30:34,251 INFO L82 PathProgramCache]: Analyzing trace with hash -26858473, now seen corresponding path program 1 times [2021-10-15 20:30:34,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-15 20:30:34,251 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335206876] [2021-10-15 20:30:34,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-15 20:30:34,252 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-15 20:30:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-15 20:30:34,377 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-15 20:30:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-15 20:30:34,528 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-15 20:30:34,529 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-15 20:30:34,530 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-15 20:30:34,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-15 20:30:34,540 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-15 20:30:34,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 08:30:34 BoogieIcfgContainer [2021-10-15 20:30:34,739 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-15 20:30:34,739 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-15 20:30:34,739 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-15 20:30:34,739 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-15 20:30:34,740 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 08:28:20" (3/4) ... [2021-10-15 20:30:34,741 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-15 20:30:34,940 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3/witness.graphml [2021-10-15 20:30:34,940 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-15 20:30:34,942 INFO L168 Benchmark]: Toolchain (without parser) took 138325.95 ms. Allocated memory was 92.3 MB in the beginning and 4.4 GB in the end (delta: 4.3 GB). Free memory was 54.4 MB in the beginning and 3.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 1.4 GB. Max. memory is 16.1 GB. [2021-10-15 20:30:34,942 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 92.3 MB. Free memory was 63.5 MB in the beginning and 63.5 MB in the end (delta: 29.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-15 20:30:34,943 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1158.14 ms. Allocated memory was 92.3 MB in the beginning and 125.8 MB in the end (delta: 33.6 MB). Free memory was 54.2 MB in the beginning and 67.8 MB in the end (delta: -13.6 MB). Peak memory consumption was 21.1 MB. Max. memory is 16.1 GB. [2021-10-15 20:30:34,943 INFO L168 Benchmark]: Boogie Procedure Inliner took 181.88 ms. Allocated memory is still 125.8 MB. Free memory was 67.8 MB in the beginning and 51.0 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-15 20:30:34,944 INFO L168 Benchmark]: Boogie Preprocessor took 197.78 ms. Allocated memory is still 125.8 MB. Free memory was 51.0 MB in the beginning and 85.4 MB in the end (delta: -34.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 16.1 GB. [2021-10-15 20:30:34,944 INFO L168 Benchmark]: RCFGBuilder took 2191.09 ms. Allocated memory was 125.8 MB in the beginning and 192.9 MB in the end (delta: 67.1 MB). Free memory was 85.4 MB in the beginning and 126.6 MB in the end (delta: -41.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 16.1 GB. [2021-10-15 20:30:34,945 INFO L168 Benchmark]: TraceAbstraction took 134384.63 ms. Allocated memory was 192.9 MB in the beginning and 4.4 GB in the end (delta: 4.2 GB). Free memory was 126.6 MB in the beginning and 3.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 1.3 GB. Max. memory is 16.1 GB. [2021-10-15 20:30:34,945 INFO L168 Benchmark]: Witness Printer took 201.30 ms. Allocated memory is still 4.4 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 35.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB. [2021-10-15 20:30:34,947 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 92.3 MB. Free memory was 63.5 MB in the beginning and 63.5 MB in the end (delta: 29.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1158.14 ms. Allocated memory was 92.3 MB in the beginning and 125.8 MB in the end (delta: 33.6 MB). Free memory was 54.2 MB in the beginning and 67.8 MB in the end (delta: -13.6 MB). Peak memory consumption was 21.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 181.88 ms. Allocated memory is still 125.8 MB. Free memory was 67.8 MB in the beginning and 51.0 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 197.78 ms. Allocated memory is still 125.8 MB. Free memory was 51.0 MB in the beginning and 85.4 MB in the end (delta: -34.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2191.09 ms. Allocated memory was 125.8 MB in the beginning and 192.9 MB in the end (delta: 67.1 MB). Free memory was 85.4 MB in the beginning and 126.6 MB in the end (delta: -41.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 134384.63 ms. Allocated memory was 192.9 MB in the beginning and 4.4 GB in the end (delta: 4.2 GB). Free memory was 126.6 MB in the beginning and 3.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 1.3 GB. Max. memory is 16.1 GB. * Witness Printer took 201.30 ms. Allocated memory is still 4.4 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 35.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 52]: 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] [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)) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) 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] [L36] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) 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] [L39] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) 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] [L42] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) 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] [L45] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) 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] [L48] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) 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] [L51] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) 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] [L54] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) 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] [L57] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) 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] [L60] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) 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] [L63] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) 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] [L66] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) 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] [L69] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) 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] [L72] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) 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] [L75] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) 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] [L78] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) 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] [L81] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) 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] [L84] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) 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] [L87] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) 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] [L90] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) 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] [L93] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) 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] [L96] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) 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] [L99] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) 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] [L102] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) 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] [L105] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) 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] [L108] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) 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] [L111] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) 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] [L114] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) 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] [L117] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) 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] [L120] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) 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] [L123] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) 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] [L126] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) 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] [L129] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) 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] [L132] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) 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] [L135] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) 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] [L138] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) 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] [L141] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) 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] [L144] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) 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] [L147] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) 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] [L150] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) 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] [L153] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) 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] [L156] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) 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] [L159] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) 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] [L162] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) 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] [L165] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) 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] [L168] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) 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] [L171] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) 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] [L174] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) 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] [L177] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) 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] [L180] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) 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] [L183] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) 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] [L186] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) 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] [L189] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) 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] [L192] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) 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] [L195] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) 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] [L198] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) 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] [L201] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) 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] [L204] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) 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] [L207] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) 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] [L210] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) 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] [L213] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) 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] [L217] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==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] [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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L536] COND TRUE ((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15))) [L537] a29 = (((((a29 % 52)- -193) * 5) % 52)- -169) [L538] a25 = 12 [L540] return 26; VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [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)) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, 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 [a23=312, a25=12, a29=172, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L625] COND TRUE ((((((a3==1) && ((input == 5) && ((a25==11) || (a25==12)))) && (a4==1)) && 306 < a23 ) && ((140 < a29) && (245 >= a29)) ) && (a8==15)) [L626] a29 = (((a29 + -194923) / 5) / 5) [L627] a23 = ((((a23 % 83)- -169) + 501114) - 501118) [L628] a25 = 13 [L630] return -1; VAL [a23=228, a25=13, a29=-7790, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [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)) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=228, a25=13, a29=-7790, a3=1, a4=1, a8=15, 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 [a23=228, a25=13, a29=-7790, a3=1, a4=1, a8=15, 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 [a23=228, a25=13, a29=-7790, a3=1, a4=1, a8=15, 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 [a23=228, a25=13, a29=-7790, a3=1, a4=1, a8=15, 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 [a23=228, a25=13, a29=-7790, a3=1, a4=1, a8=15, 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 [a23=228, a25=13, a29=-7790, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND TRUE ((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15)) VAL [a23=228, a25=13, a29=-7790, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] reach_error() VAL [a23=228, a25=13, a29=-7790, a3=1, a4=1, a8=15, 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. EmptinessCheckTime: 4.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 134115.1ms, OverallIterations: 13, TraceHistogramMax: 3, EmptinessCheckTime: 0.0ms, AutomataDifference: 127111.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 229.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2145 SDtfs, 2305 SDslu, 0 SDs, 0 SdLazy, 8593 SolverSat, 1372 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12347.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 508 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 65.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=36765occurred in iteration=12, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 262.0ms SsaConstructionTime, 969.6ms SatisfiabilityAnalysisTime, 4413.9ms InterpolantComputationTime, 2859 NumberOfCodeBlocks, 2859 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2595 ConstructedInterpolants, 0 QuantifiedInterpolants, 6651 SizeOfPredicates, 0 NumberOfNonLiveVariables, 727 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 1069/1193 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-10-15 20:30:34,978 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4adc4d46-1635-46f2-ad7b-27f20eacddeb/bin/uautomizer-hJ6jxDFKc3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...