./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label39.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8934cab6-c4c9-48cb-a622-9f8870db1498/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8934cab6-c4c9-48cb-a622-9f8870db1498/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8934cab6-c4c9-48cb-a622-9f8870db1498/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8934cab6-c4c9-48cb-a622-9f8870db1498/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label39.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8934cab6-c4c9-48cb-a622-9f8870db1498/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8934cab6-c4c9-48cb-a622-9f8870db1498/bin/uautomizer-QkZJyEgLgS --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 0228d1b7f2a33ef725fbf35c42c49b2757875a719edcc71c3b2f152eb58a8ad1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 03:12:00,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:12:00,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:12:00,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:12:00,049 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:12:00,050 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:12:00,052 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:12:00,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:12:00,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:12:00,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:12:00,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:12:00,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:12:00,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:12:00,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:12:00,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:12:00,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:12:00,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:12:00,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:12:00,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:12:00,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:12:00,094 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:12:00,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:12:00,101 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:12:00,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:12:00,112 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:12:00,112 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:12:00,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:12:00,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:12:00,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:12:00,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:12:00,116 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:12:00,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:12:00,117 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:12:00,118 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:12:00,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:12:00,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:12:00,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:12:00,121 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:12:00,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:12:00,126 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:12:00,128 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:12:00,129 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8934cab6-c4c9-48cb-a622-9f8870db1498/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 03:12:00,175 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:12:00,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:12:00,176 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:12:00,176 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:12:00,177 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:12:00,177 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:12:00,178 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:12:00,178 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:12:00,178 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:12:00,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:12:00,180 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:12:00,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:12:00,180 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:12:00,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:12:00,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 03:12:00,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:12:00,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 03:12:00,181 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:12:00,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 03:12:00,182 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:12:00,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 03:12:00,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:12:00,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:12:00,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:12:00,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:12:00,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:12:00,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:12:00,183 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 03:12:00,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 03:12:00,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 03:12:00,184 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:12:00,185 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 03:12:00,185 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:12:00,185 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:12:00,185 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_8934cab6-c4c9-48cb-a622-9f8870db1498/bin/uautomizer-QkZJyEgLgS/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_8934cab6-c4c9-48cb-a622-9f8870db1498/bin/uautomizer-QkZJyEgLgS 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 -> 0228d1b7f2a33ef725fbf35c42c49b2757875a719edcc71c3b2f152eb58a8ad1 [2022-11-23 03:12:00,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:12:00,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:12:00,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:12:00,516 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:12:00,516 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:12:00,518 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8934cab6-c4c9-48cb-a622-9f8870db1498/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/eca-rers2012/Problem11_label39.c [2022-11-23 03:12:04,090 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:12:04,520 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:12:04,520 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8934cab6-c4c9-48cb-a622-9f8870db1498/sv-benchmarks/c/eca-rers2012/Problem11_label39.c [2022-11-23 03:12:04,537 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8934cab6-c4c9-48cb-a622-9f8870db1498/bin/uautomizer-QkZJyEgLgS/data/3c4445ee8/b6ba8cae2b5a4597b1df41344e010f63/FLAG03393316e [2022-11-23 03:12:04,558 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8934cab6-c4c9-48cb-a622-9f8870db1498/bin/uautomizer-QkZJyEgLgS/data/3c4445ee8/b6ba8cae2b5a4597b1df41344e010f63 [2022-11-23 03:12:04,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:12:04,563 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:12:04,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:12:04,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:12:04,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:12:04,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:12:04" (1/1) ... [2022-11-23 03:12:04,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3111bb30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:04, skipping insertion in model container [2022-11-23 03:12:04,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:12:04" (1/1) ... [2022-11-23 03:12:04,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:12:04,689 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:12:04,921 WARN L237 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_8934cab6-c4c9-48cb-a622-9f8870db1498/sv-benchmarks/c/eca-rers2012/Problem11_label39.c[1593,1606] [2022-11-23 03:12:05,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:12:05,349 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:12:05,379 WARN L237 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_8934cab6-c4c9-48cb-a622-9f8870db1498/sv-benchmarks/c/eca-rers2012/Problem11_label39.c[1593,1606] [2022-11-23 03:12:05,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:12:05,700 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:12:05,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:05 WrapperNode [2022-11-23 03:12:05,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:12:05,702 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:12:05,703 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:12:05,703 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:12:05,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:05" (1/1) ... [2022-11-23 03:12:05,759 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:05" (1/1) ... [2022-11-23 03:12:05,877 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2022-11-23 03:12:05,877 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:12:05,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:12:05,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:12:05,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:12:05,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:05" (1/1) ... [2022-11-23 03:12:05,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:05" (1/1) ... [2022-11-23 03:12:05,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:05" (1/1) ... [2022-11-23 03:12:05,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:05" (1/1) ... [2022-11-23 03:12:05,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:05" (1/1) ... [2022-11-23 03:12:06,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:05" (1/1) ... [2022-11-23 03:12:06,036 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:05" (1/1) ... [2022-11-23 03:12:06,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:05" (1/1) ... [2022-11-23 03:12:06,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:12:06,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:12:06,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:12:06,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:12:06,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:05" (1/1) ... [2022-11-23 03:12:06,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:12:06,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8934cab6-c4c9-48cb-a622-9f8870db1498/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:12:06,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8934cab6-c4c9-48cb-a622-9f8870db1498/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:12:06,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8934cab6-c4c9-48cb-a622-9f8870db1498/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:12:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:12:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 03:12:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:12:06,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:12:06,284 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:12:06,286 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:12:08,516 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:12:08,540 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:12:08,547 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-23 03:12:08,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:12:08 BoogieIcfgContainer [2022-11-23 03:12:08,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:12:08,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:12:08,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:12:08,562 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:12:08,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:12:04" (1/3) ... [2022-11-23 03:12:08,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f12002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:12:08, skipping insertion in model container [2022-11-23 03:12:08,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:05" (2/3) ... [2022-11-23 03:12:08,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f12002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:12:08, skipping insertion in model container [2022-11-23 03:12:08,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:12:08" (3/3) ... [2022-11-23 03:12:08,572 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label39.c [2022-11-23 03:12:08,596 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:12:08,597 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 03:12:08,704 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:12:08,716 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1f2604bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:12:08,718 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 03:12:08,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:12:08,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 03:12:08,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:12:08,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:12:08,742 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:12:08,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:12:08,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1417350502, now seen corresponding path program 1 times [2022-11-23 03:12:08,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:12:08,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785388910] [2022-11-23 03:12:08,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:12:08,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:12:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:12:09,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:12:09,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:12:09,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785388910] [2022-11-23 03:12:09,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785388910] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:12:09,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:12:09,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:12:09,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850895400] [2022-11-23 03:12:09,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:12:09,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:12:09,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:12:09,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:12:09,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:09,186 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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) [2022-11-23 03:12:10,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:12:10,922 INFO L93 Difference]: Finished difference Result 763 states and 1352 transitions. [2022-11-23 03:12:10,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:12:10,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-23 03:12:10,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:12:10,950 INFO L225 Difference]: With dead ends: 763 [2022-11-23 03:12:10,950 INFO L226 Difference]: Without dead ends: 416 [2022-11-23 03:12:10,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:10,959 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 263 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-23 03:12:10,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 89 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-23 03:12:10,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-11-23 03:12:11,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 408. [2022-11-23 03:12:11,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 1.6142506142506143) internal successors, (657), 407 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) [2022-11-23 03:12:11,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 657 transitions. [2022-11-23 03:12:11,050 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 657 transitions. Word has length 10 [2022-11-23 03:12:11,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:12:11,050 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 657 transitions. [2022-11-23 03:12:11,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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) [2022-11-23 03:12:11,051 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 657 transitions. [2022-11-23 03:12:11,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-23 03:12:11,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:12:11,054 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:12:11,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 03:12:11,055 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:12:11,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:12:11,056 INFO L85 PathProgramCache]: Analyzing trace with hash -932027650, now seen corresponding path program 1 times [2022-11-23 03:12:11,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:12:11,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208227307] [2022-11-23 03:12:11,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:12:11,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:12:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:12:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:12:11,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:12:11,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208227307] [2022-11-23 03:12:11,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208227307] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:12:11,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:12:11,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:12:11,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465358322] [2022-11-23 03:12:11,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:12:11,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:12:11,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:12:11,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:12:11,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:11,381 INFO L87 Difference]: Start difference. First operand 408 states and 657 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 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) [2022-11-23 03:12:12,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:12:12,718 INFO L93 Difference]: Finished difference Result 1193 states and 1931 transitions. [2022-11-23 03:12:12,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:12:12,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-11-23 03:12:12,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:12:12,724 INFO L225 Difference]: With dead ends: 1193 [2022-11-23 03:12:12,725 INFO L226 Difference]: Without dead ends: 787 [2022-11-23 03:12:12,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:12,728 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 143 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:12:12,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 153 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-23 03:12:12,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2022-11-23 03:12:12,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 783. [2022-11-23 03:12:12,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 1.4398976982097187) internal successors, (1126), 782 states have internal predecessors, (1126), 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) [2022-11-23 03:12:12,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1126 transitions. [2022-11-23 03:12:12,795 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1126 transitions. Word has length 75 [2022-11-23 03:12:12,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:12:12,796 INFO L495 AbstractCegarLoop]: Abstraction has 783 states and 1126 transitions. [2022-11-23 03:12:12,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 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) [2022-11-23 03:12:12,797 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1126 transitions. [2022-11-23 03:12:12,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-23 03:12:12,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:12:12,801 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:12:12,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 03:12:12,803 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:12:12,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:12:12,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1800636210, now seen corresponding path program 1 times [2022-11-23 03:12:12,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:12:12,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929229932] [2022-11-23 03:12:12,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:12:12,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:12:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:12:12,977 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:12:12,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:12:12,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929229932] [2022-11-23 03:12:12,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929229932] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:12:12,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:12:12,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:12:12,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036100280] [2022-11-23 03:12:12,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:12:12,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:12:12,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:12:12,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:12:12,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:12,982 INFO L87 Difference]: Start difference. First operand 783 states and 1126 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 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) [2022-11-23 03:12:14,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:12:14,214 INFO L93 Difference]: Finished difference Result 1948 states and 2803 transitions. [2022-11-23 03:12:14,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:12:14,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-11-23 03:12:14,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:12:14,220 INFO L225 Difference]: With dead ends: 1948 [2022-11-23 03:12:14,220 INFO L226 Difference]: Without dead ends: 1167 [2022-11-23 03:12:14,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:14,229 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 144 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:12:14,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 116 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-23 03:12:14,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2022-11-23 03:12:14,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1154. [2022-11-23 03:12:14,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1153 states have (on average 1.3399826539462272) internal successors, (1545), 1153 states have internal predecessors, (1545), 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) [2022-11-23 03:12:14,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1545 transitions. [2022-11-23 03:12:14,269 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1545 transitions. Word has length 78 [2022-11-23 03:12:14,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:12:14,270 INFO L495 AbstractCegarLoop]: Abstraction has 1154 states and 1545 transitions. [2022-11-23 03:12:14,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 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) [2022-11-23 03:12:14,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1545 transitions. [2022-11-23 03:12:14,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-23 03:12:14,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:12:14,273 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:12:14,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 03:12:14,274 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:12:14,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:12:14,274 INFO L85 PathProgramCache]: Analyzing trace with hash -506886028, now seen corresponding path program 1 times [2022-11-23 03:12:14,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:12:14,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390290896] [2022-11-23 03:12:14,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:12:14,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:12:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:12:14,804 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:12:14,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:12:14,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390290896] [2022-11-23 03:12:14,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390290896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:12:14,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:12:14,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:12:14,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576702726] [2022-11-23 03:12:14,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:12:14,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:12:14,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:12:14,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:12:14,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:14,811 INFO L87 Difference]: Start difference. First operand 1154 states and 1545 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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) [2022-11-23 03:12:15,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:12:15,967 INFO L93 Difference]: Finished difference Result 2676 states and 3531 transitions. [2022-11-23 03:12:15,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:12:15,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2022-11-23 03:12:15,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:12:15,975 INFO L225 Difference]: With dead ends: 2676 [2022-11-23 03:12:15,975 INFO L226 Difference]: Without dead ends: 1524 [2022-11-23 03:12:15,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:15,987 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:12:15,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 189 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-23 03:12:15,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2022-11-23 03:12:16,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1523. [2022-11-23 03:12:16,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1523 states, 1522 states have (on average 1.269382391590013) internal successors, (1932), 1522 states have internal predecessors, (1932), 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) [2022-11-23 03:12:16,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1932 transitions. [2022-11-23 03:12:16,033 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1932 transitions. Word has length 79 [2022-11-23 03:12:16,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:12:16,034 INFO L495 AbstractCegarLoop]: Abstraction has 1523 states and 1932 transitions. [2022-11-23 03:12:16,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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) [2022-11-23 03:12:16,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1932 transitions. [2022-11-23 03:12:16,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-23 03:12:16,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:12:16,045 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:12:16,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 03:12:16,046 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:12:16,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:12:16,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1306346415, now seen corresponding path program 1 times [2022-11-23 03:12:16,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:12:16,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568000337] [2022-11-23 03:12:16,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:12:16,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:12:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:12:16,349 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:12:16,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:12:16,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568000337] [2022-11-23 03:12:16,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568000337] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:12:16,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:12:16,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:12:16,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010873602] [2022-11-23 03:12:16,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:12:16,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:12:16,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:12:16,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:12:16,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:16,357 INFO L87 Difference]: Start difference. First operand 1523 states and 1932 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 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) [2022-11-23 03:12:17,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:12:17,549 INFO L93 Difference]: Finished difference Result 3968 states and 5154 transitions. [2022-11-23 03:12:17,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:12:17,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2022-11-23 03:12:17,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:12:17,560 INFO L225 Difference]: With dead ends: 3968 [2022-11-23 03:12:17,561 INFO L226 Difference]: Without dead ends: 2631 [2022-11-23 03:12:17,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:17,564 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 115 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:12:17,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 154 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-23 03:12:17,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2022-11-23 03:12:17,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 2631. [2022-11-23 03:12:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2631 states, 2630 states have (on average 1.2133079847908745) internal successors, (3191), 2630 states have internal predecessors, (3191), 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) [2022-11-23 03:12:17,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 3191 transitions. [2022-11-23 03:12:17,634 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 3191 transitions. Word has length 137 [2022-11-23 03:12:17,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:12:17,636 INFO L495 AbstractCegarLoop]: Abstraction has 2631 states and 3191 transitions. [2022-11-23 03:12:17,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 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) [2022-11-23 03:12:17,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 3191 transitions. [2022-11-23 03:12:17,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-11-23 03:12:17,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:12:17,639 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:12:17,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 03:12:17,640 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:12:17,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:12:17,641 INFO L85 PathProgramCache]: Analyzing trace with hash -2060663887, now seen corresponding path program 1 times [2022-11-23 03:12:17,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:12:17,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097380196] [2022-11-23 03:12:17,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:12:17,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:12:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:12:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 03:12:17,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:12:17,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097380196] [2022-11-23 03:12:17,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097380196] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:12:17,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:12:17,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:12:17,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926723524] [2022-11-23 03:12:17,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:12:17,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:12:17,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:12:17,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:12:17,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:17,880 INFO L87 Difference]: Start difference. First operand 2631 states and 3191 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:12:18,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:12:18,936 INFO L93 Difference]: Finished difference Result 5634 states and 6859 transitions. [2022-11-23 03:12:18,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:12:18,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2022-11-23 03:12:18,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:12:18,961 INFO L225 Difference]: With dead ends: 5634 [2022-11-23 03:12:18,962 INFO L226 Difference]: Without dead ends: 3189 [2022-11-23 03:12:18,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:18,970 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 75 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:12:18,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 153 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-23 03:12:18,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2022-11-23 03:12:19,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 3004. [2022-11-23 03:12:19,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3004 states, 3003 states have (on average 1.2131202131202132) internal successors, (3643), 3003 states have internal predecessors, (3643), 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) [2022-11-23 03:12:19,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 3643 transitions. [2022-11-23 03:12:19,068 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 3643 transitions. Word has length 153 [2022-11-23 03:12:19,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:12:19,069 INFO L495 AbstractCegarLoop]: Abstraction has 3004 states and 3643 transitions. [2022-11-23 03:12:19,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:12:19,070 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 3643 transitions. [2022-11-23 03:12:19,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-11-23 03:12:19,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:12:19,075 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2022-11-23 03:12:19,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 03:12:19,076 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:12:19,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:12:19,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2099034226, now seen corresponding path program 1 times [2022-11-23 03:12:19,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:12:19,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045601782] [2022-11-23 03:12:19,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:12:19,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:12:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:12:19,423 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:12:19,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:12:19,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045601782] [2022-11-23 03:12:19,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045601782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:12:19,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:12:19,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:12:19,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854756346] [2022-11-23 03:12:19,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:12:19,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:12:19,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:12:19,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:12:19,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:19,427 INFO L87 Difference]: Start difference. First operand 3004 states and 3643 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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) [2022-11-23 03:12:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:12:20,590 INFO L93 Difference]: Finished difference Result 6935 states and 8497 transitions. [2022-11-23 03:12:20,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:12:20,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 190 [2022-11-23 03:12:20,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:12:20,606 INFO L225 Difference]: With dead ends: 6935 [2022-11-23 03:12:20,606 INFO L226 Difference]: Without dead ends: 4117 [2022-11-23 03:12:20,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:20,611 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 135 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:12:20,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 332 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-23 03:12:20,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4117 states. [2022-11-23 03:12:20,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4117 to 3740. [2022-11-23 03:12:20,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3740 states, 3739 states have (on average 1.2048676116608719) internal successors, (4505), 3739 states have internal predecessors, (4505), 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) [2022-11-23 03:12:20,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3740 states to 3740 states and 4505 transitions. [2022-11-23 03:12:20,759 INFO L78 Accepts]: Start accepts. Automaton has 3740 states and 4505 transitions. Word has length 190 [2022-11-23 03:12:20,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:12:20,760 INFO L495 AbstractCegarLoop]: Abstraction has 3740 states and 4505 transitions. [2022-11-23 03:12:20,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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) [2022-11-23 03:12:20,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3740 states and 4505 transitions. [2022-11-23 03:12:20,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-11-23 03:12:20,764 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:12:20,764 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:12:20,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 03:12:20,765 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:12:20,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:12:20,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1137585256, now seen corresponding path program 1 times [2022-11-23 03:12:20,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:12:20,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200762290] [2022-11-23 03:12:20,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:12:20,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:12:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:12:21,202 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-11-23 03:12:21,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:12:21,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200762290] [2022-11-23 03:12:21,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200762290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:12:21,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:12:21,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:12:21,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170276581] [2022-11-23 03:12:21,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:12:21,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:12:21,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:12:21,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:12:21,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:21,206 INFO L87 Difference]: Start difference. First operand 3740 states and 4505 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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) [2022-11-23 03:12:22,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:12:22,488 INFO L93 Difference]: Finished difference Result 9889 states and 12024 transitions. [2022-11-23 03:12:22,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:12:22,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 191 [2022-11-23 03:12:22,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:12:22,513 INFO L225 Difference]: With dead ends: 9889 [2022-11-23 03:12:22,513 INFO L226 Difference]: Without dead ends: 6151 [2022-11-23 03:12:22,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:22,520 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 216 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:12:22,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 332 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-23 03:12:22,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6151 states. [2022-11-23 03:12:22,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6151 to 5415. [2022-11-23 03:12:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5415 states, 5414 states have (on average 1.2016992981159955) internal successors, (6506), 5414 states have internal predecessors, (6506), 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) [2022-11-23 03:12:22,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5415 states to 5415 states and 6506 transitions. [2022-11-23 03:12:22,713 INFO L78 Accepts]: Start accepts. Automaton has 5415 states and 6506 transitions. Word has length 191 [2022-11-23 03:12:22,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:12:22,714 INFO L495 AbstractCegarLoop]: Abstraction has 5415 states and 6506 transitions. [2022-11-23 03:12:22,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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) [2022-11-23 03:12:22,715 INFO L276 IsEmpty]: Start isEmpty. Operand 5415 states and 6506 transitions. [2022-11-23 03:12:22,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-11-23 03:12:22,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:12:22,719 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:12:22,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 03:12:22,727 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:12:22,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:12:22,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1821003992, now seen corresponding path program 1 times [2022-11-23 03:12:22,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:12:22,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156409509] [2022-11-23 03:12:22,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:12:22,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:12:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:12:23,096 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:12:23,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:12:23,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156409509] [2022-11-23 03:12:23,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156409509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:12:23,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:12:23,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:12:23,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687817965] [2022-11-23 03:12:23,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:12:23,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:12:23,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:12:23,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:12:23,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:23,101 INFO L87 Difference]: Start difference. First operand 5415 states and 6506 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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) [2022-11-23 03:12:24,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:12:24,247 INFO L93 Difference]: Finished difference Result 10825 states and 13007 transitions. [2022-11-23 03:12:24,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:12:24,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 228 [2022-11-23 03:12:24,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:12:24,266 INFO L225 Difference]: With dead ends: 10825 [2022-11-23 03:12:24,267 INFO L226 Difference]: Without dead ends: 5412 [2022-11-23 03:12:24,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:24,276 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 142 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:12:24,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 304 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-23 03:12:24,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5412 states. [2022-11-23 03:12:24,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5412 to 5412. [2022-11-23 03:12:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5412 states, 5411 states have (on average 1.1750138606542229) internal successors, (6358), 5411 states have internal predecessors, (6358), 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) [2022-11-23 03:12:24,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5412 states to 5412 states and 6358 transitions. [2022-11-23 03:12:24,470 INFO L78 Accepts]: Start accepts. Automaton has 5412 states and 6358 transitions. Word has length 228 [2022-11-23 03:12:24,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:12:24,471 INFO L495 AbstractCegarLoop]: Abstraction has 5412 states and 6358 transitions. [2022-11-23 03:12:24,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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) [2022-11-23 03:12:24,472 INFO L276 IsEmpty]: Start isEmpty. Operand 5412 states and 6358 transitions. [2022-11-23 03:12:24,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2022-11-23 03:12:24,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:12:24,477 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-23 03:12:24,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 03:12:24,478 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:12:24,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:12:24,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1429898405, now seen corresponding path program 1 times [2022-11-23 03:12:24,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:12:24,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746711860] [2022-11-23 03:12:24,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:12:24,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:12:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:12:24,882 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-11-23 03:12:24,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:12:24,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746711860] [2022-11-23 03:12:24,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746711860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:12:24,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:12:24,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:12:24,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401811942] [2022-11-23 03:12:24,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:12:24,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:12:24,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:12:24,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:12:24,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:24,892 INFO L87 Difference]: Start difference. First operand 5412 states and 6358 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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) [2022-11-23 03:12:25,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:12:25,999 INFO L93 Difference]: Finished difference Result 11563 states and 13590 transitions. [2022-11-23 03:12:26,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:12:26,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 242 [2022-11-23 03:12:26,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:12:26,037 INFO L225 Difference]: With dead ends: 11563 [2022-11-23 03:12:26,046 INFO L226 Difference]: Without dead ends: 6153 [2022-11-23 03:12:26,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:26,053 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 212 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:12:26,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 148 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-23 03:12:26,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6153 states. [2022-11-23 03:12:26,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6153 to 5412. [2022-11-23 03:12:26,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5412 states, 5411 states have (on average 1.1750138606542229) internal successors, (6358), 5411 states have internal predecessors, (6358), 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) [2022-11-23 03:12:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5412 states to 5412 states and 6358 transitions. [2022-11-23 03:12:26,244 INFO L78 Accepts]: Start accepts. Automaton has 5412 states and 6358 transitions. Word has length 242 [2022-11-23 03:12:26,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:12:26,245 INFO L495 AbstractCegarLoop]: Abstraction has 5412 states and 6358 transitions. [2022-11-23 03:12:26,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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) [2022-11-23 03:12:26,246 INFO L276 IsEmpty]: Start isEmpty. Operand 5412 states and 6358 transitions. [2022-11-23 03:12:26,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2022-11-23 03:12:26,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:12:26,253 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:12:26,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 03:12:26,254 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:12:26,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:12:26,255 INFO L85 PathProgramCache]: Analyzing trace with hash -783309825, now seen corresponding path program 1 times [2022-11-23 03:12:26,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:12:26,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313370493] [2022-11-23 03:12:26,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:12:26,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:12:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:12:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-11-23 03:12:26,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:12:26,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313370493] [2022-11-23 03:12:26,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313370493] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:12:26,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:12:26,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:12:26,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943830973] [2022-11-23 03:12:26,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:12:26,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:12:26,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:12:26,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:12:26,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:12:26,821 INFO L87 Difference]: Start difference. First operand 5412 states and 6358 transitions. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 3 states have internal predecessors, (179), 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) [2022-11-23 03:12:29,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:12:29,040 INFO L93 Difference]: Finished difference Result 16177 states and 19208 transitions. [2022-11-23 03:12:29,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:12:29,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 245 [2022-11-23 03:12:29,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:12:29,066 INFO L225 Difference]: With dead ends: 16177 [2022-11-23 03:12:29,066 INFO L226 Difference]: Without dead ends: 10767 [2022-11-23 03:12:29,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:12:29,074 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 253 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:12:29,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 117 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-23 03:12:29,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10767 states. [2022-11-23 03:12:29,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10767 to 10203. [2022-11-23 03:12:29,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10203 states, 10202 states have (on average 1.1782983728680652) internal successors, (12021), 10202 states have internal predecessors, (12021), 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) [2022-11-23 03:12:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10203 states to 10203 states and 12021 transitions. [2022-11-23 03:12:29,291 INFO L78 Accepts]: Start accepts. Automaton has 10203 states and 12021 transitions. Word has length 245 [2022-11-23 03:12:29,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:12:29,292 INFO L495 AbstractCegarLoop]: Abstraction has 10203 states and 12021 transitions. [2022-11-23 03:12:29,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 3 states have internal predecessors, (179), 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) [2022-11-23 03:12:29,295 INFO L276 IsEmpty]: Start isEmpty. Operand 10203 states and 12021 transitions. [2022-11-23 03:12:29,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-11-23 03:12:29,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:12:29,302 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:12:29,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 03:12:29,303 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:12:29,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:12:29,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1822240153, now seen corresponding path program 1 times [2022-11-23 03:12:29,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:12:29,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457272206] [2022-11-23 03:12:29,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:12:29,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:12:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:12:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:12:29,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:12:29,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457272206] [2022-11-23 03:12:29,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457272206] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:12:29,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:12:29,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:12:29,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948256056] [2022-11-23 03:12:29,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:12:29,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:12:29,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:12:29,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:12:29,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:12:29,683 INFO L87 Difference]: Start difference. First operand 10203 states and 12021 transitions. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 3 states have internal predecessors, (254), 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) [2022-11-23 03:12:31,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:12:31,649 INFO L93 Difference]: Finished difference Result 25948 states and 30535 transitions. [2022-11-23 03:12:31,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:12:31,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 254 [2022-11-23 03:12:31,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:12:31,684 INFO L225 Difference]: With dead ends: 25948 [2022-11-23 03:12:31,685 INFO L226 Difference]: Without dead ends: 16115 [2022-11-23 03:12:31,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:12:31,697 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 259 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-23 03:12:31,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 77 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-23 03:12:31,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16115 states. [2022-11-23 03:12:32,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16115 to 15929. [2022-11-23 03:12:32,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15929 states, 15928 states have (on average 1.167817679558011) internal successors, (18601), 15928 states have internal predecessors, (18601), 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) [2022-11-23 03:12:32,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15929 states to 15929 states and 18601 transitions. [2022-11-23 03:12:32,061 INFO L78 Accepts]: Start accepts. Automaton has 15929 states and 18601 transitions. Word has length 254 [2022-11-23 03:12:32,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:12:32,062 INFO L495 AbstractCegarLoop]: Abstraction has 15929 states and 18601 transitions. [2022-11-23 03:12:32,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 3 states have internal predecessors, (254), 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) [2022-11-23 03:12:32,063 INFO L276 IsEmpty]: Start isEmpty. Operand 15929 states and 18601 transitions. [2022-11-23 03:12:32,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2022-11-23 03:12:32,069 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:12:32,070 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-23 03:12:32,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 03:12:32,070 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:12:32,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:12:32,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1804337915, now seen corresponding path program 1 times [2022-11-23 03:12:32,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:12:32,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687406852] [2022-11-23 03:12:32,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:12:32,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:12:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:12:32,311 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2022-11-23 03:12:32,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:12:32,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687406852] [2022-11-23 03:12:32,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687406852] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:12:32,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:12:32,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:12:32,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360046702] [2022-11-23 03:12:32,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:12:32,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:12:32,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:12:32,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:12:32,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:32,315 INFO L87 Difference]: Start difference. First operand 15929 states and 18601 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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) [2022-11-23 03:12:33,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:12:33,462 INFO L93 Difference]: Finished difference Result 32771 states and 38344 transitions. [2022-11-23 03:12:33,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:12:33,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 265 [2022-11-23 03:12:33,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:12:33,500 INFO L225 Difference]: With dead ends: 32771 [2022-11-23 03:12:33,500 INFO L226 Difference]: Without dead ends: 18320 [2022-11-23 03:12:33,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:33,514 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 209 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:12:33,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 151 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-23 03:12:33,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18320 states. [2022-11-23 03:12:33,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18320 to 13344. [2022-11-23 03:12:33,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13344 states, 13343 states have (on average 1.1708011691523645) internal successors, (15622), 13343 states have internal predecessors, (15622), 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) [2022-11-23 03:12:33,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13344 states to 13344 states and 15622 transitions. [2022-11-23 03:12:33,809 INFO L78 Accepts]: Start accepts. Automaton has 13344 states and 15622 transitions. Word has length 265 [2022-11-23 03:12:33,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:12:33,810 INFO L495 AbstractCegarLoop]: Abstraction has 13344 states and 15622 transitions. [2022-11-23 03:12:33,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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) [2022-11-23 03:12:33,811 INFO L276 IsEmpty]: Start isEmpty. Operand 13344 states and 15622 transitions. [2022-11-23 03:12:33,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2022-11-23 03:12:33,818 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:12:33,820 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:12:33,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 03:12:33,821 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:12:33,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:12:33,821 INFO L85 PathProgramCache]: Analyzing trace with hash 2031798723, now seen corresponding path program 1 times [2022-11-23 03:12:33,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:12:33,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817540797] [2022-11-23 03:12:33,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:12:33,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:12:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:12:34,568 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:12:34,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:12:34,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817540797] [2022-11-23 03:12:34,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817540797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:12:34,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:12:34,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:12:34,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575091803] [2022-11-23 03:12:34,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:12:34,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:12:34,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:12:34,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:12:34,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:12:34,572 INFO L87 Difference]: Start difference. First operand 13344 states and 15622 transitions. Second operand has 4 states, 4 states have (on average 71.25) internal successors, (285), 3 states have internal predecessors, (285), 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) [2022-11-23 03:12:36,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:12:36,727 INFO L93 Difference]: Finished difference Result 28361 states and 33226 transitions. [2022-11-23 03:12:36,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:12:36,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.25) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 285 [2022-11-23 03:12:36,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:12:36,758 INFO L225 Difference]: With dead ends: 28361 [2022-11-23 03:12:36,758 INFO L226 Difference]: Without dead ends: 15387 [2022-11-23 03:12:36,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:12:36,769 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 168 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:12:36,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 141 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-23 03:12:36,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15387 states. [2022-11-23 03:12:36,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15387 to 13902. [2022-11-23 03:12:36,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13902 states, 13901 states have (on average 1.167038342565283) internal successors, (16223), 13901 states have internal predecessors, (16223), 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) [2022-11-23 03:12:37,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13902 states to 13902 states and 16223 transitions. [2022-11-23 03:12:37,011 INFO L78 Accepts]: Start accepts. Automaton has 13902 states and 16223 transitions. Word has length 285 [2022-11-23 03:12:37,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:12:37,012 INFO L495 AbstractCegarLoop]: Abstraction has 13902 states and 16223 transitions. [2022-11-23 03:12:37,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.25) internal successors, (285), 3 states have internal predecessors, (285), 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) [2022-11-23 03:12:37,012 INFO L276 IsEmpty]: Start isEmpty. Operand 13902 states and 16223 transitions. [2022-11-23 03:12:37,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2022-11-23 03:12:37,021 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:12:37,021 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:12:37,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 03:12:37,022 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:12:37,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:12:37,022 INFO L85 PathProgramCache]: Analyzing trace with hash -888982911, now seen corresponding path program 1 times [2022-11-23 03:12:37,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:12:37,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154687828] [2022-11-23 03:12:37,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:12:37,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:12:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:12:37,359 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-23 03:12:37,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:12:37,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154687828] [2022-11-23 03:12:37,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154687828] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:12:37,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:12:37,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:12:37,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800951860] [2022-11-23 03:12:37,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:12:37,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:12:37,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:12:37,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:12:37,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:37,363 INFO L87 Difference]: Start difference. First operand 13902 states and 16223 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 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) [2022-11-23 03:12:38,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:12:38,082 INFO L93 Difference]: Finished difference Result 26870 states and 31337 transitions. [2022-11-23 03:12:38,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:12:38,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 292 [2022-11-23 03:12:38,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:12:38,108 INFO L225 Difference]: With dead ends: 26870 [2022-11-23 03:12:38,109 INFO L226 Difference]: Without dead ends: 13338 [2022-11-23 03:12:38,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:38,118 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 187 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 03:12:38,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 38 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 03:12:38,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13338 states. [2022-11-23 03:12:38,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13338 to 13336. [2022-11-23 03:12:38,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13336 states, 13335 states have (on average 1.1616047994000749) internal successors, (15490), 13335 states have internal predecessors, (15490), 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) [2022-11-23 03:12:38,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13336 states to 13336 states and 15490 transitions. [2022-11-23 03:12:38,352 INFO L78 Accepts]: Start accepts. Automaton has 13336 states and 15490 transitions. Word has length 292 [2022-11-23 03:12:38,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:12:38,353 INFO L495 AbstractCegarLoop]: Abstraction has 13336 states and 15490 transitions. [2022-11-23 03:12:38,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 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) [2022-11-23 03:12:38,353 INFO L276 IsEmpty]: Start isEmpty. Operand 13336 states and 15490 transitions. [2022-11-23 03:12:38,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2022-11-23 03:12:38,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:12:38,360 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-23 03:12:38,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 03:12:38,361 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:12:38,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:12:38,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1739667143, now seen corresponding path program 1 times [2022-11-23 03:12:38,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:12:38,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682601916] [2022-11-23 03:12:38,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:12:38,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:12:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:12:38,826 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-11-23 03:12:38,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:12:38,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682601916] [2022-11-23 03:12:38,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682601916] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:12:38,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:12:38,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:12:38,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957200453] [2022-11-23 03:12:38,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:12:38,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:12:38,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:12:38,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:12:38,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:38,832 INFO L87 Difference]: Start difference. First operand 13336 states and 15490 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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) [2022-11-23 03:12:40,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:12:40,092 INFO L93 Difference]: Finished difference Result 27960 states and 32461 transitions. [2022-11-23 03:12:40,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:12:40,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 316 [2022-11-23 03:12:40,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:12:40,120 INFO L225 Difference]: With dead ends: 27960 [2022-11-23 03:12:40,120 INFO L226 Difference]: Without dead ends: 14994 [2022-11-23 03:12:40,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:40,130 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 148 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:12:40,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 304 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-23 03:12:40,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14994 states. [2022-11-23 03:12:40,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14994 to 13513. [2022-11-23 03:12:40,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13513 states, 13512 states have (on average 1.1573416222616932) internal successors, (15638), 13512 states have internal predecessors, (15638), 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) [2022-11-23 03:12:40,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13513 states to 13513 states and 15638 transitions. [2022-11-23 03:12:40,389 INFO L78 Accepts]: Start accepts. Automaton has 13513 states and 15638 transitions. Word has length 316 [2022-11-23 03:12:40,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:12:40,390 INFO L495 AbstractCegarLoop]: Abstraction has 13513 states and 15638 transitions. [2022-11-23 03:12:40,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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) [2022-11-23 03:12:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand 13513 states and 15638 transitions. [2022-11-23 03:12:40,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2022-11-23 03:12:40,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:12:40,401 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:12:40,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-23 03:12:40,401 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:12:40,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:12:40,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1494130800, now seen corresponding path program 1 times [2022-11-23 03:12:40,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:12:40,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817285915] [2022-11-23 03:12:40,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:12:40,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:12:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:12:40,994 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2022-11-23 03:12:40,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:12:40,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817285915] [2022-11-23 03:12:40,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817285915] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:12:40,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:12:40,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:12:40,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965743237] [2022-11-23 03:12:40,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:12:40,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:12:40,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:12:40,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:12:40,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:40,997 INFO L87 Difference]: Start difference. First operand 13513 states and 15638 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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) [2022-11-23 03:12:42,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:12:42,089 INFO L93 Difference]: Finished difference Result 29982 states and 34796 transitions. [2022-11-23 03:12:42,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:12:42,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 317 [2022-11-23 03:12:42,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:12:42,104 INFO L225 Difference]: With dead ends: 29982 [2022-11-23 03:12:42,105 INFO L226 Difference]: Without dead ends: 16839 [2022-11-23 03:12:42,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:42,113 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 207 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:12:42,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 345 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-23 03:12:42,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16839 states. [2022-11-23 03:12:42,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16839 to 15547. [2022-11-23 03:12:42,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15547 states, 15546 states have (on average 1.1573395085552554) internal successors, (17992), 15546 states have internal predecessors, (17992), 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) [2022-11-23 03:12:42,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15547 states to 15547 states and 17992 transitions. [2022-11-23 03:12:42,435 INFO L78 Accepts]: Start accepts. Automaton has 15547 states and 17992 transitions. Word has length 317 [2022-11-23 03:12:42,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:12:42,436 INFO L495 AbstractCegarLoop]: Abstraction has 15547 states and 17992 transitions. [2022-11-23 03:12:42,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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) [2022-11-23 03:12:42,436 INFO L276 IsEmpty]: Start isEmpty. Operand 15547 states and 17992 transitions. [2022-11-23 03:12:42,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2022-11-23 03:12:42,443 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:12:42,444 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:12:42,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-23 03:12:42,445 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:12:42,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:12:42,445 INFO L85 PathProgramCache]: Analyzing trace with hash 36720221, now seen corresponding path program 1 times [2022-11-23 03:12:42,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:12:42,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981206001] [2022-11-23 03:12:42,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:12:42,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:12:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:12:42,733 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2022-11-23 03:12:42,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:12:42,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981206001] [2022-11-23 03:12:42,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981206001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:12:42,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:12:42,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:12:42,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393821934] [2022-11-23 03:12:42,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:12:42,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:12:42,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:12:42,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:12:42,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:42,735 INFO L87 Difference]: Start difference. First operand 15547 states and 17992 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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) [2022-11-23 03:12:43,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:12:43,662 INFO L93 Difference]: Finished difference Result 15917 states and 18373 transitions. [2022-11-23 03:12:43,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:12:43,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 321 [2022-11-23 03:12:43,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:12:43,678 INFO L225 Difference]: With dead ends: 15917 [2022-11-23 03:12:43,678 INFO L226 Difference]: Without dead ends: 15915 [2022-11-23 03:12:43,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:43,683 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 206 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 03:12:43,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 303 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 03:12:43,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15915 states. [2022-11-23 03:12:43,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15915 to 13138. [2022-11-23 03:12:43,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13138 states, 13137 states have (on average 1.1441729466392632) internal successors, (15031), 13137 states have internal predecessors, (15031), 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) [2022-11-23 03:12:44,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13138 states to 13138 states and 15031 transitions. [2022-11-23 03:12:44,018 INFO L78 Accepts]: Start accepts. Automaton has 13138 states and 15031 transitions. Word has length 321 [2022-11-23 03:12:44,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:12:44,019 INFO L495 AbstractCegarLoop]: Abstraction has 13138 states and 15031 transitions. [2022-11-23 03:12:44,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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) [2022-11-23 03:12:44,020 INFO L276 IsEmpty]: Start isEmpty. Operand 13138 states and 15031 transitions. [2022-11-23 03:12:44,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2022-11-23 03:12:44,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:12:44,028 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:12:44,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-23 03:12:44,029 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:12:44,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:12:44,030 INFO L85 PathProgramCache]: Analyzing trace with hash 244368998, now seen corresponding path program 1 times [2022-11-23 03:12:44,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:12:44,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882636608] [2022-11-23 03:12:44,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:12:44,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:12:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:12:44,361 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-11-23 03:12:44,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:12:44,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882636608] [2022-11-23 03:12:44,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882636608] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:12:44,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:12:44,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:12:44,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103042596] [2022-11-23 03:12:44,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:12:44,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:12:44,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:12:44,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:12:44,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:44,367 INFO L87 Difference]: Start difference. First operand 13138 states and 15031 transitions. 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) [2022-11-23 03:12:45,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:12:45,551 INFO L93 Difference]: Finished difference Result 27751 states and 31850 transitions. [2022-11-23 03:12:45,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:12:45,552 INFO L78 Accepts]: Start accepts. 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) Word has length 332 [2022-11-23 03:12:45,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:12:45,572 INFO L225 Difference]: With dead ends: 27751 [2022-11-23 03:12:45,573 INFO L226 Difference]: Without dead ends: 14799 [2022-11-23 03:12:45,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:45,583 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 106 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:12:45,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 347 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-23 03:12:45,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14799 states. [2022-11-23 03:12:45,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14799 to 14426. [2022-11-23 03:12:45,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14426 states, 14425 states have (on average 1.1379549393414212) internal successors, (16415), 14425 states have internal predecessors, (16415), 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) [2022-11-23 03:12:45,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14426 states to 14426 states and 16415 transitions. [2022-11-23 03:12:45,933 INFO L78 Accepts]: Start accepts. Automaton has 14426 states and 16415 transitions. Word has length 332 [2022-11-23 03:12:45,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:12:45,933 INFO L495 AbstractCegarLoop]: Abstraction has 14426 states and 16415 transitions. [2022-11-23 03:12:45,934 INFO L496 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) [2022-11-23 03:12:45,934 INFO L276 IsEmpty]: Start isEmpty. Operand 14426 states and 16415 transitions. [2022-11-23 03:12:45,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2022-11-23 03:12:45,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:12:45,945 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:12:45,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-23 03:12:45,946 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:12:45,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:12:45,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1041535103, now seen corresponding path program 1 times [2022-11-23 03:12:45,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:12:45,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668423895] [2022-11-23 03:12:45,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:12:45,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:12:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:12:46,412 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-23 03:12:46,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:12:46,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668423895] [2022-11-23 03:12:46,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668423895] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:12:46,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:12:46,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:12:46,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928798170] [2022-11-23 03:12:46,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:12:46,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:12:46,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:12:46,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:12:46,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:46,415 INFO L87 Difference]: Start difference. First operand 14426 states and 16415 transitions. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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) [2022-11-23 03:12:47,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:12:47,689 INFO L93 Difference]: Finished difference Result 31440 states and 35902 transitions. [2022-11-23 03:12:47,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:12:47,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 352 [2022-11-23 03:12:47,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:12:47,709 INFO L225 Difference]: With dead ends: 31440 [2022-11-23 03:12:47,709 INFO L226 Difference]: Without dead ends: 17384 [2022-11-23 03:12:47,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:47,720 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 140 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:12:47,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 121 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-23 03:12:47,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17384 states. [2022-11-23 03:12:48,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17384 to 17014. [2022-11-23 03:12:48,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17014 states, 17013 states have (on average 1.1326632575089637) internal successors, (19270), 17013 states have internal predecessors, (19270), 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) [2022-11-23 03:12:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17014 states to 17014 states and 19270 transitions. [2022-11-23 03:12:48,045 INFO L78 Accepts]: Start accepts. Automaton has 17014 states and 19270 transitions. Word has length 352 [2022-11-23 03:12:48,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:12:48,045 INFO L495 AbstractCegarLoop]: Abstraction has 17014 states and 19270 transitions. [2022-11-23 03:12:48,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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) [2022-11-23 03:12:48,046 INFO L276 IsEmpty]: Start isEmpty. Operand 17014 states and 19270 transitions. [2022-11-23 03:12:48,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2022-11-23 03:12:48,066 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:12:48,066 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:12:48,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-23 03:12:48,067 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:12:48,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:12:48,067 INFO L85 PathProgramCache]: Analyzing trace with hash -718698362, now seen corresponding path program 1 times [2022-11-23 03:12:48,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:12:48,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938765381] [2022-11-23 03:12:48,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:12:48,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:12:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:12:48,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:12:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:12:48,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:12:48,562 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 03:12:48,563 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-23 03:12:48,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-23 03:12:48,570 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:12:48,575 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 03:12:48,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:12:48 BoogieIcfgContainer [2022-11-23 03:12:48,766 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 03:12:48,766 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 03:12:48,767 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 03:12:48,767 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 03:12:48,768 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:12:08" (3/4) ... [2022-11-23 03:12:48,770 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 03:12:48,971 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8934cab6-c4c9-48cb-a622-9f8870db1498/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 03:12:48,972 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 03:12:48,972 INFO L158 Benchmark]: Toolchain (without parser) took 44409.64ms. Allocated memory was 159.4MB in the beginning and 899.7MB in the end (delta: 740.3MB). Free memory was 114.0MB in the beginning and 435.5MB in the end (delta: -321.5MB). Peak memory consumption was 419.5MB. Max. memory is 16.1GB. [2022-11-23 03:12:48,973 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 107.0MB. Free memory is still 60.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:12:48,980 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1132.29ms. Allocated memory is still 159.4MB. Free memory was 114.0MB in the beginning and 125.3MB in the end (delta: -11.3MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. [2022-11-23 03:12:48,980 INFO L158 Benchmark]: Boogie Procedure Inliner took 175.10ms. Allocated memory is still 159.4MB. Free memory was 125.3MB in the beginning and 107.9MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-23 03:12:48,981 INFO L158 Benchmark]: Boogie Preprocessor took 193.63ms. Allocated memory is still 159.4MB. Free memory was 107.9MB in the beginning and 98.9MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-23 03:12:48,981 INFO L158 Benchmark]: RCFGBuilder took 2479.30ms. Allocated memory was 159.4MB in the beginning and 285.2MB in the end (delta: 125.8MB). Free memory was 98.2MB in the beginning and 192.8MB in the end (delta: -94.5MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. [2022-11-23 03:12:48,982 INFO L158 Benchmark]: TraceAbstraction took 40208.32ms. Allocated memory was 285.2MB in the beginning and 899.7MB in the end (delta: 614.5MB). Free memory was 191.7MB in the beginning and 464.8MB in the end (delta: -273.1MB). Peak memory consumption was 341.3MB. Max. memory is 16.1GB. [2022-11-23 03:12:48,983 INFO L158 Benchmark]: Witness Printer took 205.26ms. Allocated memory is still 899.7MB. Free memory was 464.8MB in the beginning and 435.5MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-23 03:12:48,984 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.23ms. Allocated memory is still 107.0MB. Free memory is still 60.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1132.29ms. Allocated memory is still 159.4MB. Free memory was 114.0MB in the beginning and 125.3MB in the end (delta: -11.3MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 175.10ms. Allocated memory is still 159.4MB. Free memory was 125.3MB in the beginning and 107.9MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 193.63ms. Allocated memory is still 159.4MB. Free memory was 107.9MB in the beginning and 98.9MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2479.30ms. Allocated memory was 159.4MB in the beginning and 285.2MB in the end (delta: 125.8MB). Free memory was 98.2MB in the beginning and 192.8MB in the end (delta: -94.5MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. * TraceAbstraction took 40208.32ms. Allocated memory was 285.2MB in the beginning and 899.7MB in the end (delta: 614.5MB). Free memory was 191.7MB in the beginning and 464.8MB in the end (delta: -273.1MB). Peak memory consumption was 341.3MB. Max. memory is 16.1GB. * Witness Printer took 205.26ms. Allocated memory is still 899.7MB. Free memory was 464.8MB in the beginning and 435.5MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 46]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int inputA = 1; [L18] int inputD = 4; [L19] int inputB = 2; [L20] int inputE = 5; [L21] int inputF = 6; [L22] int inputC = 3; [L25] int a29 = 130; [L26] int a4 = 1; [L27] int a23 = 312; [L28] int a8 = 15; [L29] int a25 = 10; [L30] int a3 = 1; VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1041] int output = -1; VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L1044] COND TRUE 1 [L1047] int input; [L1048] input = __VERIFIER_nondet_int() [L1049] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1052] CALL, EXPR calculate_output(input) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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=10, a29=130, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [L541] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 5)) && (a3==1))) && (a25==9)) && a29 <= 140 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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=10, a29=130, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [L552] COND FALSE !(((((a8==15) && ( a23 <= -43 && (((input == 1) && ((a25==10) || (a25==11))) && a29 <= 140 ))) && !(a4==1)) && (a3==1))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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=10, a29=130, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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=10, a29=130, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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=10, a29=130, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [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=10, a29=130, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [L582] COND FALSE !(( 277 < a29 && (((a25==13) && ( a23 <= -43 && (!(a4==1) && ((input == 1) && (a3==1))))) && (a8==15)))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [L585] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (((a25==9) && ((input == 4) && !(a4==1))) && a29 <= 140 )) && (a3==1)) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [L591] COND TRUE ((a8==15) && ((((a3==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 3)) && (a4==1))) && 306 < a23 ) && a29 <= 140 )) [L592] a29 = (((((a29 - 0) % 15)+ 262) + 241270) + -241271) [L593] a25 = 12 [L595] return 24; VAL [\result=24, a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=3] [L1052] RET, EXPR calculate_output(input) [L1052] output = calculate_output(input) [L1044] COND TRUE 1 [L1047] int input; [L1048] input = __VERIFIER_nondet_int() [L1049] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1052] CALL, EXPR calculate_output(input) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L39] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L42] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L45] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L51] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L54] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L57] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L60] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L63] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L66] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L69] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L78] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L81] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L84] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L87] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L90] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L96] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L105] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L114] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L117] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L126] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L129] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L138] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L144] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L147] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L150] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L153] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L162] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L174] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L177] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L180] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L183] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L186] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L189] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L192] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L195] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L198] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L204] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L207] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L210] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L213] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L237] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L275] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) VAL [a23=312, a25=12, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [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=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L320] COND TRUE ((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 ))) [L321] a29 = (((a29 / 5) / 5) + -580303) [L322] a23 = (((a23 - 600264) + -12) / 5) [L323] a4 = 0 [L324] a25 = 12 [L326] return -1; VAL [\result=-1, a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L1052] RET, EXPR calculate_output(input) [L1052] output = calculate_output(input) [L1044] COND TRUE 1 [L1047] int input; [L1048] input = __VERIFIER_nondet_int() [L1049] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1052] CALL, EXPR calculate_output(input) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L36] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L39] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L42] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L45] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L48] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L51] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L54] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L57] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L60] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L63] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L66] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L69] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L72] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L75] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L78] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L81] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L84] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L87] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L90] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L93] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L96] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L99] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L102] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L105] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L108] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L111] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L114] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L117] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L120] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L123] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L126] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L129] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L132] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L135] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L138] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L141] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L144] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L147] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L150] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L153] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L156] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L159] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L162] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L165] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L168] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L171] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L174] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L177] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L180] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L183] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L186] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L189] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L192] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L195] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L198] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L201] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L204] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L207] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L210] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L213] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L217] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L231] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L237] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L264] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L275] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L278] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L285] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L297] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L304] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L309] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L315] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L332] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L339] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L356] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L380] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L394] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L401] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L408] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L427] COND FALSE !((((((!(a4==1) && ((a8==15) && (input == 2))) && (a3==1)) && ((140 < a29) && (245 >= a29)) ) && (a25==12)) && a23 <= -43 )) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L432] COND FALSE !(( a23 <= -43 && (( a29 <= 140 && ((a8==15) && (!(a4==1) && (((a25==12) || (a25==13)) && (input == 3))))) && (a3==1)))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L446] COND FALSE !(((!(a4==1) && (((((a3==1) && (input == 4)) && (a25==11)) && ((245 < a29) && (277 >= a29)) ) && a23 <= -43 )) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L460] COND FALSE !(((((!(a4==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 4)) && 277 < a29 )) && a23 <= -43 ) && (a8==15)) && (a3==1))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L466] COND FALSE !(( ((140 < a29) && (245 >= a29)) && ((a8==15) && (((a25==12) && (!(a4==1) && ( a23 <= -43 && (input == 4)))) && (a3==1))))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L487] COND FALSE !(((a25==12) && (((a3==1) && ((((input == 1) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) ) && !(a4==1))) && (a8==15)))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L524] COND FALSE !((((a4==1) && ( 306 < a23 && ((((input == 3) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L536] COND FALSE !(((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15)))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L541] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 5)) && (a3==1))) && (a25==9)) && a29 <= 140 ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L547] COND FALSE !(( 306 < a23 && (((a8==15) && ((((input == 1) && ((a25==11) || (a25==12))) && (a4==1)) && (a3==1))) && ((140 < a29) && (245 >= a29)) ))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L552] COND FALSE !(((((a8==15) && ( a23 <= -43 && (((input == 1) && ((a25==10) || (a25==11))) && a29 <= 140 ))) && !(a4==1)) && (a3==1))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L571] COND FALSE !(( 306 < a23 && (((a3==1) && ( 277 < a29 && (((input == 4) && (((a25==9) || (a25==10)) || (a25==11))) && (a8==15)))) && (a4==1)))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L576] COND FALSE !((!(a4==1) && ( a23 <= -43 && ((a8==15) && (((((a25==12) || ((a25==10) || (a25==11))) && (input == 1)) && (a3==1)) && 277 < a29 ))))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L582] COND FALSE !(( 277 < a29 && (((a25==13) && ( a23 <= -43 && (!(a4==1) && ((input == 1) && (a3==1))))) && (a8==15)))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L585] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (((a25==9) && ((input == 4) && !(a4==1))) && a29 <= 140 )) && (a3==1)) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L591] COND FALSE !(((a8==15) && ((((a3==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 3)) && (a4==1))) && 306 < a23 ) && a29 <= 140 ))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=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=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L613] COND FALSE !(( a29 <= 140 && (((a4==1) && ((a8==15) && (((input == 6) && (((a25==10) || (a25==11)) || (a25==12))) && 306 < a23 ))) && (a3==1)))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L625] COND FALSE !(((((((a3==1) && ((input == 5) && ((a25==11) || (a25==12)))) && (a4==1)) && 306 < a23 ) && ((140 < a29) && (245 >= a29)) ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L631] COND FALSE !(((((a4==1) && ( 306 < a23 && ((a8==15) && (((a25==11) || (a25==12)) && (input == 2))))) && ((140 < a29) && (245 >= a29)) ) && (a3==1))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L638] COND FALSE !(((((a8==15) && ( a23 <= -43 && (!(a4==1) && ((a25==11) && (input == 5))))) && (a3==1)) && ((245 < a29) && (277 >= a29)) )) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L645] COND FALSE !((((((((input == 2) && ((a25==9) || (a25==10))) && (a8==15)) && ((140 < a29) && (245 >= a29)) ) && 306 < a23 ) && (a3==1)) && (a4==1))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L652] COND FALSE !(((a8==15) && (((( 277 < a29 && ((input == 2) && ((a25==11) || ((a25==9) || (a25==10))))) && (a4==1)) && (a3==1)) && 306 < a23 ))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L657] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 3) && ((a25==12) || ((a25==10) || (a25==11))))) && !(a4==1)) && (a8==15)) && a29 <= 140 ) && (a3==1))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L668] COND FALSE !((((!(a4==1) && ((((input == 6) && ((a25==12) || ((a25==10) || (a25==11)))) && (a8==15)) && ((-43 < a23) && (138 >= a23)) )) && (a3==1)) && a29 <= 140 )) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L673] COND FALSE !(((a25==9) && (( a29 <= 140 && ((a3==1) && (!(a4==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 2))))) && (a8==15)))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L680] COND FALSE !((!(a4==1) && ( a23 <= -43 && (((a8==15) && (((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ( ((245 < a29) && (277 >= a29)) && (a25==13))) || ((a25==9) && 277 < a29 )) && (input == 3))) && (a3==1))))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L685] COND FALSE !((((!(a4==1) && ((a3==1) && ((input == 5) && ((( ((245 < a29) && (277 >= a29)) && (a25==12)) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ((a25==9) && 277 < a29 ))))) && a23 <= -43 ) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L691] COND FALSE !(( a23 <= -43 && (!(a4==1) && ( ((245 < a29) && (277 >= a29)) && ((a8==15) && ((a25==11) && ((a3==1) && (input == 3)))))))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L698] COND FALSE !(((((a8==15) && ( 306 < a23 && ( ((140 < a29) && (245 >= a29)) && ((input == 1) && ((a25==9) || (a25==10)))))) && (a4==1)) && (a3==1))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L704] COND FALSE !((!(a4==1) && (((((a3==1) && ((input == 2) && (((a25==9) || (a25==10)) || (a25==11)))) && ((140 < a29) && (245 >= a29)) ) && a23 <= -43 ) && (a8==15)))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L716] COND FALSE !(((((((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))) && (input == 6)) && (a3==1)) && 306 < a23 ) && (a4==1)) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L722] COND FALSE !(( 306 < a23 && ((a8==15) && ( 277 < a29 && ((a4==1) && ((a3==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 5)))))))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L727] COND FALSE !(((( 277 < a29 && ((a8==15) && (((input == 6) && a23 <= -43 ) && (a25==13)))) && !(a4==1)) && (a3==1))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L741] COND FALSE !(((a3==1) && (((!(a4==1) && ((( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))) && (input == 3))) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L748] COND FALSE !(((a3==1) && (( 306 < a23 && (((a4==1) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 1))) && a29 <= 140 )) && (a8==15)))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L753] COND FALSE !((((( a23 <= -43 && ((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))))) && (a3==1)) && !(a4==1)) && (a8==15))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L760] COND FALSE !(((!(a4==1) && (((a8==15) && ( a29 <= 140 && (((a25==10) || (a25==11)) && (input == 5)))) && a23 <= -43 )) && (a3==1))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L767] COND FALSE !((((((a8==15) && ((a3==1) && ( a23 <= -43 && (input == 5)))) && !(a4==1)) && (a25==13)) && 277 < a29 )) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L779] COND FALSE !(((a8==15) && ((a3==1) && ( 306 < a23 && ((((((a25==11) || (a25==12)) || (a25==13)) && (input == 1)) && (a4==1)) && ((245 < a29) && (277 >= a29)) ))))) VAL [a23=-119992, a25=12, a29=-580293, a3=1, a4=0, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L784] COND TRUE (!(a4==1) && (((((((a25==12) || (a25==13)) && (input == 6)) && (a8==15)) && a23 <= -43 ) && (a3==1)) && a29 <= 140 )) [L785] a23 = (((((a23 % 83)- -241) * 10)/ 9) - 2) [L786] a4 = 1 [L787] a25 = 9 [L789] return -1; VAL [\result=-1, a23=202, a25=9, a29=-580293, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=6] [L1052] RET, EXPR calculate_output(input) [L1052] output = calculate_output(input) [L1044] COND TRUE 1 [L1047] int input; [L1048] input = __VERIFIER_nondet_int() [L1049] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1052] CALL calculate_output(input) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=202, a25=9, a29=-580293, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L36] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=202, a25=9, a29=-580293, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L39] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=202, a25=9, a29=-580293, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L42] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [a23=202, a25=9, a29=-580293, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L45] COND TRUE ((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15)) VAL [a23=202, a25=9, a29=-580293, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] [L46] reach_error() VAL [a23=202, a25=9, a29=-580293, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, unknown-#in~input-unknown=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.9s, OverallIterations: 21, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 27.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3448 SdHoareTripleChecker+Valid, 24.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3448 mSDsluCounter, 3914 SdHoareTripleChecker+Invalid, 20.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 452 mSDsCounter, 2054 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12283 IncrementalHoareTripleChecker+Invalid, 14337 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2054 mSolverCounterUnsat, 3462 mSDtfsCounter, 12283 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17014occurred in iteration=20, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 15571 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 4724 NumberOfCodeBlocks, 4724 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 4342 ConstructedInterpolants, 0 QuantifiedInterpolants, 8806 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 2598/2598 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! [2022-11-23 03:12:49,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8934cab6-c4c9-48cb-a622-9f8870db1498/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE