./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label24.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label24.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --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 f233881536e6ffcd5e13ce256457b3d1c260bbbbc97bb4192986ecaadc07ebf5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:48:22,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:48:22,913 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 11:48:22,920 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:48:22,921 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:48:22,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:48:22,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:48:22,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:48:22,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:48:22,973 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:48:22,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:48:22,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:48:22,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:48:22,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:48:22,977 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:48:22,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:48:22,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:48:22,979 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:48:22,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:48:22,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:48:22,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:48:22,981 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:48:22,981 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:48:22,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:48:22,982 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:48:22,982 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:48:22,983 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:48:22,984 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:48:22,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:48:22,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:48:22,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:48:22,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:48:22,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:48:22,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:48:22,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:48:22,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:48:22,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:48:22,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:48:22,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:48:22,988 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:48:22,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:48:22,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:48:22,989 INFO L153 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_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/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_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> f233881536e6ffcd5e13ce256457b3d1c260bbbbc97bb4192986ecaadc07ebf5 [2023-11-26 11:48:23,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:48:23,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:48:23,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:48:23,308 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:48:23,308 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:48:23,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/eca-rers2012/Problem10_label24.c [2023-11-26 11:48:26,472 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:48:26,827 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:48:26,828 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/sv-benchmarks/c/eca-rers2012/Problem10_label24.c [2023-11-26 11:48:26,846 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/data/960118753/0e971e2091244fc68c835daf2c6629f4/FLAGf6df20e31 [2023-11-26 11:48:26,863 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/data/960118753/0e971e2091244fc68c835daf2c6629f4 [2023-11-26 11:48:26,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:48:26,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:48:26,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:48:26,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:48:26,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:48:26,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:48:26" (1/1) ... [2023-11-26 11:48:26,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@82bdaaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:26, skipping insertion in model container [2023-11-26 11:48:26,893 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:48:26" (1/1) ... [2023-11-26 11:48:26,991 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:48:27,206 WARN L240 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_469c1be2-27be-411f-b00e-c0b0aa71934d/sv-benchmarks/c/eca-rers2012/Problem10_label24.c[1861,1874] [2023-11-26 11:48:27,432 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:48:27,453 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:48:27,488 WARN L240 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_469c1be2-27be-411f-b00e-c0b0aa71934d/sv-benchmarks/c/eca-rers2012/Problem10_label24.c[1861,1874] [2023-11-26 11:48:27,658 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:48:27,676 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:48:27,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:27 WrapperNode [2023-11-26 11:48:27,676 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:48:27,678 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:48:27,678 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:48:27,678 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:48:27,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:27" (1/1) ... [2023-11-26 11:48:27,716 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:27" (1/1) ... [2023-11-26 11:48:27,819 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2023-11-26 11:48:27,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:48:27,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:48:27,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:48:27,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:48:27,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:27" (1/1) ... [2023-11-26 11:48:27,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:27" (1/1) ... [2023-11-26 11:48:27,863 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:27" (1/1) ... [2023-11-26 11:48:27,903 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-26 11:48:27,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:27" (1/1) ... [2023-11-26 11:48:27,904 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:27" (1/1) ... [2023-11-26 11:48:27,933 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:27" (1/1) ... [2023-11-26 11:48:27,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:27" (1/1) ... [2023-11-26 11:48:27,951 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:27" (1/1) ... [2023-11-26 11:48:27,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:27" (1/1) ... [2023-11-26 11:48:27,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:48:27,987 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:48:27,988 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:48:27,988 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:48:27,989 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:27" (1/1) ... [2023-11-26 11:48:27,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:48:28,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:48:28,023 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:48:28,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:48:28,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:48:28,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:48:28,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:48:28,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:48:28,161 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:48:28,167 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:48:29,623 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:48:29,699 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:48:29,701 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:48:29,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:48:29 BoogieIcfgContainer [2023-11-26 11:48:29,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:48:29,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:48:29,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:48:29,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:48:29,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:48:26" (1/3) ... [2023-11-26 11:48:29,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e0329ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:48:29, skipping insertion in model container [2023-11-26 11:48:29,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:27" (2/3) ... [2023-11-26 11:48:29,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e0329ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:48:29, skipping insertion in model container [2023-11-26 11:48:29,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:48:29" (3/3) ... [2023-11-26 11:48:29,717 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label24.c [2023-11-26 11:48:29,741 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:48:29,741 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:48:29,804 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:48:29,811 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=LoopHeads, 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;@31df0922, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:48:29,812 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:48:29,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 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) [2023-11-26 11:48:29,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-26 11:48:29,824 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:29,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:29,826 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:29,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:29,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1467425732, now seen corresponding path program 1 times [2023-11-26 11:48:29,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:29,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047055727] [2023-11-26 11:48:29,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:29,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:30,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:48:30,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:30,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047055727] [2023-11-26 11:48:30,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047055727] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:30,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:30,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:48:30,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719121242] [2023-11-26 11:48:30,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:30,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:48:30,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:30,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:48:30,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:48:30,064 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 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 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2023-11-26 11:48:30,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:30,106 INFO L93 Difference]: Finished difference Result 287 states and 563 transitions. [2023-11-26 11:48:30,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:48:30,109 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2023-11-26 11:48:30,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:30,120 INFO L225 Difference]: With dead ends: 287 [2023-11-26 11:48:30,120 INFO L226 Difference]: Without dead ends: 142 [2023-11-26 11:48:30,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:48:30,128 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:30,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:48:30,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-26 11:48:30,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2023-11-26 11:48:30,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 141 states have internal predecessors, (217), 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) [2023-11-26 11:48:30,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2023-11-26 11:48:30,177 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 13 [2023-11-26 11:48:30,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:30,178 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2023-11-26 11:48:30,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2023-11-26 11:48:30,178 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2023-11-26 11:48:30,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-26 11:48:30,179 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:30,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:30,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:48:30,180 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:30,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:30,180 INFO L85 PathProgramCache]: Analyzing trace with hash -346479627, now seen corresponding path program 1 times [2023-11-26 11:48:30,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:30,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445737187] [2023-11-26 11:48:30,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:30,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:30,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:48:30,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:30,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445737187] [2023-11-26 11:48:30,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445737187] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:30,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:30,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:48:30,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434611540] [2023-11-26 11:48:30,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:30,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:48:30,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:30,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:48:30,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:48:30,340 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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) [2023-11-26 11:48:31,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:31,161 INFO L93 Difference]: Finished difference Result 422 states and 648 transitions. [2023-11-26 11:48:31,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:48:31,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2023-11-26 11:48:31,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:31,165 INFO L225 Difference]: With dead ends: 422 [2023-11-26 11:48:31,165 INFO L226 Difference]: Without dead ends: 281 [2023-11-26 11:48:31,166 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 [2023-11-26 11:48:31,168 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 133 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:31,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 65 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-26 11:48:31,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-11-26 11:48:31,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2023-11-26 11:48:31,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.3428571428571427) internal successors, (376), 280 states have internal predecessors, (376), 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) [2023-11-26 11:48:31,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 376 transitions. [2023-11-26 11:48:31,192 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 376 transitions. Word has length 13 [2023-11-26 11:48:31,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:31,193 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 376 transitions. [2023-11-26 11:48:31,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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) [2023-11-26 11:48:31,193 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 376 transitions. [2023-11-26 11:48:31,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-26 11:48:31,196 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:31,197 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-26 11:48:31,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:48:31,197 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:31,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:31,198 INFO L85 PathProgramCache]: Analyzing trace with hash 525834593, now seen corresponding path program 1 times [2023-11-26 11:48:31,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:31,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777399227] [2023-11-26 11:48:31,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:31,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:48:31,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:31,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777399227] [2023-11-26 11:48:31,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777399227] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:31,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:31,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:48:31,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788934899] [2023-11-26 11:48:31,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:31,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:48:31,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:31,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:48:31,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:48:31,586 INFO L87 Difference]: Start difference. First operand 281 states and 376 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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) [2023-11-26 11:48:32,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:32,241 INFO L93 Difference]: Finished difference Result 700 states and 966 transitions. [2023-11-26 11:48:32,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:48:32,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 [2023-11-26 11:48:32,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:32,246 INFO L225 Difference]: With dead ends: 700 [2023-11-26 11:48:32,246 INFO L226 Difference]: Without dead ends: 420 [2023-11-26 11:48:32,248 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 [2023-11-26 11:48:32,249 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 132 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:32,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 212 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-26 11:48:32,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2023-11-26 11:48:32,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2023-11-26 11:48:32,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.2529832935560858) internal successors, (525), 419 states have internal predecessors, (525), 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) [2023-11-26 11:48:32,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 525 transitions. [2023-11-26 11:48:32,277 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 525 transitions. Word has length 79 [2023-11-26 11:48:32,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:32,278 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 525 transitions. [2023-11-26 11:48:32,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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) [2023-11-26 11:48:32,278 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 525 transitions. [2023-11-26 11:48:32,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-26 11:48:32,282 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:32,282 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-26 11:48:32,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:48:32,283 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:32,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:32,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1524863746, now seen corresponding path program 1 times [2023-11-26 11:48:32,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:32,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164064883] [2023-11-26 11:48:32,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:32,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:48:32,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:32,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164064883] [2023-11-26 11:48:32,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164064883] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:32,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:32,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:48:32,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488906197] [2023-11-26 11:48:32,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:32,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:48:32,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:32,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:48:32,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:48:32,541 INFO L87 Difference]: Start difference. First operand 420 states and 525 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 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) [2023-11-26 11:48:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:33,116 INFO L93 Difference]: Finished difference Result 978 states and 1208 transitions. [2023-11-26 11:48:33,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:48:33,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 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 86 [2023-11-26 11:48:33,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:33,121 INFO L225 Difference]: With dead ends: 978 [2023-11-26 11:48:33,122 INFO L226 Difference]: Without dead ends: 559 [2023-11-26 11:48:33,123 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 [2023-11-26 11:48:33,124 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:33,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 75 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 11:48:33,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2023-11-26 11:48:33,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2023-11-26 11:48:33,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.2078853046594982) internal successors, (674), 558 states have internal predecessors, (674), 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) [2023-11-26 11:48:33,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 674 transitions. [2023-11-26 11:48:33,146 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 674 transitions. Word has length 86 [2023-11-26 11:48:33,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:33,146 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 674 transitions. [2023-11-26 11:48:33,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 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) [2023-11-26 11:48:33,147 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 674 transitions. [2023-11-26 11:48:33,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-26 11:48:33,151 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:33,151 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-26 11:48:33,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:48:33,152 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:33,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:33,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1200441607, now seen corresponding path program 1 times [2023-11-26 11:48:33,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:33,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273297384] [2023-11-26 11:48:33,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:33,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:33,288 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:48:33,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:33,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273297384] [2023-11-26 11:48:33,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273297384] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:33,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:33,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:48:33,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988821853] [2023-11-26 11:48:33,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:33,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:48:33,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:33,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:48:33,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:48:33,292 INFO L87 Difference]: Start difference. First operand 559 states and 674 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:48:33,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:33,985 INFO L93 Difference]: Finished difference Result 978 states and 1198 transitions. [2023-11-26 11:48:33,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:48:33,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2023-11-26 11:48:33,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:33,992 INFO L225 Difference]: With dead ends: 978 [2023-11-26 11:48:33,993 INFO L226 Difference]: Without dead ends: 976 [2023-11-26 11:48:33,993 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 [2023-11-26 11:48:33,995 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 169 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:33,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 9 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-26 11:48:33,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2023-11-26 11:48:34,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 698. [2023-11-26 11:48:34,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.2740315638450501) internal successors, (888), 697 states have internal predecessors, (888), 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) [2023-11-26 11:48:34,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 888 transitions. [2023-11-26 11:48:34,018 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 888 transitions. Word has length 88 [2023-11-26 11:48:34,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:34,018 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 888 transitions. [2023-11-26 11:48:34,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:48:34,019 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 888 transitions. [2023-11-26 11:48:34,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-26 11:48:34,024 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:34,024 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:34,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:48:34,025 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:34,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:34,025 INFO L85 PathProgramCache]: Analyzing trace with hash -875518177, now seen corresponding path program 1 times [2023-11-26 11:48:34,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:34,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096684572] [2023-11-26 11:48:34,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:34,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:34,514 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:48:34,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:34,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096684572] [2023-11-26 11:48:34,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096684572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:34,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:34,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:48:34,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917418559] [2023-11-26 11:48:34,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:34,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:48:34,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:34,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:48:34,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:48:34,519 INFO L87 Difference]: Start difference. First operand 698 states and 888 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 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) [2023-11-26 11:48:35,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:35,241 INFO L93 Difference]: Finished difference Result 1260 states and 1630 transitions. [2023-11-26 11:48:35,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:48:35,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 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 131 [2023-11-26 11:48:35,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:35,257 INFO L225 Difference]: With dead ends: 1260 [2023-11-26 11:48:35,257 INFO L226 Difference]: Without dead ends: 702 [2023-11-26 11:48:35,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:48:35,260 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 91 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:35,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 83 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-26 11:48:35,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2023-11-26 11:48:35,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 698. [2023-11-26 11:48:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.266857962697274) internal successors, (883), 697 states have internal predecessors, (883), 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) [2023-11-26 11:48:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 883 transitions. [2023-11-26 11:48:35,280 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 883 transitions. Word has length 131 [2023-11-26 11:48:35,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:35,280 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 883 transitions. [2023-11-26 11:48:35,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 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) [2023-11-26 11:48:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 883 transitions. [2023-11-26 11:48:35,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-26 11:48:35,284 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:35,284 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:35,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:48:35,285 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:35,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:35,286 INFO L85 PathProgramCache]: Analyzing trace with hash -873788665, now seen corresponding path program 1 times [2023-11-26 11:48:35,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:35,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959390448] [2023-11-26 11:48:35,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:35,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:48:35,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:35,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959390448] [2023-11-26 11:48:35,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959390448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:35,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:35,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:48:35,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223502171] [2023-11-26 11:48:35,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:35,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:48:35,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:35,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:48:35,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:48:35,843 INFO L87 Difference]: Start difference. First operand 698 states and 883 transitions. Second operand has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 6 states have internal predecessors, (166), 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) [2023-11-26 11:48:36,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:36,553 INFO L93 Difference]: Finished difference Result 1311 states and 1676 transitions. [2023-11-26 11:48:36,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:48:36,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 6 states have internal predecessors, (166), 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 166 [2023-11-26 11:48:36,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:36,558 INFO L225 Difference]: With dead ends: 1311 [2023-11-26 11:48:36,559 INFO L226 Difference]: Without dead ends: 698 [2023-11-26 11:48:36,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:48:36,561 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 142 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:36,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 21 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-26 11:48:36,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2023-11-26 11:48:36,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2023-11-26 11:48:36,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.2611190817790532) internal successors, (879), 697 states have internal predecessors, (879), 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) [2023-11-26 11:48:36,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 879 transitions. [2023-11-26 11:48:36,580 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 879 transitions. Word has length 166 [2023-11-26 11:48:36,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:36,581 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 879 transitions. [2023-11-26 11:48:36,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 6 states have internal predecessors, (166), 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) [2023-11-26 11:48:36,582 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 879 transitions. [2023-11-26 11:48:36,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2023-11-26 11:48:36,585 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:36,585 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:36,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:48:36,586 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:36,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:36,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1654902739, now seen corresponding path program 1 times [2023-11-26 11:48:36,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:36,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749102686] [2023-11-26 11:48:36,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:36,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:36,907 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:48:36,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:36,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749102686] [2023-11-26 11:48:36,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749102686] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:36,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:36,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:48:36,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409670049] [2023-11-26 11:48:36,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:36,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:48:36,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:36,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:48:36,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:48:36,911 INFO L87 Difference]: Start difference. First operand 698 states and 879 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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) [2023-11-26 11:48:37,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:37,492 INFO L93 Difference]: Finished difference Result 1534 states and 2041 transitions. [2023-11-26 11:48:37,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:48:37,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 202 [2023-11-26 11:48:37,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:37,498 INFO L225 Difference]: With dead ends: 1534 [2023-11-26 11:48:37,498 INFO L226 Difference]: Without dead ends: 976 [2023-11-26 11:48:37,500 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 [2023-11-26 11:48:37,501 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 76 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:37,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 186 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 11:48:37,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2023-11-26 11:48:37,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2023-11-26 11:48:37,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.2594871794871796) internal successors, (1228), 975 states have internal predecessors, (1228), 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) [2023-11-26 11:48:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1228 transitions. [2023-11-26 11:48:37,526 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1228 transitions. Word has length 202 [2023-11-26 11:48:37,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:37,527 INFO L495 AbstractCegarLoop]: Abstraction has 976 states and 1228 transitions. [2023-11-26 11:48:37,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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) [2023-11-26 11:48:37,527 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1228 transitions. [2023-11-26 11:48:37,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-11-26 11:48:37,531 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:37,531 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:37,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:48:37,532 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:37,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:37,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1190532380, now seen corresponding path program 1 times [2023-11-26 11:48:37,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:37,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595237378] [2023-11-26 11:48:37,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:37,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 38 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:48:38,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:38,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595237378] [2023-11-26 11:48:38,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595237378] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:48:38,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940429077] [2023-11-26 11:48:38,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:38,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:48:38,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:48:38,180 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:48:38,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 11:48:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:38,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-26 11:48:38,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:48:38,855 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2023-11-26 11:48:38,856 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:48:38,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940429077] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:38,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 11:48:38,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2023-11-26 11:48:38,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515918142] [2023-11-26 11:48:38,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:38,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:48:38,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:38,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:48:38,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:48:38,865 INFO L87 Difference]: Start difference. First operand 976 states and 1228 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 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) [2023-11-26 11:48:39,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:39,435 INFO L93 Difference]: Finished difference Result 2090 states and 2644 transitions. [2023-11-26 11:48:39,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:48:39,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 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 [2023-11-26 11:48:39,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:39,443 INFO L225 Difference]: With dead ends: 2090 [2023-11-26 11:48:39,443 INFO L226 Difference]: Without dead ends: 1254 [2023-11-26 11:48:39,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:48:39,446 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 55 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:39,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 32 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 11:48:39,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2023-11-26 11:48:39,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1254. [2023-11-26 11:48:39,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.1652035115722266) internal successors, (1460), 1253 states have internal predecessors, (1460), 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) [2023-11-26 11:48:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1460 transitions. [2023-11-26 11:48:39,477 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1460 transitions. Word has length 245 [2023-11-26 11:48:39,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:39,478 INFO L495 AbstractCegarLoop]: Abstraction has 1254 states and 1460 transitions. [2023-11-26 11:48:39,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 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) [2023-11-26 11:48:39,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1460 transitions. [2023-11-26 11:48:39,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2023-11-26 11:48:39,484 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:39,484 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-26 11:48:39,493 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-26 11:48:39,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:48:39,691 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:39,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:39,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1077695902, now seen corresponding path program 1 times [2023-11-26 11:48:39,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:39,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274928201] [2023-11-26 11:48:39,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:39,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:40,504 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 108 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:48:40,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:40,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274928201] [2023-11-26 11:48:40,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274928201] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:48:40,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644144705] [2023-11-26 11:48:40,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:40,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:48:40,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:48:40,507 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:48:40,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 11:48:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:40,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-26 11:48:40,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:48:40,845 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-26 11:48:40,846 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:48:40,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644144705] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:40,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 11:48:40,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-26 11:48:40,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103841534] [2023-11-26 11:48:40,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:40,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:48:40,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:40,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:48:40,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:48:40,849 INFO L87 Difference]: Start difference. First operand 1254 states and 1460 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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) [2023-11-26 11:48:41,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:41,509 INFO L93 Difference]: Finished difference Result 2646 states and 3153 transitions. [2023-11-26 11:48:41,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:48:41,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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 275 [2023-11-26 11:48:41,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:41,520 INFO L225 Difference]: With dead ends: 2646 [2023-11-26 11:48:41,520 INFO L226 Difference]: Without dead ends: 1532 [2023-11-26 11:48:41,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:48:41,523 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 86 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:41,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 17 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-26 11:48:41,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2023-11-26 11:48:41,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1532. [2023-11-26 11:48:41,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1531 states have (on average 1.1868060091443502) internal successors, (1817), 1531 states have internal predecessors, (1817), 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) [2023-11-26 11:48:41,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1817 transitions. [2023-11-26 11:48:41,571 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1817 transitions. Word has length 275 [2023-11-26 11:48:41,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:41,572 INFO L495 AbstractCegarLoop]: Abstraction has 1532 states and 1817 transitions. [2023-11-26 11:48:41,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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) [2023-11-26 11:48:41,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1817 transitions. [2023-11-26 11:48:41,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2023-11-26 11:48:41,578 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:41,579 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-26 11:48:41,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-26 11:48:41,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:48:41,786 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:41,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:41,786 INFO L85 PathProgramCache]: Analyzing trace with hash 353757321, now seen corresponding path program 1 times [2023-11-26 11:48:41,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:41,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841307222] [2023-11-26 11:48:41,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:41,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:43,031 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 115 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:48:43,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:43,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841307222] [2023-11-26 11:48:43,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841307222] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:48:43,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21146460] [2023-11-26 11:48:43,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:43,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:48:43,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:48:43,033 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:48:43,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-26 11:48:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:43,191 INFO L262 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:48:43,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:48:43,703 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-26 11:48:43,703 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:48:43,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21146460] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:43,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 11:48:43,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2023-11-26 11:48:43,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073184216] [2023-11-26 11:48:43,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:43,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:48:43,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:43,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:48:43,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:48:43,707 INFO L87 Difference]: Start difference. First operand 1532 states and 1817 transitions. Second operand has 4 states, 4 states have (on average 68.5) internal successors, (274), 3 states have internal predecessors, (274), 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) [2023-11-26 11:48:44,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:44,750 INFO L93 Difference]: Finished difference Result 4455 states and 5292 transitions. [2023-11-26 11:48:44,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:48:44,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 3 states have internal predecessors, (274), 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 [2023-11-26 11:48:44,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:44,766 INFO L225 Difference]: With dead ends: 4455 [2023-11-26 11:48:44,767 INFO L226 Difference]: Without dead ends: 3063 [2023-11-26 11:48:44,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:48:44,770 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 102 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:44,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 52 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-26 11:48:44,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3063 states. [2023-11-26 11:48:44,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3063 to 2644. [2023-11-26 11:48:44,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2643 states have (on average 1.1619371925841846) internal successors, (3071), 2643 states have internal predecessors, (3071), 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) [2023-11-26 11:48:44,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3071 transitions. [2023-11-26 11:48:44,841 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3071 transitions. Word has length 285 [2023-11-26 11:48:44,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:44,841 INFO L495 AbstractCegarLoop]: Abstraction has 2644 states and 3071 transitions. [2023-11-26 11:48:44,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 3 states have internal predecessors, (274), 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) [2023-11-26 11:48:44,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3071 transitions. [2023-11-26 11:48:44,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2023-11-26 11:48:44,849 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:44,849 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-26 11:48:44,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-26 11:48:45,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:48:45,056 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:45,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:45,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1718702425, now seen corresponding path program 1 times [2023-11-26 11:48:45,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:45,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049219503] [2023-11-26 11:48:45,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:45,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:45,618 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-11-26 11:48:45,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:45,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049219503] [2023-11-26 11:48:45,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049219503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:45,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:45,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:48:45,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335838196] [2023-11-26 11:48:45,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:45,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:48:45,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:45,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:48:45,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:48:45,621 INFO L87 Difference]: Start difference. First operand 2644 states and 3071 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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) [2023-11-26 11:48:46,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:46,266 INFO L93 Difference]: Finished difference Result 6121 states and 7147 transitions. [2023-11-26 11:48:46,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:48:46,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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 304 [2023-11-26 11:48:46,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:46,286 INFO L225 Difference]: With dead ends: 6121 [2023-11-26 11:48:46,286 INFO L226 Difference]: Without dead ends: 3617 [2023-11-26 11:48:46,289 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 [2023-11-26 11:48:46,290 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 62 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:46,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 217 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-26 11:48:46,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3617 states. [2023-11-26 11:48:46,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3617 to 3061. [2023-11-26 11:48:46,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3061 states, 3060 states have (on average 1.1398692810457516) internal successors, (3488), 3060 states have internal predecessors, (3488), 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) [2023-11-26 11:48:46,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 3488 transitions. [2023-11-26 11:48:46,374 INFO L78 Accepts]: Start accepts. Automaton has 3061 states and 3488 transitions. Word has length 304 [2023-11-26 11:48:46,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:46,375 INFO L495 AbstractCegarLoop]: Abstraction has 3061 states and 3488 transitions. [2023-11-26 11:48:46,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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) [2023-11-26 11:48:46,376 INFO L276 IsEmpty]: Start isEmpty. Operand 3061 states and 3488 transitions. [2023-11-26 11:48:46,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2023-11-26 11:48:46,383 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:46,384 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-26 11:48:46,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 11:48:46,384 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:46,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:46,385 INFO L85 PathProgramCache]: Analyzing trace with hash -758159398, now seen corresponding path program 1 times [2023-11-26 11:48:46,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:46,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559789645] [2023-11-26 11:48:46,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:46,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:46,800 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-26 11:48:46,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:46,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559789645] [2023-11-26 11:48:46,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559789645] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:46,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:46,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:48:46,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543557614] [2023-11-26 11:48:46,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:46,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:48:46,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:46,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:48:46,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:48:46,807 INFO L87 Difference]: Start difference. First operand 3061 states and 3488 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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) [2023-11-26 11:48:47,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:47,447 INFO L93 Difference]: Finished difference Result 6677 states and 7655 transitions. [2023-11-26 11:48:47,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:48:47,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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 313 [2023-11-26 11:48:47,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:47,466 INFO L225 Difference]: With dead ends: 6677 [2023-11-26 11:48:47,467 INFO L226 Difference]: Without dead ends: 3756 [2023-11-26 11:48:47,470 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 [2023-11-26 11:48:47,471 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 63 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:47,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 49 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-26 11:48:47,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3756 states. [2023-11-26 11:48:47,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3756 to 3478. [2023-11-26 11:48:47,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3478 states, 3477 states have (on average 1.1415012942191545) internal successors, (3969), 3477 states have internal predecessors, (3969), 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) [2023-11-26 11:48:47,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3478 states to 3478 states and 3969 transitions. [2023-11-26 11:48:47,566 INFO L78 Accepts]: Start accepts. Automaton has 3478 states and 3969 transitions. Word has length 313 [2023-11-26 11:48:47,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:47,566 INFO L495 AbstractCegarLoop]: Abstraction has 3478 states and 3969 transitions. [2023-11-26 11:48:47,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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) [2023-11-26 11:48:47,567 INFO L276 IsEmpty]: Start isEmpty. Operand 3478 states and 3969 transitions. [2023-11-26 11:48:47,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2023-11-26 11:48:47,575 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:47,577 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-26 11:48:47,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 11:48:47,577 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:47,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:47,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1637515704, now seen corresponding path program 1 times [2023-11-26 11:48:47,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:47,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34818761] [2023-11-26 11:48:47,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:47,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:47,962 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2023-11-26 11:48:47,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:47,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34818761] [2023-11-26 11:48:47,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34818761] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:47,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:47,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:48:47,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556400923] [2023-11-26 11:48:47,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:47,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:48:47,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:47,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:48:47,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:48:47,966 INFO L87 Difference]: Start difference. First operand 3478 states and 3969 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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) [2023-11-26 11:48:48,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:48,529 INFO L93 Difference]: Finished difference Result 6955 states and 7953 transitions. [2023-11-26 11:48:48,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:48:48,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 331 [2023-11-26 11:48:48,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:48,550 INFO L225 Difference]: With dead ends: 6955 [2023-11-26 11:48:48,550 INFO L226 Difference]: Without dead ends: 3617 [2023-11-26 11:48:48,555 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 [2023-11-26 11:48:48,556 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 129 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:48,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 212 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 11:48:48,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3617 states. [2023-11-26 11:48:48,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3617 to 3617. [2023-11-26 11:48:48,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3617 states, 3616 states have (on average 1.1186393805309736) internal successors, (4045), 3616 states have internal predecessors, (4045), 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) [2023-11-26 11:48:48,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3617 states to 3617 states and 4045 transitions. [2023-11-26 11:48:48,652 INFO L78 Accepts]: Start accepts. Automaton has 3617 states and 4045 transitions. Word has length 331 [2023-11-26 11:48:48,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:48,653 INFO L495 AbstractCegarLoop]: Abstraction has 3617 states and 4045 transitions. [2023-11-26 11:48:48,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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) [2023-11-26 11:48:48,653 INFO L276 IsEmpty]: Start isEmpty. Operand 3617 states and 4045 transitions. [2023-11-26 11:48:48,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2023-11-26 11:48:48,662 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:48,663 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:48,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 11:48:48,663 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:48,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:48,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1257542082, now seen corresponding path program 1 times [2023-11-26 11:48:48,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:48,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872100041] [2023-11-26 11:48:48,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:48,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 56 proven. 134 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2023-11-26 11:48:49,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:49,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872100041] [2023-11-26 11:48:49,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872100041] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:48:49,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707931526] [2023-11-26 11:48:49,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:49,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:48:49,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:48:49,161 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:48:49,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-26 11:48:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:49,332 INFO L262 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-26 11:48:49,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:48:49,450 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2023-11-26 11:48:49,450 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:48:49,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707931526] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:49,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 11:48:49,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-11-26 11:48:49,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566056423] [2023-11-26 11:48:49,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:49,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:48:49,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:49,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:48:49,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:48:49,454 INFO L87 Difference]: Start difference. First operand 3617 states and 4045 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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) [2023-11-26 11:48:50,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:50,043 INFO L93 Difference]: Finished difference Result 8067 states and 9071 transitions. [2023-11-26 11:48:50,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:48:50,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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 339 [2023-11-26 11:48:50,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:50,061 INFO L225 Difference]: With dead ends: 8067 [2023-11-26 11:48:50,061 INFO L226 Difference]: Without dead ends: 3339 [2023-11-26 11:48:50,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:48:50,069 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 64 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:50,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 220 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 11:48:50,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2023-11-26 11:48:50,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 3339. [2023-11-26 11:48:50,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3339 states, 3338 states have (on average 1.0994607549430797) internal successors, (3670), 3338 states have internal predecessors, (3670), 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) [2023-11-26 11:48:50,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3339 states to 3339 states and 3670 transitions. [2023-11-26 11:48:50,143 INFO L78 Accepts]: Start accepts. Automaton has 3339 states and 3670 transitions. Word has length 339 [2023-11-26 11:48:50,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:50,144 INFO L495 AbstractCegarLoop]: Abstraction has 3339 states and 3670 transitions. [2023-11-26 11:48:50,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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) [2023-11-26 11:48:50,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 3670 transitions. [2023-11-26 11:48:50,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2023-11-26 11:48:50,154 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:50,155 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:50,166 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-26 11:48:50,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:48:50,362 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:50,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:50,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1821120117, now seen corresponding path program 1 times [2023-11-26 11:48:50,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:50,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863189457] [2023-11-26 11:48:50,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:50,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:50,764 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2023-11-26 11:48:50,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:50,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863189457] [2023-11-26 11:48:50,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863189457] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:50,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:50,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:48:50,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144476205] [2023-11-26 11:48:50,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:50,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:48:50,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:50,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:48:50,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:48:50,767 INFO L87 Difference]: Start difference. First operand 3339 states and 3670 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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) [2023-11-26 11:48:51,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:51,323 INFO L93 Difference]: Finished difference Result 7372 states and 8128 transitions. [2023-11-26 11:48:51,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:48:51,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 341 [2023-11-26 11:48:51,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:51,344 INFO L225 Difference]: With dead ends: 7372 [2023-11-26 11:48:51,344 INFO L226 Difference]: Without dead ends: 4034 [2023-11-26 11:48:51,348 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 [2023-11-26 11:48:51,349 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 135 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:51,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 193 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 11:48:51,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states. [2023-11-26 11:48:51,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 4034. [2023-11-26 11:48:51,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4034 states, 4033 states have (on average 1.0952144805355815) internal successors, (4417), 4033 states have internal predecessors, (4417), 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) [2023-11-26 11:48:51,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 4417 transitions. [2023-11-26 11:48:51,426 INFO L78 Accepts]: Start accepts. Automaton has 4034 states and 4417 transitions. Word has length 341 [2023-11-26 11:48:51,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:51,427 INFO L495 AbstractCegarLoop]: Abstraction has 4034 states and 4417 transitions. [2023-11-26 11:48:51,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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) [2023-11-26 11:48:51,427 INFO L276 IsEmpty]: Start isEmpty. Operand 4034 states and 4417 transitions. [2023-11-26 11:48:51,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2023-11-26 11:48:51,434 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:51,434 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:51,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 11:48:51,434 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:51,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:51,435 INFO L85 PathProgramCache]: Analyzing trace with hash 527170315, now seen corresponding path program 1 times [2023-11-26 11:48:51,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:51,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378292530] [2023-11-26 11:48:51,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:51,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:48:51,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:48:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:48:51,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:48:51,753 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:48:51,754 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 11:48:51,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 11:48:51,760 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:51,764 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:48:51,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:48:51 BoogieIcfgContainer [2023-11-26 11:48:51,955 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:48:51,956 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:48:51,956 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:48:51,956 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:48:51,957 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:48:29" (3/4) ... [2023-11-26 11:48:51,957 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-26 11:48:52,137 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 11:48:52,137 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:48:52,138 INFO L158 Benchmark]: Toolchain (without parser) took 25270.48ms. Allocated memory was 140.5MB in the beginning and 434.1MB in the end (delta: 293.6MB). Free memory was 100.2MB in the beginning and 301.5MB in the end (delta: -201.2MB). Peak memory consumption was 94.3MB. Max. memory is 16.1GB. [2023-11-26 11:48:52,138 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 113.2MB. Free memory is still 64.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:48:52,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 807.61ms. Allocated memory is still 140.5MB. Free memory was 99.9MB in the beginning and 71.8MB in the end (delta: 28.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-26 11:48:52,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 142.37ms. Allocated memory is still 140.5MB. Free memory was 71.8MB in the beginning and 106.5MB in the end (delta: -34.7MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2023-11-26 11:48:52,140 INFO L158 Benchmark]: Boogie Preprocessor took 165.01ms. Allocated memory is still 140.5MB. Free memory was 106.5MB in the beginning and 98.4MB in the end (delta: 8.1MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2023-11-26 11:48:52,140 INFO L158 Benchmark]: RCFGBuilder took 1715.17ms. Allocated memory was 140.5MB in the beginning and 172.0MB in the end (delta: 31.5MB). Free memory was 98.4MB in the beginning and 86.5MB in the end (delta: 11.9MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. [2023-11-26 11:48:52,140 INFO L158 Benchmark]: TraceAbstraction took 22249.33ms. Allocated memory was 172.0MB in the beginning and 434.1MB in the end (delta: 262.1MB). Free memory was 86.4MB in the beginning and 324.3MB in the end (delta: -237.9MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2023-11-26 11:48:52,141 INFO L158 Benchmark]: Witness Printer took 181.90ms. Allocated memory is still 434.1MB. Free memory was 324.3MB in the beginning and 301.5MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-26 11:48:52,143 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 113.2MB. Free memory is still 64.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 807.61ms. Allocated memory is still 140.5MB. Free memory was 99.9MB in the beginning and 71.8MB in the end (delta: 28.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 142.37ms. Allocated memory is still 140.5MB. Free memory was 71.8MB in the beginning and 106.5MB in the end (delta: -34.7MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 165.01ms. Allocated memory is still 140.5MB. Free memory was 106.5MB in the beginning and 98.4MB in the end (delta: 8.1MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1715.17ms. Allocated memory was 140.5MB in the beginning and 172.0MB in the end (delta: 31.5MB). Free memory was 98.4MB in the beginning and 86.5MB in the end (delta: 11.9MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. * TraceAbstraction took 22249.33ms. Allocated memory was 172.0MB in the beginning and 434.1MB in the end (delta: 262.1MB). Free memory was 86.4MB in the beginning and 324.3MB in the end (delta: -237.9MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. * Witness Printer took 181.90ms. Allocated memory is still 434.1MB. Free memory was 324.3MB in the beginning and 301.5MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 56]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int inputC = 3; [L18] int inputD = 4; [L19] int inputE = 5; [L20] int inputF = 6; [L21] int inputB = 2; [L24] int a1 = 23; [L25] int a19 = 9; [L26] int a10 = 0; [L27] int a12 = 0; [L28] int a4 = 14; [L589] int output = -1; VAL [a10=0, a12=0, a19=9, a1=23, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L592] COND TRUE 1 [L595] int input; [L596] EXPR input = __VERIFIER_nondet_int() [L597] COND FALSE, EXPR !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L600] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L385] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L435] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L440] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L452] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L458] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L475] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L481] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L486] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L491] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L497] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L503] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L509] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L514] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L519] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L527] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L533] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L536] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L539] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L544] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) VAL [\old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L550] COND TRUE ((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0))) [L551] a1 = (((((a1 + -272193) - -47605) - -570122) % 89)+ 110) [L552] a10 = 1 [L554] return 25; VAL [\old(input)=6, \result=25, a10=1, a12=0, a19=9, a1=169, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) [L600] EXPR output = calculate_output(input) [L593-L601] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a10=1, a12=0, a19=9, a1=169, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25] [L592] COND TRUE 1 [L595] int input; [L596] EXPR input = __VERIFIER_nondet_int() [L597] COND FALSE, EXPR !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L600] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L385] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L435] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L440] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L452] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L458] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [\old(input)=3, a10=1, a12=0, a19=9, a1=169, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND TRUE ((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0)))) [L471] a1 = (((a1 / 5) + 105416) + 61704) [L472] a10 = 4 [L474] return 24; VAL [\old(input)=3, \result=24, a10=4, a12=0, a19=9, a1=167153, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) [L600] EXPR output = calculate_output(input) [L593-L601] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a10=4, a12=0, a19=9, a1=167153, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=24] [L592] COND TRUE 1 [L595] int input; [L596] EXPR input = __VERIFIER_nondet_int() [L597] COND FALSE, EXPR !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L600] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(input)=5, a10=4, a12=0, a19=9, a1=167153, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND TRUE ((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0)) [L282] a1 = (((((a1 % 25)+ -8) * 5) % 25)+ 13) [L283] a10 = 1 [L284] a19 = 7 [L286] return -1; VAL [\old(input)=5, \result=-1, a10=1, a12=0, a19=7, a1=13, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) [L600] EXPR output = calculate_output(input) [L593-L601] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a10=1, a12=0, a19=7, a1=13, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L600] CALL calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=1, a12=0, a19=7, a1=13, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=1, a12=0, a19=7, a1=13, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=1, a12=0, a19=7, a1=13, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=1, a12=0, a19=7, a1=13, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=1, a12=0, a19=7, a1=13, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a10=1, a12=0, a19=7, a1=13, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a10=1, a12=0, a19=7, a1=13, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a10=1, a12=0, a19=7, a1=13, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND TRUE (((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)) VAL [\old(input)=5, a10=1, a12=0, a19=7, a1=13, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] reach_error() VAL [\old(input)=5, a10=1, a12=0, a19=7, a1=13, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.0s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1507 SdHoareTripleChecker+Valid, 9.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1507 mSDsluCounter, 1860 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 882 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6258 IncrementalHoareTripleChecker+Invalid, 7140 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 882 mSolverCounterUnsat, 1787 mSDtfsCounter, 6258 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1196 GetRequests, 1160 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4034occurred in iteration=16, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 1535 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 4696 NumberOfCodeBlocks, 4696 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 4335 ConstructedInterpolants, 0 QuantifiedInterpolants, 16850 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1639 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 20 InterpolantComputations, 16 PerfectInterpolantSequences, 2782/3317 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! [2023-11-26 11:48:52,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_469c1be2-27be-411f-b00e-c0b0aa71934d/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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