./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/toy.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e755ea4-31c1-441a-90d5-06b2b8721a6d/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e755ea4-31c1-441a-90d5-06b2b8721a6d/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e755ea4-31c1-441a-90d5-06b2b8721a6d/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e755ea4-31c1-441a-90d5-06b2b8721a6d/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/toy.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e755ea4-31c1-441a-90d5-06b2b8721a6d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e755ea4-31c1-441a-90d5-06b2b8721a6d/bin/uautomizer-verify-BQ2R08f2Ya --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 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:36:10,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:36:10,611 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e755ea4-31c1-441a-90d5-06b2b8721a6d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 00:36:10,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:36:10,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:36:10,643 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:36:10,644 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:36:10,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:36:10,645 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:36:10,646 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:36:10,647 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:36:10,647 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:36:10,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:36:10,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:36:10,649 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:36:10,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:36:10,650 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:36:10,651 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:36:10,651 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:36:10,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:36:10,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:36:10,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:36:10,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:36:10,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:36:10,654 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:36:10,655 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:36:10,655 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:36:10,656 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:36:10,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:36:10,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:36:10,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:36:10,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:36:10,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:36:10,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:36:10,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:36:10,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:36:10,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:36:10,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:36:10,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:36:10,660 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:36:10,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:36:10,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:36:10,661 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_2e755ea4-31c1-441a-90d5-06b2b8721a6d/bin/uautomizer-verify-BQ2R08f2Ya/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_2e755ea4-31c1-441a-90d5-06b2b8721a6d/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b [2023-11-29 00:36:10,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:36:10,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:36:10,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:36:10,940 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:36:10,941 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:36:10,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e755ea4-31c1-441a-90d5-06b2b8721a6d/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/systemc/toy.cil.c [2023-11-29 00:36:14,339 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:36:14,570 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:36:14,571 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e755ea4-31c1-441a-90d5-06b2b8721a6d/sv-benchmarks/c/systemc/toy.cil.c [2023-11-29 00:36:14,586 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e755ea4-31c1-441a-90d5-06b2b8721a6d/bin/uautomizer-verify-BQ2R08f2Ya/data/c9519748c/5ea2c54d072646bb8c829966ea17beb7/FLAG77c7b1681 [2023-11-29 00:36:14,605 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e755ea4-31c1-441a-90d5-06b2b8721a6d/bin/uautomizer-verify-BQ2R08f2Ya/data/c9519748c/5ea2c54d072646bb8c829966ea17beb7 [2023-11-29 00:36:14,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:36:14,610 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:36:14,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:36:14,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:36:14,620 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:36:14,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:36:14" (1/1) ... [2023-11-29 00:36:14,622 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9a634fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:14, skipping insertion in model container [2023-11-29 00:36:14,622 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:36:14" (1/1) ... [2023-11-29 00:36:14,675 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:36:14,864 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_2e755ea4-31c1-441a-90d5-06b2b8721a6d/sv-benchmarks/c/systemc/toy.cil.c[697,710] [2023-11-29 00:36:14,942 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:36:14,959 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:36:14,974 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_2e755ea4-31c1-441a-90d5-06b2b8721a6d/sv-benchmarks/c/systemc/toy.cil.c[697,710] [2023-11-29 00:36:15,015 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:36:15,036 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:36:15,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:15 WrapperNode [2023-11-29 00:36:15,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:36:15,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:36:15,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:36:15,039 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:36:15,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:15" (1/1) ... [2023-11-29 00:36:15,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:15" (1/1) ... [2023-11-29 00:36:15,097 INFO L138 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 366 [2023-11-29 00:36:15,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:36:15,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:36:15,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:36:15,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:36:15,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:15" (1/1) ... [2023-11-29 00:36:15,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:15" (1/1) ... [2023-11-29 00:36:15,116 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:15" (1/1) ... [2023-11-29 00:36:15,134 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-29 00:36:15,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:15" (1/1) ... [2023-11-29 00:36:15,135 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:15" (1/1) ... [2023-11-29 00:36:15,143 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:15" (1/1) ... [2023-11-29 00:36:15,152 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:15" (1/1) ... [2023-11-29 00:36:15,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:15" (1/1) ... [2023-11-29 00:36:15,157 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:15" (1/1) ... [2023-11-29 00:36:15,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:36:15,162 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:36:15,162 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:36:15,162 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:36:15,163 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:15" (1/1) ... [2023-11-29 00:36:15,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:36:15,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e755ea4-31c1-441a-90d5-06b2b8721a6d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:15,203 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e755ea4-31c1-441a-90d5-06b2b8721a6d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:36:15,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e755ea4-31c1-441a-90d5-06b2b8721a6d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:36:15,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:36:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:36:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:36:15,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:36:15,340 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:36:15,342 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:36:15,834 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:36:15,882 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:36:15,883 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-29 00:36:15,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:36:15 BoogieIcfgContainer [2023-11-29 00:36:15,884 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:36:15,888 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:36:15,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:36:15,892 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:36:15,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:36:14" (1/3) ... [2023-11-29 00:36:15,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d14f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:36:15, skipping insertion in model container [2023-11-29 00:36:15,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:15" (2/3) ... [2023-11-29 00:36:15,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d14f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:36:15, skipping insertion in model container [2023-11-29 00:36:15,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:36:15" (3/3) ... [2023-11-29 00:36:15,896 INFO L112 eAbstractionObserver]: Analyzing ICFG toy.cil.c [2023-11-29 00:36:15,921 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:36:15,922 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:36:15,977 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:36:15,984 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;@26820396, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:36:15,985 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:36:15,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 118 states have (on average 1.923728813559322) internal successors, (227), 119 states have internal predecessors, (227), 0 states have call successors, (0), 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-29 00:36:15,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 00:36:16,000 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:16,000 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:16,001 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:16,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:16,008 INFO L85 PathProgramCache]: Analyzing trace with hash 429979365, now seen corresponding path program 1 times [2023-11-29 00:36:16,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:16,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659474943] [2023-11-29 00:36:16,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:16,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:16,322 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-29 00:36:16,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:16,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659474943] [2023-11-29 00:36:16,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659474943] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:16,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:16,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:36:16,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469860734] [2023-11-29 00:36:16,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:16,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:16,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:16,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:16,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:16,372 INFO L87 Difference]: Start difference. First operand has 120 states, 118 states have (on average 1.923728813559322) internal successors, (227), 119 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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-29 00:36:16,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:16,440 INFO L93 Difference]: Finished difference Result 233 states and 442 transitions. [2023-11-29 00:36:16,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:16,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2023-11-29 00:36:16,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:16,456 INFO L225 Difference]: With dead ends: 233 [2023-11-29 00:36:16,456 INFO L226 Difference]: Without dead ends: 118 [2023-11-29 00:36:16,460 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-29 00:36:16,465 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 209 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:16,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 202 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:16,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-29 00:36:16,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-11-29 00:36:16,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.8034188034188035) internal successors, (211), 117 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:16,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 211 transitions. [2023-11-29 00:36:16,520 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 211 transitions. Word has length 33 [2023-11-29 00:36:16,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:16,520 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 211 transitions. [2023-11-29 00:36:16,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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-29 00:36:16,521 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 211 transitions. [2023-11-29 00:36:16,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 00:36:16,523 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:16,523 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:16,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:36:16,524 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:16,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:16,525 INFO L85 PathProgramCache]: Analyzing trace with hash -956224029, now seen corresponding path program 1 times [2023-11-29 00:36:16,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:16,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876212248] [2023-11-29 00:36:16,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:16,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:16,642 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-29 00:36:16,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:16,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876212248] [2023-11-29 00:36:16,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876212248] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:16,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:16,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:16,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488142716] [2023-11-29 00:36:16,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:16,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:16,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:16,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:16,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:16,647 INFO L87 Difference]: Start difference. First operand 118 states and 211 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-29 00:36:16,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:16,742 INFO L93 Difference]: Finished difference Result 318 states and 567 transitions. [2023-11-29 00:36:16,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:16,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2023-11-29 00:36:16,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:16,746 INFO L225 Difference]: With dead ends: 318 [2023-11-29 00:36:16,746 INFO L226 Difference]: Without dead ends: 202 [2023-11-29 00:36:16,748 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-29 00:36:16,749 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 550 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:16,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 337 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:16,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-11-29 00:36:16,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2023-11-29 00:36:16,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.7839195979899498) internal successors, (355), 199 states have internal predecessors, (355), 0 states have call successors, (0), 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-29 00:36:16,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 355 transitions. [2023-11-29 00:36:16,777 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 355 transitions. Word has length 33 [2023-11-29 00:36:16,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:16,778 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 355 transitions. [2023-11-29 00:36:16,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-29 00:36:16,779 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 355 transitions. [2023-11-29 00:36:16,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 00:36:16,781 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:16,781 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:16,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:36:16,781 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:16,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:16,782 INFO L85 PathProgramCache]: Analyzing trace with hash 967004005, now seen corresponding path program 1 times [2023-11-29 00:36:16,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:16,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279177914] [2023-11-29 00:36:16,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:16,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:16,922 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-29 00:36:16,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:16,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279177914] [2023-11-29 00:36:16,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279177914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:16,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:16,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:36:16,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302378591] [2023-11-29 00:36:16,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:16,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:16,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:16,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:16,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:16,925 INFO L87 Difference]: Start difference. First operand 200 states and 355 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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-29 00:36:16,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:16,984 INFO L93 Difference]: Finished difference Result 392 states and 698 transitions. [2023-11-29 00:36:16,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:16,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2023-11-29 00:36:16,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:16,987 INFO L225 Difference]: With dead ends: 392 [2023-11-29 00:36:16,987 INFO L226 Difference]: Without dead ends: 200 [2023-11-29 00:36:16,989 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-29 00:36:16,991 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 181 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:16,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 185 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:16,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-11-29 00:36:17,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2023-11-29 00:36:17,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.7236180904522613) internal successors, (343), 199 states have internal predecessors, (343), 0 states have call successors, (0), 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-29 00:36:17,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 343 transitions. [2023-11-29 00:36:17,015 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 343 transitions. Word has length 33 [2023-11-29 00:36:17,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:17,016 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 343 transitions. [2023-11-29 00:36:17,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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-29 00:36:17,016 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 343 transitions. [2023-11-29 00:36:17,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 00:36:17,018 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:17,018 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:17,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:36:17,019 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:17,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:17,020 INFO L85 PathProgramCache]: Analyzing trace with hash 17926369, now seen corresponding path program 1 times [2023-11-29 00:36:17,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:17,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827698281] [2023-11-29 00:36:17,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:17,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:17,088 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-29 00:36:17,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:17,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827698281] [2023-11-29 00:36:17,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827698281] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:17,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:17,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:17,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098309964] [2023-11-29 00:36:17,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:17,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:17,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:17,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:17,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:17,092 INFO L87 Difference]: Start difference. First operand 200 states and 343 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-29 00:36:17,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:17,227 INFO L93 Difference]: Finished difference Result 543 states and 934 transitions. [2023-11-29 00:36:17,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:17,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2023-11-29 00:36:17,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:17,231 INFO L225 Difference]: With dead ends: 543 [2023-11-29 00:36:17,232 INFO L226 Difference]: Without dead ends: 352 [2023-11-29 00:36:17,233 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-29 00:36:17,235 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 353 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:17,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 409 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:36:17,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2023-11-29 00:36:17,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 200. [2023-11-29 00:36:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.7085427135678393) internal successors, (340), 199 states have internal predecessors, (340), 0 states have call successors, (0), 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-29 00:36:17,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 340 transitions. [2023-11-29 00:36:17,258 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 340 transitions. Word has length 33 [2023-11-29 00:36:17,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:17,258 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 340 transitions. [2023-11-29 00:36:17,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-29 00:36:17,259 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 340 transitions. [2023-11-29 00:36:17,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 00:36:17,260 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:17,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:17,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:36:17,261 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:17,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:17,262 INFO L85 PathProgramCache]: Analyzing trace with hash 158474979, now seen corresponding path program 1 times [2023-11-29 00:36:17,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:17,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284130976] [2023-11-29 00:36:17,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:17,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:17,319 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-29 00:36:17,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:17,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284130976] [2023-11-29 00:36:17,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284130976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:17,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:17,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:17,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434562651] [2023-11-29 00:36:17,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:17,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:17,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:17,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:17,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:17,323 INFO L87 Difference]: Start difference. First operand 200 states and 340 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-29 00:36:17,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:17,448 INFO L93 Difference]: Finished difference Result 546 states and 930 transitions. [2023-11-29 00:36:17,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:17,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2023-11-29 00:36:17,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:17,452 INFO L225 Difference]: With dead ends: 546 [2023-11-29 00:36:17,452 INFO L226 Difference]: Without dead ends: 356 [2023-11-29 00:36:17,453 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-29 00:36:17,455 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 352 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:17,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 419 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:36:17,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2023-11-29 00:36:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 200. [2023-11-29 00:36:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.693467336683417) internal successors, (337), 199 states have internal predecessors, (337), 0 states have call successors, (0), 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-29 00:36:17,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 337 transitions. [2023-11-29 00:36:17,476 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 337 transitions. Word has length 33 [2023-11-29 00:36:17,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:17,476 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 337 transitions. [2023-11-29 00:36:17,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-29 00:36:17,476 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 337 transitions. [2023-11-29 00:36:17,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 00:36:17,478 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:17,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:17,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:36:17,479 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:17,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:17,479 INFO L85 PathProgramCache]: Analyzing trace with hash 24461473, now seen corresponding path program 1 times [2023-11-29 00:36:17,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:17,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167155383] [2023-11-29 00:36:17,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:17,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:17,540 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-29 00:36:17,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:17,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167155383] [2023-11-29 00:36:17,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167155383] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:17,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:17,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:17,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746339170] [2023-11-29 00:36:17,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:17,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:17,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:17,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:17,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:17,544 INFO L87 Difference]: Start difference. First operand 200 states and 337 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-29 00:36:17,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:17,676 INFO L93 Difference]: Finished difference Result 558 states and 941 transitions. [2023-11-29 00:36:17,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:17,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2023-11-29 00:36:17,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:17,680 INFO L225 Difference]: With dead ends: 558 [2023-11-29 00:36:17,680 INFO L226 Difference]: Without dead ends: 369 [2023-11-29 00:36:17,681 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-29 00:36:17,682 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 357 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:17,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 424 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:36:17,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2023-11-29 00:36:17,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 206. [2023-11-29 00:36:17,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.6634146341463414) internal successors, (341), 205 states have internal predecessors, (341), 0 states have call successors, (0), 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-29 00:36:17,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 341 transitions. [2023-11-29 00:36:17,723 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 341 transitions. Word has length 33 [2023-11-29 00:36:17,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:17,724 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 341 transitions. [2023-11-29 00:36:17,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-29 00:36:17,724 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 341 transitions. [2023-11-29 00:36:17,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 00:36:17,726 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:17,726 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:17,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:36:17,727 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:17,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:17,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1780976861, now seen corresponding path program 1 times [2023-11-29 00:36:17,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:17,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979103076] [2023-11-29 00:36:17,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:17,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:17,799 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-29 00:36:17,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:17,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979103076] [2023-11-29 00:36:17,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979103076] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:17,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:17,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:17,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038338048] [2023-11-29 00:36:17,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:17,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:17,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:17,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:17,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:17,802 INFO L87 Difference]: Start difference. First operand 206 states and 341 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-29 00:36:17,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:17,961 INFO L93 Difference]: Finished difference Result 700 states and 1160 transitions. [2023-11-29 00:36:17,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:17,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2023-11-29 00:36:17,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:17,966 INFO L225 Difference]: With dead ends: 700 [2023-11-29 00:36:17,966 INFO L226 Difference]: Without dead ends: 506 [2023-11-29 00:36:17,967 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-29 00:36:17,968 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 353 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:17,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 506 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:36:17,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2023-11-29 00:36:17,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 336. [2023-11-29 00:36:18,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 1.6507462686567165) internal successors, (553), 335 states have internal predecessors, (553), 0 states have call successors, (0), 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-29 00:36:18,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 553 transitions. [2023-11-29 00:36:18,004 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 553 transitions. Word has length 33 [2023-11-29 00:36:18,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:18,004 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 553 transitions. [2023-11-29 00:36:18,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-29 00:36:18,005 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 553 transitions. [2023-11-29 00:36:18,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 00:36:18,006 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:18,006 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:18,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:36:18,007 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:18,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:18,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1562122143, now seen corresponding path program 1 times [2023-11-29 00:36:18,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:18,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514594606] [2023-11-29 00:36:18,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:18,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:18,058 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-29 00:36:18,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:18,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514594606] [2023-11-29 00:36:18,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514594606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:18,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:18,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:36:18,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83996087] [2023-11-29 00:36:18,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:18,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:18,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:18,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:18,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:18,062 INFO L87 Difference]: Start difference. First operand 336 states and 553 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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-29 00:36:18,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:18,151 INFO L93 Difference]: Finished difference Result 800 states and 1323 transitions. [2023-11-29 00:36:18,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:18,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2023-11-29 00:36:18,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:18,156 INFO L225 Difference]: With dead ends: 800 [2023-11-29 00:36:18,156 INFO L226 Difference]: Without dead ends: 487 [2023-11-29 00:36:18,157 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-29 00:36:18,158 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 169 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:18,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 308 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:18,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2023-11-29 00:36:18,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 485. [2023-11-29 00:36:18,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 1.6487603305785123) internal successors, (798), 484 states have internal predecessors, (798), 0 states have call successors, (0), 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-29 00:36:18,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 798 transitions. [2023-11-29 00:36:18,204 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 798 transitions. Word has length 33 [2023-11-29 00:36:18,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:18,205 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 798 transitions. [2023-11-29 00:36:18,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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-29 00:36:18,205 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 798 transitions. [2023-11-29 00:36:18,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 00:36:18,206 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:18,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:18,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:36:18,206 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:18,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:18,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1969942237, now seen corresponding path program 1 times [2023-11-29 00:36:18,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:18,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379160351] [2023-11-29 00:36:18,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:18,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:18,265 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-29 00:36:18,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:18,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379160351] [2023-11-29 00:36:18,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379160351] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:18,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:18,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:18,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451612398] [2023-11-29 00:36:18,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:18,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:18,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:18,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:18,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:18,268 INFO L87 Difference]: Start difference. First operand 485 states and 798 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-29 00:36:18,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:18,406 INFO L93 Difference]: Finished difference Result 1236 states and 2034 transitions. [2023-11-29 00:36:18,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:18,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2023-11-29 00:36:18,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:18,414 INFO L225 Difference]: With dead ends: 1236 [2023-11-29 00:36:18,414 INFO L226 Difference]: Without dead ends: 767 [2023-11-29 00:36:18,415 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-29 00:36:18,416 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 462 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:18,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 296 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:36:18,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2023-11-29 00:36:18,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 485. [2023-11-29 00:36:18,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 1.6322314049586777) internal successors, (790), 484 states have internal predecessors, (790), 0 states have call successors, (0), 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-29 00:36:18,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 790 transitions. [2023-11-29 00:36:18,475 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 790 transitions. Word has length 33 [2023-11-29 00:36:18,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:18,475 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 790 transitions. [2023-11-29 00:36:18,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-29 00:36:18,476 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 790 transitions. [2023-11-29 00:36:18,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 00:36:18,476 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:18,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:18,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:36:18,477 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:18,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:18,478 INFO L85 PathProgramCache]: Analyzing trace with hash 690078559, now seen corresponding path program 1 times [2023-11-29 00:36:18,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:18,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37593693] [2023-11-29 00:36:18,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:18,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:18,534 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-29 00:36:18,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:18,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37593693] [2023-11-29 00:36:18,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37593693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:18,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:18,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:18,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289290918] [2023-11-29 00:36:18,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:18,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:18,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:18,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:18,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:18,537 INFO L87 Difference]: Start difference. First operand 485 states and 790 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-29 00:36:18,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:18,714 INFO L93 Difference]: Finished difference Result 1232 states and 2007 transitions. [2023-11-29 00:36:18,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:18,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2023-11-29 00:36:18,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:18,720 INFO L225 Difference]: With dead ends: 1232 [2023-11-29 00:36:18,720 INFO L226 Difference]: Without dead ends: 769 [2023-11-29 00:36:18,721 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-29 00:36:18,722 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 444 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:18,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 285 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:36:18,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2023-11-29 00:36:18,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 485. [2023-11-29 00:36:18,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 1.615702479338843) internal successors, (782), 484 states have internal predecessors, (782), 0 states have call successors, (0), 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-29 00:36:18,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 782 transitions. [2023-11-29 00:36:18,774 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 782 transitions. Word has length 33 [2023-11-29 00:36:18,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:18,774 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 782 transitions. [2023-11-29 00:36:18,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-29 00:36:18,775 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 782 transitions. [2023-11-29 00:36:18,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 00:36:18,776 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:18,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:18,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:36:18,776 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:18,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:18,777 INFO L85 PathProgramCache]: Analyzing trace with hash 103272545, now seen corresponding path program 1 times [2023-11-29 00:36:18,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:18,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373474275] [2023-11-29 00:36:18,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:18,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:18,823 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-29 00:36:18,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:18,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373474275] [2023-11-29 00:36:18,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373474275] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:18,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:18,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:18,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981827177] [2023-11-29 00:36:18,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:18,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:18,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:18,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:18,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:18,826 INFO L87 Difference]: Start difference. First operand 485 states and 782 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-29 00:36:18,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:18,977 INFO L93 Difference]: Finished difference Result 1174 states and 1888 transitions. [2023-11-29 00:36:18,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:18,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2023-11-29 00:36:18,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:18,983 INFO L225 Difference]: With dead ends: 1174 [2023-11-29 00:36:18,984 INFO L226 Difference]: Without dead ends: 705 [2023-11-29 00:36:18,985 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-29 00:36:18,985 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 456 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:18,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 315 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:36:18,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2023-11-29 00:36:19,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 533. [2023-11-29 00:36:19,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 532 states have (on average 1.5770676691729324) internal successors, (839), 532 states have internal predecessors, (839), 0 states have call successors, (0), 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-29 00:36:19,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 839 transitions. [2023-11-29 00:36:19,043 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 839 transitions. Word has length 33 [2023-11-29 00:36:19,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:19,044 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 839 transitions. [2023-11-29 00:36:19,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-29 00:36:19,044 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 839 transitions. [2023-11-29 00:36:19,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 00:36:19,045 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:19,045 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:19,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:36:19,045 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:19,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:19,046 INFO L85 PathProgramCache]: Analyzing trace with hash 804337123, now seen corresponding path program 1 times [2023-11-29 00:36:19,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:19,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106991044] [2023-11-29 00:36:19,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:19,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:19,080 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-29 00:36:19,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:19,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106991044] [2023-11-29 00:36:19,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106991044] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:19,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:19,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:36:19,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734528716] [2023-11-29 00:36:19,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:19,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:19,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:19,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:19,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:19,084 INFO L87 Difference]: Start difference. First operand 533 states and 839 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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-29 00:36:19,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:19,203 INFO L93 Difference]: Finished difference Result 1268 states and 2000 transitions. [2023-11-29 00:36:19,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:19,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2023-11-29 00:36:19,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:19,208 INFO L225 Difference]: With dead ends: 1268 [2023-11-29 00:36:19,208 INFO L226 Difference]: Without dead ends: 748 [2023-11-29 00:36:19,209 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-29 00:36:19,210 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 113 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:19,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 279 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:36:19,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2023-11-29 00:36:19,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 745. [2023-11-29 00:36:19,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 744 states have (on average 1.5564516129032258) internal successors, (1158), 744 states have internal predecessors, (1158), 0 states have call successors, (0), 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-29 00:36:19,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1158 transitions. [2023-11-29 00:36:19,252 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1158 transitions. Word has length 33 [2023-11-29 00:36:19,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:19,253 INFO L495 AbstractCegarLoop]: Abstraction has 745 states and 1158 transitions. [2023-11-29 00:36:19,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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-29 00:36:19,253 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1158 transitions. [2023-11-29 00:36:19,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 00:36:19,253 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:19,254 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 00:36:19,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 00:36:19,254 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:19,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:19,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2120894212, now seen corresponding path program 1 times [2023-11-29 00:36:19,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:19,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658904901] [2023-11-29 00:36:19,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:19,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:19,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:19,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:19,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658904901] [2023-11-29 00:36:19,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658904901] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:19,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:19,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:19,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843073895] [2023-11-29 00:36:19,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:19,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:19,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:19,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:19,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:19,287 INFO L87 Difference]: Start difference. First operand 745 states and 1158 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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-29 00:36:19,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:19,392 INFO L93 Difference]: Finished difference Result 1827 states and 2884 transitions. [2023-11-29 00:36:19,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:19,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2023-11-29 00:36:19,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:19,399 INFO L225 Difference]: With dead ends: 1827 [2023-11-29 00:36:19,399 INFO L226 Difference]: Without dead ends: 1108 [2023-11-29 00:36:19,400 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-29 00:36:19,401 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 74 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:19,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 369 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:19,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2023-11-29 00:36:19,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1106. [2023-11-29 00:36:19,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 1105 states have (on average 1.5737556561085972) internal successors, (1739), 1105 states have internal predecessors, (1739), 0 states have call successors, (0), 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-29 00:36:19,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1739 transitions. [2023-11-29 00:36:19,466 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1739 transitions. Word has length 44 [2023-11-29 00:36:19,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:19,467 INFO L495 AbstractCegarLoop]: Abstraction has 1106 states and 1739 transitions. [2023-11-29 00:36:19,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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-29 00:36:19,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1739 transitions. [2023-11-29 00:36:19,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 00:36:19,468 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:19,468 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 00:36:19,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 00:36:19,468 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:19,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:19,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1697247490, now seen corresponding path program 1 times [2023-11-29 00:36:19,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:19,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555206969] [2023-11-29 00:36:19,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:19,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:19,516 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 00:36:19,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:19,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555206969] [2023-11-29 00:36:19,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555206969] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:19,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:19,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:36:19,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615080151] [2023-11-29 00:36:19,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:19,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:19,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:19,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:19,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:19,518 INFO L87 Difference]: Start difference. First operand 1106 states and 1739 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 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-29 00:36:19,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:19,625 INFO L93 Difference]: Finished difference Result 2164 states and 3420 transitions. [2023-11-29 00:36:19,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:19,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 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 44 [2023-11-29 00:36:19,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:19,633 INFO L225 Difference]: With dead ends: 2164 [2023-11-29 00:36:19,634 INFO L226 Difference]: Without dead ends: 1084 [2023-11-29 00:36:19,635 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-29 00:36:19,636 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 171 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:19,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 164 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:19,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2023-11-29 00:36:19,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1084. [2023-11-29 00:36:19,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1083 states have (on average 1.5807940904893814) internal successors, (1712), 1083 states have internal predecessors, (1712), 0 states have call successors, (0), 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-29 00:36:19,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1712 transitions. [2023-11-29 00:36:19,746 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1712 transitions. Word has length 44 [2023-11-29 00:36:19,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:19,746 INFO L495 AbstractCegarLoop]: Abstraction has 1084 states and 1712 transitions. [2023-11-29 00:36:19,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 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-29 00:36:19,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1712 transitions. [2023-11-29 00:36:19,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 00:36:19,748 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:19,748 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 00:36:19,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 00:36:19,748 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:19,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:19,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1821048159, now seen corresponding path program 1 times [2023-11-29 00:36:19,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:19,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969030127] [2023-11-29 00:36:19,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:19,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:19,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:19,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:19,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969030127] [2023-11-29 00:36:19,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969030127] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:19,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:19,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:19,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507990076] [2023-11-29 00:36:19,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:19,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:19,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:19,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:19,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:19,789 INFO L87 Difference]: Start difference. First operand 1084 states and 1712 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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-29 00:36:19,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:19,947 INFO L93 Difference]: Finished difference Result 2745 states and 4400 transitions. [2023-11-29 00:36:19,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:19,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2023-11-29 00:36:19,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:19,956 INFO L225 Difference]: With dead ends: 2745 [2023-11-29 00:36:19,956 INFO L226 Difference]: Without dead ends: 1687 [2023-11-29 00:36:19,958 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-29 00:36:19,958 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 75 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:19,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 289 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:19,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2023-11-29 00:36:20,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1685. [2023-11-29 00:36:20,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1685 states, 1684 states have (on average 1.597980997624703) internal successors, (2691), 1684 states have internal predecessors, (2691), 0 states have call successors, (0), 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-29 00:36:20,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 2691 transitions. [2023-11-29 00:36:20,048 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 2691 transitions. Word has length 45 [2023-11-29 00:36:20,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:20,048 INFO L495 AbstractCegarLoop]: Abstraction has 1685 states and 2691 transitions. [2023-11-29 00:36:20,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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-29 00:36:20,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 2691 transitions. [2023-11-29 00:36:20,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 00:36:20,050 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:20,050 INFO L195 NwaCegarLoop]: trace histogram [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-29 00:36:20,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 00:36:20,050 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:20,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:20,051 INFO L85 PathProgramCache]: Analyzing trace with hash -792218992, now seen corresponding path program 1 times [2023-11-29 00:36:20,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:20,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079091300] [2023-11-29 00:36:20,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:20,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:20,080 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:20,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:20,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079091300] [2023-11-29 00:36:20,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079091300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:20,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:20,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:20,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306542125] [2023-11-29 00:36:20,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:20,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:20,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:20,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:20,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:20,083 INFO L87 Difference]: Start difference. First operand 1685 states and 2691 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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-29 00:36:20,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:20,304 INFO L93 Difference]: Finished difference Result 4551 states and 7352 transitions. [2023-11-29 00:36:20,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:20,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2023-11-29 00:36:20,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:20,323 INFO L225 Difference]: With dead ends: 4551 [2023-11-29 00:36:20,324 INFO L226 Difference]: Without dead ends: 2893 [2023-11-29 00:36:20,327 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-29 00:36:20,327 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 80 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:20,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 346 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:20,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2023-11-29 00:36:20,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 2891. [2023-11-29 00:36:20,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2891 states, 2890 states have (on average 1.6079584775086506) internal successors, (4647), 2890 states have internal predecessors, (4647), 0 states have call successors, (0), 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-29 00:36:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2891 states to 2891 states and 4647 transitions. [2023-11-29 00:36:20,545 INFO L78 Accepts]: Start accepts. Automaton has 2891 states and 4647 transitions. Word has length 46 [2023-11-29 00:36:20,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:20,545 INFO L495 AbstractCegarLoop]: Abstraction has 2891 states and 4647 transitions. [2023-11-29 00:36:20,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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-29 00:36:20,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 4647 transitions. [2023-11-29 00:36:20,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 00:36:20,547 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:20,547 INFO L195 NwaCegarLoop]: trace histogram [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-29 00:36:20,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 00:36:20,548 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:20,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:20,548 INFO L85 PathProgramCache]: Analyzing trace with hash -368572270, now seen corresponding path program 1 times [2023-11-29 00:36:20,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:20,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056527843] [2023-11-29 00:36:20,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:20,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:20,569 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 00:36:20,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:20,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056527843] [2023-11-29 00:36:20,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056527843] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:20,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:20,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:36:20,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765701731] [2023-11-29 00:36:20,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:20,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:20,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:20,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:20,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:20,573 INFO L87 Difference]: Start difference. First operand 2891 states and 4647 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 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-29 00:36:20,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:20,736 INFO L93 Difference]: Finished difference Result 5734 states and 9238 transitions. [2023-11-29 00:36:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:20,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 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 46 [2023-11-29 00:36:20,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:20,751 INFO L225 Difference]: With dead ends: 5734 [2023-11-29 00:36:20,751 INFO L226 Difference]: Without dead ends: 2870 [2023-11-29 00:36:20,754 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-29 00:36:20,754 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 168 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:20,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 163 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:20,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2870 states. [2023-11-29 00:36:20,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2870 to 2870. [2023-11-29 00:36:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2870 states, 2869 states have (on average 1.6110142906936216) internal successors, (4622), 2869 states have internal predecessors, (4622), 0 states have call successors, (0), 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-29 00:36:20,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2870 states to 2870 states and 4622 transitions. [2023-11-29 00:36:20,920 INFO L78 Accepts]: Start accepts. Automaton has 2870 states and 4622 transitions. Word has length 46 [2023-11-29 00:36:20,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:20,920 INFO L495 AbstractCegarLoop]: Abstraction has 2870 states and 4622 transitions. [2023-11-29 00:36:20,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 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-29 00:36:20,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2870 states and 4622 transitions. [2023-11-29 00:36:20,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 00:36:20,922 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:20,922 INFO L195 NwaCegarLoop]: trace histogram [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-29 00:36:20,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 00:36:20,923 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:20,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:20,923 INFO L85 PathProgramCache]: Analyzing trace with hash 77319437, now seen corresponding path program 1 times [2023-11-29 00:36:20,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:20,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644012062] [2023-11-29 00:36:20,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:20,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:20,985 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:20,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:20,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644012062] [2023-11-29 00:36:20,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644012062] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:20,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:20,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:20,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136232130] [2023-11-29 00:36:20,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:20,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:20,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:20,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:20,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:20,987 INFO L87 Difference]: Start difference. First operand 2870 states and 4622 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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-29 00:36:21,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:21,363 INFO L93 Difference]: Finished difference Result 7299 states and 11787 transitions. [2023-11-29 00:36:21,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:36:21,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2023-11-29 00:36:21,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:21,389 INFO L225 Difference]: With dead ends: 7299 [2023-11-29 00:36:21,389 INFO L226 Difference]: Without dead ends: 3744 [2023-11-29 00:36:21,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-29 00:36:21,395 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 380 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:21,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 272 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:36:21,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states. [2023-11-29 00:36:21,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 3744. [2023-11-29 00:36:21,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3744 states, 3743 states have (on average 1.598984771573604) internal successors, (5985), 3743 states have internal predecessors, (5985), 0 states have call successors, (0), 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-29 00:36:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 5985 transitions. [2023-11-29 00:36:21,760 INFO L78 Accepts]: Start accepts. Automaton has 3744 states and 5985 transitions. Word has length 47 [2023-11-29 00:36:21,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:21,760 INFO L495 AbstractCegarLoop]: Abstraction has 3744 states and 5985 transitions. [2023-11-29 00:36:21,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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-29 00:36:21,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 5985 transitions. [2023-11-29 00:36:21,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 00:36:21,763 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:21,763 INFO L195 NwaCegarLoop]: trace histogram [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-29 00:36:21,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 00:36:21,763 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:21,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:21,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1631486923, now seen corresponding path program 1 times [2023-11-29 00:36:21,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:21,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369002777] [2023-11-29 00:36:21,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:21,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:21,838 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:21,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:21,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369002777] [2023-11-29 00:36:21,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369002777] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:21,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:21,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:21,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643666495] [2023-11-29 00:36:21,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:21,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:36:21,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:21,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:36:21,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:21,841 INFO L87 Difference]: Start difference. First operand 3744 states and 5985 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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-29 00:36:22,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:22,378 INFO L93 Difference]: Finished difference Result 9546 states and 15152 transitions. [2023-11-29 00:36:22,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:36:22,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2023-11-29 00:36:22,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:22,422 INFO L225 Difference]: With dead ends: 9546 [2023-11-29 00:36:22,422 INFO L226 Difference]: Without dead ends: 5823 [2023-11-29 00:36:22,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:36:22,429 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 648 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:22,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 455 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:36:22,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5823 states. [2023-11-29 00:36:22,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5823 to 4380. [2023-11-29 00:36:22,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4380 states, 4379 states have (on average 1.5626855446448962) internal successors, (6843), 4379 states have internal predecessors, (6843), 0 states have call successors, (0), 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-29 00:36:22,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4380 states to 4380 states and 6843 transitions. [2023-11-29 00:36:22,904 INFO L78 Accepts]: Start accepts. Automaton has 4380 states and 6843 transitions. Word has length 52 [2023-11-29 00:36:22,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:22,904 INFO L495 AbstractCegarLoop]: Abstraction has 4380 states and 6843 transitions. [2023-11-29 00:36:22,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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-29 00:36:22,904 INFO L276 IsEmpty]: Start isEmpty. Operand 4380 states and 6843 transitions. [2023-11-29 00:36:22,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-29 00:36:22,910 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:22,910 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-29 00:36:22,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 00:36:22,911 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:22,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:22,911 INFO L85 PathProgramCache]: Analyzing trace with hash -690807175, now seen corresponding path program 1 times [2023-11-29 00:36:22,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:22,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67874244] [2023-11-29 00:36:22,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:22,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:22,966 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:22,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:22,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67874244] [2023-11-29 00:36:22,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67874244] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:22,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:22,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:22,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278089418] [2023-11-29 00:36:22,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:22,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:22,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:22,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:22,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:22,970 INFO L87 Difference]: Start difference. First operand 4380 states and 6843 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:23,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:23,373 INFO L93 Difference]: Finished difference Result 9072 states and 14141 transitions. [2023-11-29 00:36:23,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:23,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2023-11-29 00:36:23,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:23,386 INFO L225 Difference]: With dead ends: 9072 [2023-11-29 00:36:23,386 INFO L226 Difference]: Without dead ends: 4719 [2023-11-29 00:36:23,391 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-29 00:36:23,392 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 122 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:23,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 274 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:23,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4719 states. [2023-11-29 00:36:23,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4719 to 4703. [2023-11-29 00:36:23,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4703 states, 4702 states have (on average 1.5089323692045937) internal successors, (7095), 4702 states have internal predecessors, (7095), 0 states have call successors, (0), 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-29 00:36:23,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4703 states to 4703 states and 7095 transitions. [2023-11-29 00:36:23,855 INFO L78 Accepts]: Start accepts. Automaton has 4703 states and 7095 transitions. Word has length 83 [2023-11-29 00:36:23,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:23,855 INFO L495 AbstractCegarLoop]: Abstraction has 4703 states and 7095 transitions. [2023-11-29 00:36:23,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:23,855 INFO L276 IsEmpty]: Start isEmpty. Operand 4703 states and 7095 transitions. [2023-11-29 00:36:23,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-29 00:36:23,860 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:23,860 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-29 00:36:23,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 00:36:23,861 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:23,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:23,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2010245170, now seen corresponding path program 1 times [2023-11-29 00:36:23,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:23,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831846144] [2023-11-29 00:36:23,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:23,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:23,898 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:23,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:23,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831846144] [2023-11-29 00:36:23,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831846144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:23,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:23,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:23,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811368367] [2023-11-29 00:36:23,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:23,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:23,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:23,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:23,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:23,901 INFO L87 Difference]: Start difference. First operand 4703 states and 7095 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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-29 00:36:24,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:24,338 INFO L93 Difference]: Finished difference Result 9870 states and 14851 transitions. [2023-11-29 00:36:24,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:24,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2023-11-29 00:36:24,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:24,351 INFO L225 Difference]: With dead ends: 9870 [2023-11-29 00:36:24,351 INFO L226 Difference]: Without dead ends: 5205 [2023-11-29 00:36:24,357 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-29 00:36:24,358 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 120 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:24,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 273 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:24,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5205 states. [2023-11-29 00:36:24,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5205 to 5181. [2023-11-29 00:36:24,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5181 states, 5180 states have (on average 1.455984555984556) internal successors, (7542), 5180 states have internal predecessors, (7542), 0 states have call successors, (0), 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-29 00:36:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5181 states to 5181 states and 7542 transitions. [2023-11-29 00:36:24,910 INFO L78 Accepts]: Start accepts. Automaton has 5181 states and 7542 transitions. Word has length 84 [2023-11-29 00:36:24,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:24,911 INFO L495 AbstractCegarLoop]: Abstraction has 5181 states and 7542 transitions. [2023-11-29 00:36:24,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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-29 00:36:24,912 INFO L276 IsEmpty]: Start isEmpty. Operand 5181 states and 7542 transitions. [2023-11-29 00:36:24,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 00:36:24,920 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:24,920 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-29 00:36:24,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 00:36:24,920 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:24,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:24,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1399303287, now seen corresponding path program 1 times [2023-11-29 00:36:24,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:24,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502111315] [2023-11-29 00:36:24,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:24,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:24,974 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:24,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:24,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502111315] [2023-11-29 00:36:24,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502111315] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:24,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:24,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:24,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134518047] [2023-11-29 00:36:24,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:24,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:24,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:24,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:24,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:24,977 INFO L87 Difference]: Start difference. First operand 5181 states and 7542 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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-29 00:36:25,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:25,486 INFO L93 Difference]: Finished difference Result 10679 states and 15545 transitions. [2023-11-29 00:36:25,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:25,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2023-11-29 00:36:25,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:25,498 INFO L225 Difference]: With dead ends: 10679 [2023-11-29 00:36:25,498 INFO L226 Difference]: Without dead ends: 5554 [2023-11-29 00:36:25,505 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-29 00:36:25,506 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 115 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:25,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 274 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:25,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5554 states. [2023-11-29 00:36:25,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5554 to 4968. [2023-11-29 00:36:25,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4968 states, 4967 states have (on average 1.3917857861888463) internal successors, (6913), 4967 states have internal predecessors, (6913), 0 states have call successors, (0), 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-29 00:36:25,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4968 states to 4968 states and 6913 transitions. [2023-11-29 00:36:25,901 INFO L78 Accepts]: Start accepts. Automaton has 4968 states and 6913 transitions. Word has length 85 [2023-11-29 00:36:25,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:25,901 INFO L495 AbstractCegarLoop]: Abstraction has 4968 states and 6913 transitions. [2023-11-29 00:36:25,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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-29 00:36:25,901 INFO L276 IsEmpty]: Start isEmpty. Operand 4968 states and 6913 transitions. [2023-11-29 00:36:25,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 00:36:25,908 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:25,908 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-29 00:36:25,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 00:36:25,909 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:25,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:25,909 INFO L85 PathProgramCache]: Analyzing trace with hash 2120377808, now seen corresponding path program 1 times [2023-11-29 00:36:25,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:25,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120139709] [2023-11-29 00:36:25,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:25,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:25,995 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 00:36:25,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:25,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120139709] [2023-11-29 00:36:25,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120139709] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:25,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:25,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:25,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056226894] [2023-11-29 00:36:25,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:25,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:25,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:25,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:25,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:25,997 INFO L87 Difference]: Start difference. First operand 4968 states and 6913 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 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-29 00:36:26,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:26,561 INFO L93 Difference]: Finished difference Result 9264 states and 12829 transitions. [2023-11-29 00:36:26,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:36:26,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 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-29 00:36:26,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:26,574 INFO L225 Difference]: With dead ends: 9264 [2023-11-29 00:36:26,574 INFO L226 Difference]: Without dead ends: 4783 [2023-11-29 00:36:26,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-29 00:36:26,580 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 420 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:26,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 341 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:36:26,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4783 states. [2023-11-29 00:36:26,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4783 to 4685. [2023-11-29 00:36:26,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4685 states, 4684 states have (on average 1.339666951323655) internal successors, (6275), 4684 states have internal predecessors, (6275), 0 states have call successors, (0), 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-29 00:36:26,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4685 states to 4685 states and 6275 transitions. [2023-11-29 00:36:26,968 INFO L78 Accepts]: Start accepts. Automaton has 4685 states and 6275 transitions. Word has length 86 [2023-11-29 00:36:26,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:26,968 INFO L495 AbstractCegarLoop]: Abstraction has 4685 states and 6275 transitions. [2023-11-29 00:36:26,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 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-29 00:36:26,969 INFO L276 IsEmpty]: Start isEmpty. Operand 4685 states and 6275 transitions. [2023-11-29 00:36:26,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 00:36:26,982 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:26,982 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 00:36:26,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 00:36:26,982 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:26,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:26,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1702675469, now seen corresponding path program 1 times [2023-11-29 00:36:26,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:26,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096811290] [2023-11-29 00:36:26,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:26,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:27,030 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-29 00:36:27,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:27,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096811290] [2023-11-29 00:36:27,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096811290] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:27,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:27,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:36:27,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78670423] [2023-11-29 00:36:27,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:27,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:27,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:27,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:27,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:27,032 INFO L87 Difference]: Start difference. First operand 4685 states and 6275 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 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-29 00:36:27,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:27,397 INFO L93 Difference]: Finished difference Result 8925 states and 11947 transitions. [2023-11-29 00:36:27,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:27,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 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 112 [2023-11-29 00:36:27,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:27,408 INFO L225 Difference]: With dead ends: 8925 [2023-11-29 00:36:27,408 INFO L226 Difference]: Without dead ends: 4635 [2023-11-29 00:36:27,413 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-29 00:36:27,414 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 33 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:27,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 269 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:27,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2023-11-29 00:36:27,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4635. [2023-11-29 00:36:27,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4635 states, 4634 states have (on average 1.3321104876996115) internal successors, (6173), 4634 states have internal predecessors, (6173), 0 states have call successors, (0), 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-29 00:36:27,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4635 states to 4635 states and 6173 transitions. [2023-11-29 00:36:27,807 INFO L78 Accepts]: Start accepts. Automaton has 4635 states and 6173 transitions. Word has length 112 [2023-11-29 00:36:27,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:27,807 INFO L495 AbstractCegarLoop]: Abstraction has 4635 states and 6173 transitions. [2023-11-29 00:36:27,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 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-29 00:36:27,807 INFO L276 IsEmpty]: Start isEmpty. Operand 4635 states and 6173 transitions. [2023-11-29 00:36:27,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 00:36:27,817 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:27,817 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 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] [2023-11-29 00:36:27,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 00:36:27,818 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:27,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:27,818 INFO L85 PathProgramCache]: Analyzing trace with hash -102570062, now seen corresponding path program 1 times [2023-11-29 00:36:27,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:27,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549991797] [2023-11-29 00:36:27,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:27,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:27,932 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-29 00:36:27,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:27,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549991797] [2023-11-29 00:36:27,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549991797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:27,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:27,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:27,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194733132] [2023-11-29 00:36:27,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:27,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:27,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:27,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:27,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:27,935 INFO L87 Difference]: Start difference. First operand 4635 states and 6173 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 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-29 00:36:28,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:28,579 INFO L93 Difference]: Finished difference Result 8215 states and 10971 transitions. [2023-11-29 00:36:28,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:36:28,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 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 124 [2023-11-29 00:36:28,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:28,590 INFO L225 Difference]: With dead ends: 8215 [2023-11-29 00:36:28,591 INFO L226 Difference]: Without dead ends: 4559 [2023-11-29 00:36:28,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-29 00:36:28,598 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 287 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:28,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 275 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:36:28,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4559 states. [2023-11-29 00:36:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4559 to 4557. [2023-11-29 00:36:29,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4557 states, 4556 states have (on average 1.3072870939420544) internal successors, (5956), 4556 states have internal predecessors, (5956), 0 states have call successors, (0), 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-29 00:36:29,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4557 states to 4557 states and 5956 transitions. [2023-11-29 00:36:29,077 INFO L78 Accepts]: Start accepts. Automaton has 4557 states and 5956 transitions. Word has length 124 [2023-11-29 00:36:29,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:29,078 INFO L495 AbstractCegarLoop]: Abstraction has 4557 states and 5956 transitions. [2023-11-29 00:36:29,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 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-29 00:36:29,078 INFO L276 IsEmpty]: Start isEmpty. Operand 4557 states and 5956 transitions. [2023-11-29 00:36:29,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-29 00:36:29,087 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:29,087 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 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] [2023-11-29 00:36:29,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 00:36:29,088 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:29,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:29,088 INFO L85 PathProgramCache]: Analyzing trace with hash -188773814, now seen corresponding path program 1 times [2023-11-29 00:36:29,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:29,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398749340] [2023-11-29 00:36:29,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:29,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:29,159 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 00:36:29,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:29,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398749340] [2023-11-29 00:36:29,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398749340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:29,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:29,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:36:29,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171850802] [2023-11-29 00:36:29,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:29,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:29,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:29,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:29,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:29,163 INFO L87 Difference]: Start difference. First operand 4557 states and 5956 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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-29 00:36:29,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:29,671 INFO L93 Difference]: Finished difference Result 8702 states and 11371 transitions. [2023-11-29 00:36:29,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:29,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 130 [2023-11-29 00:36:29,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:29,676 INFO L225 Difference]: With dead ends: 8702 [2023-11-29 00:36:29,676 INFO L226 Difference]: Without dead ends: 4539 [2023-11-29 00:36:29,680 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-29 00:36:29,681 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 23 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:29,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 267 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:29,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4539 states. [2023-11-29 00:36:30,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4539 to 4519. [2023-11-29 00:36:30,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4519 states, 4518 states have (on average 1.3005754758742807) internal successors, (5876), 4518 states have internal predecessors, (5876), 0 states have call successors, (0), 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-29 00:36:30,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4519 states to 4519 states and 5876 transitions. [2023-11-29 00:36:30,018 INFO L78 Accepts]: Start accepts. Automaton has 4519 states and 5876 transitions. Word has length 130 [2023-11-29 00:36:30,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:30,018 INFO L495 AbstractCegarLoop]: Abstraction has 4519 states and 5876 transitions. [2023-11-29 00:36:30,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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-29 00:36:30,018 INFO L276 IsEmpty]: Start isEmpty. Operand 4519 states and 5876 transitions. [2023-11-29 00:36:30,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-29 00:36:30,024 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:30,025 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 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] [2023-11-29 00:36:30,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 00:36:30,025 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:30,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:30,026 INFO L85 PathProgramCache]: Analyzing trace with hash 56047882, now seen corresponding path program 1 times [2023-11-29 00:36:30,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:30,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310527315] [2023-11-29 00:36:30,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:30,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 00:36:30,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:30,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310527315] [2023-11-29 00:36:30,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310527315] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:30,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:30,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:36:30,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482077858] [2023-11-29 00:36:30,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:30,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:30,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:30,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:30,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:30,071 INFO L87 Difference]: Start difference. First operand 4519 states and 5876 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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-29 00:36:30,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:30,380 INFO L93 Difference]: Finished difference Result 8652 states and 11251 transitions. [2023-11-29 00:36:30,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:30,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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 130 [2023-11-29 00:36:30,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:30,385 INFO L225 Difference]: With dead ends: 8652 [2023-11-29 00:36:30,385 INFO L226 Difference]: Without dead ends: 4509 [2023-11-29 00:36:30,390 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-29 00:36:30,391 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 19 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:30,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 264 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:30,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4509 states. [2023-11-29 00:36:30,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4509 to 4489. [2023-11-29 00:36:30,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4489 states, 4488 states have (on average 1.2934491978609626) internal successors, (5805), 4488 states have internal predecessors, (5805), 0 states have call successors, (0), 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-29 00:36:30,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4489 states to 4489 states and 5805 transitions. [2023-11-29 00:36:30,673 INFO L78 Accepts]: Start accepts. Automaton has 4489 states and 5805 transitions. Word has length 130 [2023-11-29 00:36:30,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:30,674 INFO L495 AbstractCegarLoop]: Abstraction has 4489 states and 5805 transitions. [2023-11-29 00:36:30,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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-29 00:36:30,674 INFO L276 IsEmpty]: Start isEmpty. Operand 4489 states and 5805 transitions. [2023-11-29 00:36:30,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-29 00:36:30,682 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:30,682 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 00:36:30,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 00:36:30,683 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:30,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:30,683 INFO L85 PathProgramCache]: Analyzing trace with hash 307440907, now seen corresponding path program 1 times [2023-11-29 00:36:30,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:30,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723969444] [2023-11-29 00:36:30,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:30,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:30,760 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 00:36:30,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:30,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723969444] [2023-11-29 00:36:30,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723969444] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:30,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:30,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:30,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817530325] [2023-11-29 00:36:30,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:30,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:30,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:30,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:30,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:30,762 INFO L87 Difference]: Start difference. First operand 4489 states and 5805 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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-29 00:36:31,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:31,016 INFO L93 Difference]: Finished difference Result 7308 states and 9499 transitions. [2023-11-29 00:36:31,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:36:31,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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 133 [2023-11-29 00:36:31,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:31,019 INFO L225 Difference]: With dead ends: 7308 [2023-11-29 00:36:31,019 INFO L226 Difference]: Without dead ends: 3195 [2023-11-29 00:36:31,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-29 00:36:31,022 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 261 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:31,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 250 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:31,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2023-11-29 00:36:31,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 3193. [2023-11-29 00:36:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 3192 states have (on average 1.2600250626566416) internal successors, (4022), 3192 states have internal predecessors, (4022), 0 states have call successors, (0), 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-29 00:36:31,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 4022 transitions. [2023-11-29 00:36:31,215 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 4022 transitions. Word has length 133 [2023-11-29 00:36:31,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:31,215 INFO L495 AbstractCegarLoop]: Abstraction has 3193 states and 4022 transitions. [2023-11-29 00:36:31,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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-29 00:36:31,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 4022 transitions. [2023-11-29 00:36:31,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-29 00:36:31,218 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:31,218 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 00:36:31,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 00:36:31,218 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:31,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:31,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1540318430, now seen corresponding path program 1 times [2023-11-29 00:36:31,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:31,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288141915] [2023-11-29 00:36:31,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:31,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:31,300 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 00:36:31,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:31,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288141915] [2023-11-29 00:36:31,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288141915] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:31,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:31,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:31,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750284282] [2023-11-29 00:36:31,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:31,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:31,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:31,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:31,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:31,303 INFO L87 Difference]: Start difference. First operand 3193 states and 4022 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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-29 00:36:31,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:31,507 INFO L93 Difference]: Finished difference Result 5162 states and 6506 transitions. [2023-11-29 00:36:31,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:36:31,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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 133 [2023-11-29 00:36:31,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:31,510 INFO L225 Difference]: With dead ends: 5162 [2023-11-29 00:36:31,510 INFO L226 Difference]: Without dead ends: 2042 [2023-11-29 00:36:31,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-29 00:36:31,514 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 263 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:31,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 245 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:31,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2023-11-29 00:36:31,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 2040. [2023-11-29 00:36:31,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2040 states, 2039 states have (on average 1.2256007846983816) internal successors, (2499), 2039 states have internal predecessors, (2499), 0 states have call successors, (0), 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-29 00:36:31,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 2499 transitions. [2023-11-29 00:36:31,650 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 2499 transitions. Word has length 133 [2023-11-29 00:36:31,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:31,651 INFO L495 AbstractCegarLoop]: Abstraction has 2040 states and 2499 transitions. [2023-11-29 00:36:31,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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-29 00:36:31,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 2499 transitions. [2023-11-29 00:36:31,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-29 00:36:31,653 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:31,653 INFO L195 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 00:36:31,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 00:36:31,653 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:31,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:31,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1562436170, now seen corresponding path program 1 times [2023-11-29 00:36:31,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:31,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715351304] [2023-11-29 00:36:31,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:31,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:31,698 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-29 00:36:31,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:31,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715351304] [2023-11-29 00:36:31,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715351304] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:31,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:31,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:31,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584928093] [2023-11-29 00:36:31,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:31,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:31,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:31,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:31,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:31,700 INFO L87 Difference]: Start difference. First operand 2040 states and 2499 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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-29 00:36:31,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:31,857 INFO L93 Difference]: Finished difference Result 3672 states and 4536 transitions. [2023-11-29 00:36:31,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:31,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 171 [2023-11-29 00:36:31,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:31,860 INFO L225 Difference]: With dead ends: 3672 [2023-11-29 00:36:31,860 INFO L226 Difference]: Without dead ends: 1978 [2023-11-29 00:36:31,862 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-29 00:36:31,862 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:31,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 267 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:31,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2023-11-29 00:36:31,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1920. [2023-11-29 00:36:31,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1920 states, 1919 states have (on average 1.2094841063053674) internal successors, (2321), 1919 states have internal predecessors, (2321), 0 states have call successors, (0), 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-29 00:36:31,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 2321 transitions. [2023-11-29 00:36:31,979 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 2321 transitions. Word has length 171 [2023-11-29 00:36:31,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:31,980 INFO L495 AbstractCegarLoop]: Abstraction has 1920 states and 2321 transitions. [2023-11-29 00:36:31,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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-29 00:36:31,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 2321 transitions. [2023-11-29 00:36:31,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-11-29 00:36:31,981 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:31,982 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 00:36:31,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 00:36:31,982 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:31,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:31,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2092525293, now seen corresponding path program 1 times [2023-11-29 00:36:31,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:31,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770161602] [2023-11-29 00:36:31,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:31,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:32,051 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-29 00:36:32,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:32,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770161602] [2023-11-29 00:36:32,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770161602] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:32,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:32,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:32,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891181668] [2023-11-29 00:36:32,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:32,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:32,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:32,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:32,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:32,053 INFO L87 Difference]: Start difference. First operand 1920 states and 2321 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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-29 00:36:32,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:32,239 INFO L93 Difference]: Finished difference Result 4125 states and 5024 transitions. [2023-11-29 00:36:32,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:32,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 177 [2023-11-29 00:36:32,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:32,243 INFO L225 Difference]: With dead ends: 4125 [2023-11-29 00:36:32,243 INFO L226 Difference]: Without dead ends: 2547 [2023-11-29 00:36:32,245 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-29 00:36:32,245 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 124 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:32,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 263 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:32,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2547 states. [2023-11-29 00:36:32,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2547 to 2202. [2023-11-29 00:36:32,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2202 states, 2201 states have (on average 1.1926397092230805) internal successors, (2625), 2201 states have internal predecessors, (2625), 0 states have call successors, (0), 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-29 00:36:32,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 2625 transitions. [2023-11-29 00:36:32,380 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 2625 transitions. Word has length 177 [2023-11-29 00:36:32,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:32,381 INFO L495 AbstractCegarLoop]: Abstraction has 2202 states and 2625 transitions. [2023-11-29 00:36:32,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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-29 00:36:32,381 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 2625 transitions. [2023-11-29 00:36:32,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-11-29 00:36:32,382 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:32,382 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 00:36:32,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-29 00:36:32,383 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:32,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:32,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1666060306, now seen corresponding path program 1 times [2023-11-29 00:36:32,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:32,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539364991] [2023-11-29 00:36:32,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:32,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:32,842 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 00:36:32,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:32,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539364991] [2023-11-29 00:36:32,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539364991] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:36:32,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542042247] [2023-11-29 00:36:32,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:32,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:32,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e755ea4-31c1-441a-90d5-06b2b8721a6d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:32,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e755ea4-31c1-441a-90d5-06b2b8721a6d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:36:32,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e755ea4-31c1-441a-90d5-06b2b8721a6d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:36:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:32,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 00:36:32,999 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:33,340 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 80 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 00:36:33,340 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:36:33,973 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 80 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 00:36:33,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542042247] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:36:33,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:36:33,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2023-11-29 00:36:33,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111797909] [2023-11-29 00:36:33,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:36:33,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 00:36:33,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:33,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 00:36:33,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2023-11-29 00:36:33,976 INFO L87 Difference]: Start difference. First operand 2202 states and 2625 transitions. Second operand has 27 states, 27 states have (on average 16.333333333333332) internal successors, (441), 27 states have internal predecessors, (441), 0 states have call successors, (0), 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-29 00:36:37,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:37,065 INFO L93 Difference]: Finished difference Result 9197 states and 10930 transitions. [2023-11-29 00:36:37,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-11-29 00:36:37,065 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 16.333333333333332) internal successors, (441), 27 states have internal predecessors, (441), 0 states have call successors, (0), 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 180 [2023-11-29 00:36:37,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:37,072 INFO L225 Difference]: With dead ends: 9197 [2023-11-29 00:36:37,072 INFO L226 Difference]: Without dead ends: 7324 [2023-11-29 00:36:37,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1484 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=745, Invalid=5735, Unknown=0, NotChecked=0, Total=6480 [2023-11-29 00:36:37,078 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 3115 mSDsluCounter, 9825 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3115 SdHoareTripleChecker+Valid, 10313 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:37,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3115 Valid, 10313 Invalid, 1602 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [36 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 00:36:37,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7324 states. [2023-11-29 00:36:37,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7324 to 3161. [2023-11-29 00:36:37,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3161 states, 3160 states have (on average 1.1898734177215189) internal successors, (3760), 3160 states have internal predecessors, (3760), 0 states have call successors, (0), 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-29 00:36:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3161 states to 3161 states and 3760 transitions. [2023-11-29 00:36:37,300 INFO L78 Accepts]: Start accepts. Automaton has 3161 states and 3760 transitions. Word has length 180 [2023-11-29 00:36:37,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:37,300 INFO L495 AbstractCegarLoop]: Abstraction has 3161 states and 3760 transitions. [2023-11-29 00:36:37,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 16.333333333333332) internal successors, (441), 27 states have internal predecessors, (441), 0 states have call successors, (0), 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-29 00:36:37,301 INFO L276 IsEmpty]: Start isEmpty. Operand 3161 states and 3760 transitions. [2023-11-29 00:36:37,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2023-11-29 00:36:37,304 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:37,304 INFO L195 NwaCegarLoop]: trace histogram [9, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:37,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e755ea4-31c1-441a-90d5-06b2b8721a6d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:36:37,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e755ea4-31c1-441a-90d5-06b2b8721a6d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:37,505 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:37,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:37,506 INFO L85 PathProgramCache]: Analyzing trace with hash 169367581, now seen corresponding path program 1 times [2023-11-29 00:36:37,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:37,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237987121] [2023-11-29 00:36:37,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:37,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:37,559 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2023-11-29 00:36:37,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:37,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237987121] [2023-11-29 00:36:37,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237987121] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:37,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:37,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:37,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741762486] [2023-11-29 00:36:37,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:37,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:37,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:37,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:37,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:37,561 INFO L87 Difference]: Start difference. First operand 3161 states and 3760 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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-29 00:36:37,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:37,743 INFO L93 Difference]: Finished difference Result 4927 states and 5833 transitions. [2023-11-29 00:36:37,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:37,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 246 [2023-11-29 00:36:37,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:37,745 INFO L225 Difference]: With dead ends: 4927 [2023-11-29 00:36:37,745 INFO L226 Difference]: Without dead ends: 2141 [2023-11-29 00:36:37,747 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-29 00:36:37,747 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 3 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:37,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 280 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:37,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2023-11-29 00:36:37,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 2108. [2023-11-29 00:36:37,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2108 states, 2107 states have (on average 1.161841480778358) internal successors, (2448), 2107 states have internal predecessors, (2448), 0 states have call successors, (0), 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-29 00:36:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 2108 states and 2448 transitions. [2023-11-29 00:36:37,889 INFO L78 Accepts]: Start accepts. Automaton has 2108 states and 2448 transitions. Word has length 246 [2023-11-29 00:36:37,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:37,889 INFO L495 AbstractCegarLoop]: Abstraction has 2108 states and 2448 transitions. [2023-11-29 00:36:37,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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-29 00:36:37,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 2448 transitions. [2023-11-29 00:36:37,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2023-11-29 00:36:37,892 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:37,892 INFO L195 NwaCegarLoop]: trace histogram [10, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:37,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-29 00:36:37,892 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:37,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:37,893 INFO L85 PathProgramCache]: Analyzing trace with hash -84910890, now seen corresponding path program 1 times [2023-11-29 00:36:37,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:37,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886355974] [2023-11-29 00:36:37,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:37,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,056 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-11-29 00:36:38,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:38,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886355974] [2023-11-29 00:36:38,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886355974] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:38,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:38,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:38,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110585995] [2023-11-29 00:36:38,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:38,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:38,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:38,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:38,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:38,059 INFO L87 Difference]: Start difference. First operand 2108 states and 2448 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 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-29 00:36:38,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:38,312 INFO L93 Difference]: Finished difference Result 3951 states and 4599 transitions. [2023-11-29 00:36:38,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:36:38,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 254 [2023-11-29 00:36:38,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:38,315 INFO L225 Difference]: With dead ends: 3951 [2023-11-29 00:36:38,315 INFO L226 Difference]: Without dead ends: 2109 [2023-11-29 00:36:38,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-29 00:36:38,316 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 181 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:38,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 192 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:38,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2023-11-29 00:36:38,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 2108. [2023-11-29 00:36:38,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2108 states, 2107 states have (on average 1.1523493118177504) internal successors, (2428), 2107 states have internal predecessors, (2428), 0 states have call successors, (0), 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-29 00:36:38,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 2108 states and 2428 transitions. [2023-11-29 00:36:38,461 INFO L78 Accepts]: Start accepts. Automaton has 2108 states and 2428 transitions. Word has length 254 [2023-11-29 00:36:38,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:38,461 INFO L495 AbstractCegarLoop]: Abstraction has 2108 states and 2428 transitions. [2023-11-29 00:36:38,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 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-29 00:36:38,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 2428 transitions. [2023-11-29 00:36:38,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-11-29 00:36:38,463 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:38,464 INFO L195 NwaCegarLoop]: trace histogram [10, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:38,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-29 00:36:38,464 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:38,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:38,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1676121475, now seen corresponding path program 1 times [2023-11-29 00:36:38,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:38,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056938165] [2023-11-29 00:36:38,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:38,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,547 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 00:36:38,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:38,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056938165] [2023-11-29 00:36:38,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056938165] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:38,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:38,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:38,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76160684] [2023-11-29 00:36:38,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:38,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:38,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:38,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:38,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:38,549 INFO L87 Difference]: Start difference. First operand 2108 states and 2428 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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-29 00:36:38,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:38,673 INFO L93 Difference]: Finished difference Result 2484 states and 2849 transitions. [2023-11-29 00:36:38,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:38,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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 256 [2023-11-29 00:36:38,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:38,675 INFO L225 Difference]: With dead ends: 2484 [2023-11-29 00:36:38,675 INFO L226 Difference]: Without dead ends: 751 [2023-11-29 00:36:38,676 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-29 00:36:38,677 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 26 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:38,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 265 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:38,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2023-11-29 00:36:38,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 751. [2023-11-29 00:36:38,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 750 states have (on average 1.112) internal successors, (834), 750 states have internal predecessors, (834), 0 states have call successors, (0), 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-29 00:36:38,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 834 transitions. [2023-11-29 00:36:38,752 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 834 transitions. Word has length 256 [2023-11-29 00:36:38,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:38,752 INFO L495 AbstractCegarLoop]: Abstraction has 751 states and 834 transitions. [2023-11-29 00:36:38,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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-29 00:36:38,752 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 834 transitions. [2023-11-29 00:36:38,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2023-11-29 00:36:38,754 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:38,755 INFO L195 NwaCegarLoop]: trace histogram [9, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:38,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-29 00:36:38,755 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:38,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:38,756 INFO L85 PathProgramCache]: Analyzing trace with hash -2018575222, now seen corresponding path program 1 times [2023-11-29 00:36:38,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:38,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236690222] [2023-11-29 00:36:38,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:38,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,833 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-11-29 00:36:38,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:38,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236690222] [2023-11-29 00:36:38,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236690222] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:38,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:38,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:38,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829606221] [2023-11-29 00:36:38,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:38,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:38,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:38,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:38,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:38,835 INFO L87 Difference]: Start difference. First operand 751 states and 834 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:38,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:38,930 INFO L93 Difference]: Finished difference Result 1012 states and 1124 transitions. [2023-11-29 00:36:38,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:38,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 270 [2023-11-29 00:36:38,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:38,931 INFO L225 Difference]: With dead ends: 1012 [2023-11-29 00:36:38,931 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 00:36:38,932 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-29 00:36:38,933 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 3 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:38,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 249 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:36:38,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 00:36:38,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 00:36:38,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-29 00:36:38,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 00:36:38,934 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 270 [2023-11-29 00:36:38,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:38,935 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 00:36:38,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:38,935 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 00:36:38,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 00:36:38,938 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 00:36:38,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-29 00:36:38,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 00:36:51,931 WARN L293 SmtUtils]: Spent 12.98s on a formula simplification. DAG size of input: 229 DAG size of output: 289 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 00:37:18,081 WARN L293 SmtUtils]: Spent 26.15s on a formula simplification. DAG size of input: 290 DAG size of output: 368 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 00:37:27,495 WARN L293 SmtUtils]: Spent 9.41s on a formula simplification. DAG size of input: 214 DAG size of output: 277 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 00:39:59,543 WARN L293 SmtUtils]: Spent 2.53m on a formula simplification. DAG size of input: 226 DAG size of output: 246 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 00:40:23,799 WARN L293 SmtUtils]: Spent 24.25s on a formula simplification. DAG size of input: 290 DAG size of output: 368 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 00:41:35,139 WARN L293 SmtUtils]: Spent 1.19m on a formula simplification. DAG size of input: 402 DAG size of output: 504 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 00:41:47,472 WARN L293 SmtUtils]: Spent 5.12s on a formula simplification. DAG size of input: 504 DAG size of output: 124 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 00:41:47,476 INFO L899 garLoopResultBuilder]: For program point L597(lines 545 685) no Hoare annotation was computed. [2023-11-29 00:41:47,476 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 568) no Hoare annotation was computed. [2023-11-29 00:41:47,476 INFO L899 garLoopResultBuilder]: For program point L564-2(lines 545 685) no Hoare annotation was computed. [2023-11-29 00:41:47,476 INFO L899 garLoopResultBuilder]: For program point L366(lines 298 396) no Hoare annotation was computed. [2023-11-29 00:41:47,476 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 238) no Hoare annotation was computed. [2023-11-29 00:41:47,476 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 110) no Hoare annotation was computed. [2023-11-29 00:41:47,476 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 77) no Hoare annotation was computed. [2023-11-29 00:41:47,476 INFO L899 garLoopResultBuilder]: For program point L598(lines 598 602) no Hoare annotation was computed. [2023-11-29 00:41:47,476 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 107) no Hoare annotation was computed. [2023-11-29 00:41:47,477 INFO L899 garLoopResultBuilder]: For program point L434-1(lines 406 690) no Hoare annotation was computed. [2023-11-29 00:41:47,477 INFO L899 garLoopResultBuilder]: For program point L534-1(lines 406 690) no Hoare annotation was computed. [2023-11-29 00:41:47,477 INFO L899 garLoopResultBuilder]: For program point L336(lines 298 396) no Hoare annotation was computed. [2023-11-29 00:41:47,477 INFO L899 garLoopResultBuilder]: For program point L303(lines 303 319) no Hoare annotation was computed. [2023-11-29 00:41:47,478 INFO L895 garLoopResultBuilder]: At program point L204-1(lines 197 220) the Hoare annotation is: (let ((.cse20 (= ~wb_st~0 0)) (.cse19 (= ~c1_st~0 0)) (.cse28 (= 0 ~wl_pc~0)) (.cse35 (+ ~t_b~0 2)) (.cse34 (+ ~t_b~0 1))) (let ((.cse18 (= ~data~0 .cse34)) (.cse33 (= .cse35 ~data~0)) (.cse23 (= ~c1_pc~0 0)) (.cse36 (not (= ~e_c~0 0))) (.cse22 (= ~d~0 0)) (.cse24 (= ~t_b~0 0)) (.cse25 (= ~data~0 0)) (.cse37 (not (= 2 ~wl_pc~0))) (.cse38 (not .cse28)) (.cse26 (= ~wb_pc~0 0)) (.cse27 (= ~r_st~0 2)) (.cse16 (= ~processed~0 0)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse31 (not .cse19)) (.cse2 (not (= ~c2_st~0 0))) (.cse3 (= ~wb_pc~0 1)) (.cse4 (not (= ~e_g~0 1))) (.cse5 (not (= ~e_e~0 0))) (.cse6 (not (= ~r_i~0 1))) (.cse7 (not (= ~e_e~0 1))) (.cse8 (not (= ~e_wl~0 1))) (.cse9 (= ~c1_i~0 1)) (.cse10 (= ~e_c~0 2)) (.cse11 (= ~c2_i~0 1)) (.cse12 (= ~e_f~0 2)) (.cse13 (= ~c1_pc~0 1)) (.cse30 (not .cse20)) (.cse14 (not (= ~r_st~0 0))) (.cse15 (= ~c2_pc~0 1)) (.cse17 (not (= ~e_wl~0 0))) (.cse29 (= ~c_req_up~0 ~r_i~0)) (.cse21 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse22 .cse2 .cse23 .cse4 .cse24 .cse5 .cse25 .cse6 .cse7 .cse26 .cse27 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16 .cse17 .cse19 .cse28 .cse20 .cse29 .cse21) (and .cse1 .cse22 .cse2 .cse3 .cse23 .cse4 .cse24 .cse5 .cse25 .cse6 .cse7 .cse27 .cse8 .cse9 .cse10 .cse11 .cse12 .cse30 .cse16 .cse17 .cse19 .cse28 .cse29 .cse21) (and (let ((.cse32 (or (= ~c_t~0 .cse34) (= .cse35 ~c_t~0)))) (or (and .cse0 .cse1 .cse31 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse14 .cse15 .cse32 .cse17 .cse18 .cse21) (and .cse0 .cse1 .cse31 .cse2 .cse3 .cse33 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse14 .cse15 .cse32 .cse17 .cse21))) .cse12) (and .cse0 .cse1 .cse4 .cse5 .cse36 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse17 .cse28 .cse21) (and .cse0 .cse1 .cse22 .cse2 .cse23 .cse4 .cse24 .cse5 .cse25 .cse37 .cse38 .cse6 .cse7 .cse26 .cse27 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16 .cse19 .cse20 .cse29 .cse21) (and .cse1 .cse31 .cse22 .cse2 .cse4 .cse24 .cse5 .cse25 .cse6 .cse7 .cse26 .cse27 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17 .cse28 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse31 .cse2 .cse3 .cse33 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse21) (and .cse0 .cse1 .cse22 .cse2 .cse3 .cse23 .cse4 .cse24 .cse5 .cse25 .cse37 .cse38 .cse6 .cse7 .cse27 .cse8 .cse9 .cse10 .cse11 .cse12 .cse30 .cse16 .cse19 .cse29 .cse21) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse36 .cse37 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse17 .cse21) (and .cse0 .cse1 .cse31 .cse22 .cse2 .cse3 .cse4 .cse24 .cse5 .cse25 .cse37 .cse38 .cse6 .cse7 .cse27 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse30 .cse16 .cse29 .cse21) (and .cse1 .cse31 .cse22 .cse2 .cse3 .cse4 .cse24 .cse5 .cse25 .cse6 .cse7 .cse27 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse30 .cse16 .cse17 .cse28 .cse29 .cse21) (and .cse0 .cse1 .cse31 .cse22 .cse2 .cse4 .cse24 .cse5 .cse25 .cse37 .cse38 .cse6 .cse7 .cse26 .cse27 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse20 .cse29 .cse21) (and .cse0 .cse1 .cse31 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse30 .cse14 .cse15 .cse17 .cse29 .cse21)))) [2023-11-29 00:41:47,479 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 76) no Hoare annotation was computed. [2023-11-29 00:41:47,479 INFO L899 garLoopResultBuilder]: For program point L667(lines 667 683) no Hoare annotation was computed. [2023-11-29 00:41:47,479 INFO L899 garLoopResultBuilder]: For program point L634-1(lines 545 685) no Hoare annotation was computed. [2023-11-29 00:41:47,479 INFO L899 garLoopResultBuilder]: For program point L370(lines 370 377) no Hoare annotation was computed. [2023-11-29 00:41:47,479 INFO L899 garLoopResultBuilder]: For program point L569-1(lines 545 685) no Hoare annotation was computed. [2023-11-29 00:41:47,479 INFO L899 garLoopResultBuilder]: For program point L470(lines 470 474) no Hoare annotation was computed. [2023-11-29 00:41:47,479 INFO L899 garLoopResultBuilder]: For program point write_back_returnLabel#1(lines 227 258) no Hoare annotation was computed. [2023-11-29 00:41:47,479 INFO L899 garLoopResultBuilder]: For program point compute1_returnLabel#1(lines 137 181) no Hoare annotation was computed. [2023-11-29 00:41:47,479 INFO L899 garLoopResultBuilder]: For program point L306(lines 306 318) no Hoare annotation was computed. [2023-11-29 00:41:47,479 INFO L899 garLoopResultBuilder]: For program point L273(lines 265 282) no Hoare annotation was computed. [2023-11-29 00:41:47,480 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 215) no Hoare annotation was computed. [2023-11-29 00:41:47,480 INFO L899 garLoopResultBuilder]: For program point L207-1(lines 207 215) no Hoare annotation was computed. [2023-11-29 00:41:47,480 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 149) no Hoare annotation was computed. [2023-11-29 00:41:47,480 INFO L899 garLoopResultBuilder]: For program point L670(lines 670 682) no Hoare annotation was computed. [2023-11-29 00:41:47,480 INFO L899 garLoopResultBuilder]: For program point L505(lines 406 690) no Hoare annotation was computed. [2023-11-29 00:41:47,480 INFO L899 garLoopResultBuilder]: For program point L439-1(lines 406 690) no Hoare annotation was computed. [2023-11-29 00:41:47,480 INFO L899 garLoopResultBuilder]: For program point compute2_returnLabel#1(lines 182 226) no Hoare annotation was computed. [2023-11-29 00:41:47,480 INFO L899 garLoopResultBuilder]: For program point L340(lines 340 347) no Hoare annotation was computed. [2023-11-29 00:41:47,480 INFO L899 garLoopResultBuilder]: For program point L274(lines 274 278) no Hoare annotation was computed. [2023-11-29 00:41:47,480 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 212) no Hoare annotation was computed. [2023-11-29 00:41:47,480 INFO L899 garLoopResultBuilder]: For program point L506(lines 506 510) no Hoare annotation was computed. [2023-11-29 00:41:47,481 INFO L895 garLoopResultBuilder]: At program point L242-1(lines 242 252) the Hoare annotation is: (let ((.cse35 (+ ~t_b~0 2))) (let ((.cse21 (= ~c1_st~0 0)) (.cse39 (+ ~t_b~0 1)) (.cse36 (= .cse35 ~c_t~0)) (.cse22 (= 0 ~wl_pc~0)) (.cse37 (= ~c2_st~0 0))) (let ((.cse2 (not .cse37)) (.cse34 (not (= ~e_c~0 0))) (.cse26 (not (= 2 ~wl_pc~0))) (.cse27 (not .cse22)) (.cse25 (not (= 0 ~wl_st~0))) (.cse28 (= ~wb_pc~0 1)) (.cse30 (not (= ~r_st~0 0))) (.cse18 (= ~c2_pc~0 1)) (.cse31 (or (= ~c_t~0 .cse39) .cse36)) (.cse32 (= ~data~0 .cse39)) (.cse33 (not .cse21)) (.cse29 (= ~c1_pc~0 1)) (.cse0 (not (= ~e_g~0 0))) (.cse1 (= ~d~0 0)) (.cse38 (= ~c2_pc~0 0)) (.cse3 (= ~c1_pc~0 0)) (.cse4 (not (= ~e_g~0 1))) (.cse5 (= ~t_b~0 0)) (.cse6 (not (= ~e_e~0 0))) (.cse7 (= ~data~0 0)) (.cse8 (not (= ~r_i~0 1))) (.cse9 (not (= ~e_e~0 1))) (.cse10 (= ~wb_pc~0 0)) (.cse11 (= ~r_st~0 2)) (.cse12 (not (= ~e_wl~0 1))) (.cse13 (= ~c1_i~0 1)) (.cse14 (= ~e_c~0 2)) (.cse15 (= ~c2_i~0 1)) (.cse16 (= ~e_f~0 2)) (.cse17 (not (= ~wb_st~0 0))) (.cse19 (= ~processed~0 0)) (.cse20 (not (= ~e_wl~0 0))) (.cse23 (= ~c_req_up~0 ~r_i~0)) (.cse24 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse26 .cse27 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse23 .cse24) (and .cse25 .cse0 .cse2 .cse28 .cse4 .cse6 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse30 .cse18 .cse31 .cse20 .cse32 .cse21 .cse24) (and .cse0 .cse33 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse25 .cse0 .cse33 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse26 .cse27 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse23 .cse24) (and .cse25 .cse0 .cse4 .cse6 .cse34 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse20 .cse22 .cse24) (and .cse25 .cse0 .cse33 .cse2 .cse28 (= .cse35 ~data~0) .cse4 .cse6 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse30 .cse18 .cse36 .cse20 .cse24) (and .cse25 .cse0 .cse28 .cse4 .cse6 .cse34 .cse26 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse29 .cse18 .cse20 .cse24) (and .cse25 .cse0 .cse1 .cse37 .cse38 .cse3 .cse4 .cse5 .cse6 .cse7 .cse26 .cse27 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse21 .cse23 .cse24) (and .cse25 .cse0 .cse33 .cse1 .cse37 .cse38 .cse4 .cse5 .cse6 .cse7 .cse26 .cse27 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse19 .cse23 .cse24) (and .cse25 .cse0 .cse33 .cse28 .cse37 .cse4 .cse6 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse30 .cse18 .cse31 .cse20 .cse32 .cse24) (and .cse0 .cse33 .cse1 .cse37 .cse38 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse37 .cse38 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24))))) [2023-11-29 00:41:47,481 INFO L899 garLoopResultBuilder]: For program point L639-1(lines 545 685) no Hoare annotation was computed. [2023-11-29 00:41:47,482 INFO L899 garLoopResultBuilder]: For program point L408(lines 408 418) no Hoare annotation was computed. [2023-11-29 00:41:47,482 INFO L899 garLoopResultBuilder]: For program point L408-2(lines 406 690) no Hoare annotation was computed. [2023-11-29 00:41:47,482 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 317) no Hoare annotation was computed. [2023-11-29 00:41:47,482 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 148) no Hoare annotation was computed. [2023-11-29 00:41:47,482 INFO L899 garLoopResultBuilder]: For program point L673(lines 673 681) no Hoare annotation was computed. [2023-11-29 00:41:47,482 INFO L899 garLoopResultBuilder]: For program point L607(lines 545 685) no Hoare annotation was computed. [2023-11-29 00:41:47,482 INFO L899 garLoopResultBuilder]: For program point L574-1(lines 545 685) no Hoare annotation was computed. [2023-11-29 00:41:47,482 INFO L899 garLoopResultBuilder]: For program point L409(lines 409 414) no Hoare annotation was computed. [2023-11-29 00:41:47,482 INFO L899 garLoopResultBuilder]: For program point L409-2(lines 409 414) no Hoare annotation was computed. [2023-11-29 00:41:47,482 INFO L899 garLoopResultBuilder]: For program point L79(lines 65 135) no Hoare annotation was computed. [2023-11-29 00:41:47,483 INFO L899 garLoopResultBuilder]: For program point L608(lines 608 612) no Hoare annotation was computed. [2023-11-29 00:41:47,483 INFO L899 garLoopResultBuilder]: For program point L477(lines 406 690) no Hoare annotation was computed. [2023-11-29 00:41:47,483 INFO L899 garLoopResultBuilder]: For program point L444-1(lines 406 690) no Hoare annotation was computed. [2023-11-29 00:41:47,483 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 316) no Hoare annotation was computed. [2023-11-29 00:41:47,483 INFO L899 garLoopResultBuilder]: For program point L312-1(lines 298 396) no Hoare annotation was computed. [2023-11-29 00:41:47,483 INFO L899 garLoopResultBuilder]: For program point L676(lines 676 680) no Hoare annotation was computed. [2023-11-29 00:41:47,483 INFO L895 garLoopResultBuilder]: At program point L676-1(lines 545 685) the Hoare annotation is: (let ((.cse30 (= ~wb_st~0 0)) (.cse28 (= ~c2_st~0 0)) (.cse29 (= ~c1_st~0 0))) (let ((.cse2 (= ~d~0 0)) (.cse6 (= ~t_b~0 0)) (.cse8 (= ~data~0 0)) (.cse13 (= ~r_st~0 2)) (.cse22 (= ~processed~0 0)) (.cse10 (= 0 ~wl_pc~0)) (.cse24 (= ~c_req_up~0 ~r_i~0)) (.cse27 (not (= ~e_c~0 0))) (.cse9 (not (= 2 ~wl_pc~0))) (.cse18 (= ~e_f~0 2)) (.cse26 (not (= 0 ~wl_st~0))) (.cse0 (not (= ~e_g~0 0))) (.cse1 (not .cse29)) (.cse3 (not .cse28)) (.cse4 (= ~wb_pc~0 1)) (.cse5 (not (= ~e_g~0 1))) (.cse7 (not (= ~e_e~0 0))) (.cse11 (not (= ~r_i~0 1))) (.cse12 (not (= ~e_e~0 1))) (.cse14 (not (= ~e_wl~0 1))) (.cse15 (= ~c1_i~0 1)) (.cse16 (= ~e_c~0 2)) (.cse17 (= ~c2_i~0 1)) (.cse19 (= ~c1_pc~0 1)) (.cse20 (not .cse30)) (.cse21 (= ~c2_pc~0 1)) (.cse23 (not (= ~e_wl~0 0))) (.cse25 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse26 .cse0 .cse5 .cse7 .cse27 .cse11 .cse12 .cse14 .cse15 .cse17 .cse18 .cse23 .cse10 .cse25) (and .cse0 .cse2 .cse28 (= ~c2_pc~0 0) (= ~c1_pc~0 0) .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 (= ~wb_pc~0 0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse22 .cse23 .cse29 .cse10 .cse30 .cse24 .cse25) (and .cse26 .cse0 .cse4 .cse5 .cse7 .cse27 .cse9 .cse11 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19 .cse21 .cse23 .cse25) (and .cse18 (let ((.cse34 (+ ~t_b~0 2)) (.cse33 (+ ~t_b~0 1))) (let ((.cse31 (or (= .cse34 ~c~0) (= .cse33 ~c~0))) (.cse32 (or (= ~c_t~0 .cse33) (= .cse34 ~c_t~0)))) (or (and .cse26 .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse11 .cse31 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse32 .cse23 (= ~data~0 .cse33) .cse25) (and .cse26 .cse0 .cse1 .cse3 .cse4 (= .cse34 ~data~0) .cse5 .cse7 .cse11 .cse31 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse32 .cse23 .cse25)))))))) [2023-11-29 00:41:47,484 INFO L899 garLoopResultBuilder]: For program point L478(lines 478 482) no Hoare annotation was computed. [2023-11-29 00:41:47,484 INFO L899 garLoopResultBuilder]: For program point L644-1(lines 545 685) no Hoare annotation was computed. [2023-11-29 00:41:47,484 INFO L899 garLoopResultBuilder]: For program point L579-1(lines 545 685) no Hoare annotation was computed. [2023-11-29 00:41:47,485 INFO L895 garLoopResultBuilder]: At program point L381(lines 298 396) the Hoare annotation is: (let ((.cse23 (= ~wb_st~0 0)) (.cse42 (+ ~t_b~0 2)) (.cse3 (= ~c2_st~0 0)) (.cse22 (= ~c1_st~0 0)) (.cse41 (+ ~t_b~0 1)) (.cse31 (= 0 ~wl_pc~0)) (.cse32 (= 2 ~wl_pc~0))) (let ((.cse4 (= ~c2_pc~0 0)) (.cse43 (not (= ~e_c~0 0))) (.cse37 (not (= ~r_st~0 0))) (.cse2 (= ~d~0 0)) (.cse5 (= ~c1_pc~0 0)) (.cse7 (= ~t_b~0 0)) (.cse9 (= ~data~0 0)) (.cse10 (not .cse32)) (.cse11 (not .cse31)) (.cse14 (= ~wb_pc~0 0)) (.cse15 (= ~r_st~0 2)) (.cse21 (= ~processed~0 0)) (.cse24 (= ~c_req_up~0 ~r_i~0)) (.cse20 (= ~e_f~0 2)) (.cse40 (= ~data~0 .cse41)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse26 (not .cse22)) (.cse34 (not .cse3)) (.cse28 (= ~wb_pc~0 1)) (.cse35 (= .cse42 ~data~0)) (.cse6 (not (= ~e_g~0 1))) (.cse8 (not (= ~e_e~0 0))) (.cse12 (not (= ~r_i~0 1))) (.cse36 (or (= .cse42 ~c~0) (= .cse41 ~c~0))) (.cse13 (not (= ~e_e~0 1))) (.cse16 (not (= ~e_wl~0 1))) (.cse17 (= ~c1_i~0 1)) (.cse18 (= ~e_c~0 2)) (.cse19 (= ~c2_i~0 1)) (.cse27 (= ~c1_pc~0 1)) (.cse29 (not .cse23)) (.cse38 (= ~c2_pc~0 1)) (.cse39 (or (= ~c_t~0 .cse41) (= .cse42 ~c_t~0))) (.cse30 (not (= ~e_wl~0 0))) (.cse25 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse26 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse27 .cse21 .cse23 .cse24 .cse25) (and .cse1 .cse26 .cse2 .cse28 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse27 .cse29 .cse21 .cse30 .cse31 .cse24 .cse25) (and .cse20 .cse32 (let ((.cse33 (or (= .cse41 ~d~0) (= .cse42 ~d~0)))) (or (and .cse1 .cse26 .cse33 .cse34 .cse28 .cse35 .cse6 .cse8 .cse12 .cse36 .cse13 .cse16 .cse17 .cse18 .cse19 .cse27 .cse29 .cse37 .cse38 .cse39 .cse30 .cse25) (and .cse1 .cse26 .cse33 .cse34 .cse28 .cse6 .cse8 .cse12 .cse36 .cse13 .cse16 .cse17 .cse18 .cse19 .cse27 .cse29 .cse37 .cse38 .cse39 .cse30 .cse40 .cse25)))) (and .cse0 .cse1 .cse34 .cse28 .cse6 .cse8 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20 .cse27 .cse37 .cse38 .cse21 .cse30 .cse40 .cse22 .cse23 .cse25) (and .cse1 .cse2 .cse34 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse38 .cse21 .cse30 .cse22 .cse31 .cse24 .cse25) (and .cse0 .cse1 .cse26 .cse2 .cse34 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse27 .cse29 .cse38 .cse21 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse34 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse38 .cse21 .cse22 .cse24 .cse25) (and .cse0 .cse1 .cse26 .cse2 .cse28 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse27 .cse29 .cse21 .cse24 .cse25) (and .cse1 .cse2 .cse28 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21 .cse30 .cse22 .cse31 .cse24 .cse25) (and .cse1 .cse2 .cse34 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse38 .cse21 .cse30 .cse22 .cse31 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse6 .cse8 .cse43 .cse12 .cse13 .cse16 .cse17 .cse19 .cse20 .cse30 .cse31 .cse25) (and .cse1 .cse26 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse27 .cse21 .cse30 .cse31 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse34 .cse28 .cse6 .cse8 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20 .cse27 .cse29 .cse37 .cse38 .cse39 .cse30 .cse40 .cse25) (and .cse0 .cse1 .cse26 .cse2 .cse34 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse27 .cse38 .cse21 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse26 .cse34 .cse28 .cse35 .cse6 .cse8 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20 .cse27 .cse37 .cse38 .cse21 .cse30 .cse23 .cse25) (and .cse0 .cse1 .cse2 .cse28 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21 .cse22 .cse24 .cse25) (and .cse0 .cse1 .cse26 .cse28 .cse6 .cse8 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20 .cse27 .cse29 .cse37 .cse38 .cse39 .cse30 .cse40 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse31 .cse23 .cse24 .cse25) (and .cse1 .cse26 .cse2 .cse34 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse27 .cse29 .cse38 .cse21 .cse30 .cse24 .cse25) (and .cse0 .cse1 .cse26 .cse34 .cse28 .cse35 .cse6 .cse8 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20 .cse27 .cse29 .cse37 .cse38 .cse39 .cse30 .cse25) (and .cse0 .cse1 .cse26 .cse28 .cse3 .cse6 .cse8 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20 .cse27 .cse37 .cse38 .cse21 .cse30 .cse40 .cse23 .cse25) (and .cse0 .cse1 .cse28 .cse6 .cse8 .cse43 .cse10 .cse12 .cse13 .cse16 .cse17 .cse19 .cse20 .cse27 .cse38 .cse30 .cse25) (and .cse1 .cse26 .cse2 .cse34 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse27 .cse38 .cse21 .cse30 .cse31 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse28 .cse3 .cse6 .cse8 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19 (= ~data~0 ~t_b~0) .cse20 .cse27 .cse29 .cse37 .cse38 .cse21 .cse30 .cse22 .cse25) (and .cse0 .cse1 .cse26 .cse34 .cse28 .cse6 .cse8 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20 .cse27 .cse29 .cse37 .cse38 .cse30 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse34 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse38 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse20 (or (and .cse0 .cse1 .cse26 .cse34 .cse28 .cse6 .cse8 .cse12 .cse36 .cse13 .cse16 .cse17 .cse18 .cse19 .cse27 .cse29 .cse38 .cse39 .cse30 .cse40 .cse25) (and .cse0 .cse1 .cse26 .cse34 .cse28 .cse35 .cse6 .cse8 .cse12 .cse36 .cse13 .cse16 .cse17 .cse18 .cse19 .cse27 .cse29 .cse38 .cse39 .cse30 .cse25)))))) [2023-11-29 00:41:47,485 INFO L899 garLoopResultBuilder]: For program point L514-1(lines 406 690) no Hoare annotation was computed. [2023-11-29 00:41:47,485 INFO L899 garLoopResultBuilder]: For program point L449-1(lines 406 690) no Hoare annotation was computed. [2023-11-29 00:41:47,485 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 129) no Hoare annotation was computed. [2023-11-29 00:41:47,485 INFO L899 garLoopResultBuilder]: For program point start_simulation_returnLabel#1(lines 403 691) no Hoare annotation was computed. [2023-11-29 00:41:47,485 INFO L899 garLoopResultBuilder]: For program point L351(lines 298 396) no Hoare annotation was computed. [2023-11-29 00:41:47,485 INFO L899 garLoopResultBuilder]: For program point L186(lines 186 194) no Hoare annotation was computed. [2023-11-29 00:41:47,485 INFO L899 garLoopResultBuilder]: For program point L616(lines 545 685) no Hoare annotation was computed. [2023-11-29 00:41:47,485 INFO L899 garLoopResultBuilder]: For program point L649-1(lines 545 685) no Hoare annotation was computed. [2023-11-29 00:41:47,485 INFO L899 garLoopResultBuilder]: For program point L385(lines 385 392) no Hoare annotation was computed. [2023-11-29 00:41:47,486 INFO L899 garLoopResultBuilder]: For program point L617(lines 617 621) no Hoare annotation was computed. [2023-11-29 00:41:47,486 INFO L899 garLoopResultBuilder]: For program point L584-1(lines 545 685) no Hoare annotation was computed. [2023-11-29 00:41:47,486 INFO L899 garLoopResultBuilder]: For program point L419-1(lines 406 690) no Hoare annotation was computed. [2023-11-29 00:41:47,486 INFO L899 garLoopResultBuilder]: For program point L122(lines 122 128) no Hoare annotation was computed. [2023-11-29 00:41:47,486 INFO L895 garLoopResultBuilder]: At program point L122-2(lines 87 130) the Hoare annotation is: (let ((.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (= ~wb_pc~0 1)) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~e_e~0 0))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_e~0 1))) (.cse7 (not (= ~e_wl~0 1))) (.cse8 (= ~c1_i~0 1)) (.cse9 (= ~e_c~0 2)) (.cse10 (= ~c2_i~0 1)) (.cse17 (= ~e_f~0 2)) (.cse11 (= ~c1_pc~0 1)) (.cse12 (not (= ~wb_st~0 0))) (.cse14 (= ~c2_pc~0 1)) (.cse15 (not (= ~e_wl~0 0))) (.cse16 (= ~wb_i~0 1))) (or (and (let ((.cse13 (not (= ~r_st~0 0)))) (or (and .cse0 .cse1 .cse2 (= (+ ~t_b~0 2) ~data~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~data~0 ~t_b~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~data~0 (+ ~t_b~0 1)) .cse16))) .cse17 (= 2 ~wl_pc~0)) (and .cse0 .cse1 (not (= ~c1_st~0 0)) (= ~d~0 0) (not (= ~c2_st~0 0)) .cse2 .cse3 (= ~t_b~0 0) .cse4 (= ~data~0 0) (not (= 0 ~wl_pc~0)) .cse5 .cse6 (= ~r_st~0 2) .cse7 .cse8 .cse9 .cse10 .cse17 .cse11 .cse12 .cse14 (= ~processed~0 0) .cse15 (= ~c_req_up~0 ~r_i~0) .cse16))) [2023-11-29 00:41:47,486 INFO L899 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2023-11-29 00:41:47,486 INFO L899 garLoopResultBuilder]: For program point L552(lines 552 562) no Hoare annotation was computed. [2023-11-29 00:41:47,486 INFO L899 garLoopResultBuilder]: For program point L519-1(lines 406 690) no Hoare annotation was computed. [2023-11-29 00:41:47,486 INFO L899 garLoopResultBuilder]: For program point L552-2(lines 552 562) no Hoare annotation was computed. [2023-11-29 00:41:47,486 INFO L899 garLoopResultBuilder]: For program point L321(lines 298 396) no Hoare annotation was computed. [2023-11-29 00:41:47,486 INFO L899 garLoopResultBuilder]: For program point L189(lines 189 193) no Hoare annotation was computed. [2023-11-29 00:41:47,486 INFO L899 garLoopResultBuilder]: For program point $Ultimate##183(lines 204 219) no Hoare annotation was computed. [2023-11-29 00:41:47,486 INFO L899 garLoopResultBuilder]: For program point L553(lines 553 558) no Hoare annotation was computed. [2023-11-29 00:41:47,487 INFO L899 garLoopResultBuilder]: For program point L487(lines 406 690) no Hoare annotation was computed. [2023-11-29 00:41:47,487 INFO L899 garLoopResultBuilder]: For program point L553-2(lines 553 558) no Hoare annotation was computed. [2023-11-29 00:41:47,487 INFO L899 garLoopResultBuilder]: For program point L454-1(lines 406 690) no Hoare annotation was computed. [2023-11-29 00:41:47,487 INFO L899 garLoopResultBuilder]: For program point L355(lines 355 362) no Hoare annotation was computed. [2023-11-29 00:41:47,487 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 00:41:47,487 INFO L899 garLoopResultBuilder]: For program point L488(lines 488 492) no Hoare annotation was computed. [2023-11-29 00:41:47,487 INFO L899 garLoopResultBuilder]: For program point L654-1(lines 545 685) no Hoare annotation was computed. [2023-11-29 00:41:47,487 INFO L899 garLoopResultBuilder]: For program point $Ultimate##44(lines 477 485) no Hoare annotation was computed. [2023-11-29 00:41:47,487 INFO L895 garLoopResultBuilder]: At program point L159-1(lines 152 175) the Hoare annotation is: (let ((.cse21 (= ~wb_st~0 0)) (.cse3 (= ~c2_st~0 0)) (.cse20 (= 0 ~wl_pc~0)) (.cse36 (+ ~t_b~0 1)) (.cse37 (+ ~t_b~0 2))) (let ((.cse35 (= .cse37 ~data~0)) (.cse34 (= ~data~0 .cse36)) (.cse38 (not (= ~e_c~0 0))) (.cse2 (= ~d~0 0)) (.cse4 (= ~c2_pc~0 0)) (.cse6 (= ~t_b~0 0)) (.cse8 (= ~data~0 0)) (.cse26 (not (= 2 ~wl_pc~0))) (.cse27 (not .cse20)) (.cse11 (= ~wb_pc~0 0)) (.cse12 (= ~r_st~0 2)) (.cse18 (= ~processed~0 0)) (.cse24 (not (= 0 ~wl_st~0))) (.cse0 (not (= ~e_g~0 0))) (.cse1 (not (= ~c1_st~0 0))) (.cse25 (not .cse3)) (.cse29 (= ~wb_pc~0 1)) (.cse5 (not (= ~e_g~0 1))) (.cse7 (not (= ~e_e~0 0))) (.cse9 (not (= ~r_i~0 1))) (.cse10 (not (= ~e_e~0 1))) (.cse13 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_i~0 1)) (.cse15 (= ~e_c~0 2)) (.cse16 (= ~c2_i~0 1)) (.cse17 (= ~e_f~0 2)) (.cse31 (= ~c1_pc~0 1)) (.cse30 (not .cse21)) (.cse32 (not (= ~r_st~0 0))) (.cse28 (= ~c2_pc~0 1)) (.cse19 (not (= ~e_wl~0 0))) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse23 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse24 .cse0 .cse1 .cse2 .cse25 .cse5 .cse6 .cse7 .cse8 .cse26 .cse27 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse18 .cse21 .cse22 .cse23) (and .cse24 .cse0 .cse1 .cse2 .cse29 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse26 .cse27 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse22 .cse23) (and (let ((.cse33 (or (= ~c_t~0 .cse36) (= .cse37 ~c_t~0)))) (or (and .cse24 .cse0 .cse1 .cse25 .cse29 .cse5 .cse7 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16 .cse31 .cse30 .cse32 .cse28 .cse33 .cse19 .cse34 .cse23) (and .cse24 .cse0 .cse1 .cse25 .cse29 .cse35 .cse5 .cse7 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16 .cse31 .cse30 .cse32 .cse28 .cse33 .cse19 .cse23))) .cse17) (and .cse0 .cse1 .cse2 .cse29 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20 .cse22 .cse23) (and .cse24 .cse0 .cse1 .cse2 .cse25 .cse29 .cse5 .cse6 .cse7 .cse8 .cse26 .cse27 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse28 .cse18 .cse22 .cse23) (and .cse24 .cse0 .cse5 .cse7 .cse38 .cse9 .cse10 .cse13 .cse14 .cse16 .cse17 .cse19 .cse20 .cse23) (and .cse24 .cse0 .cse1 .cse25 .cse29 .cse35 .cse5 .cse7 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse31 .cse32 .cse28 .cse18 .cse19 .cse21 .cse23) (and .cse0 .cse1 .cse2 .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse24 .cse0 .cse1 .cse29 .cse3 .cse5 .cse7 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse31 .cse32 .cse28 .cse18 .cse19 .cse34 .cse21 .cse23) (and .cse0 .cse1 .cse2 .cse25 .cse29 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse28 .cse18 .cse19 .cse20 .cse22 .cse23) (and .cse24 .cse0 .cse29 .cse5 .cse7 .cse38 .cse26 .cse9 .cse10 .cse13 .cse14 .cse16 .cse17 .cse31 .cse28 .cse19 .cse23) (and .cse24 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse26 .cse27 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse21 .cse22 .cse23) (and .cse24 .cse0 .cse1 .cse25 .cse29 .cse5 .cse7 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse31 .cse30 .cse32 .cse28 .cse19 .cse22 .cse23)))) [2023-11-29 00:41:47,487 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 101) no Hoare annotation was computed. [2023-11-29 00:41:47,487 INFO L899 garLoopResultBuilder]: For program point L93-1(lines 87 130) no Hoare annotation was computed. [2023-11-29 00:41:47,487 INFO L899 garLoopResultBuilder]: For program point $Ultimate##254(lines 597 605) no Hoare annotation was computed. [2023-11-29 00:41:47,487 INFO L899 garLoopResultBuilder]: For program point L424-1(lines 406 690) no Hoare annotation was computed. [2023-11-29 00:41:47,487 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 332) no Hoare annotation was computed. [2023-11-29 00:41:47,488 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 98) no Hoare annotation was computed. [2023-11-29 00:41:47,488 INFO L899 garLoopResultBuilder]: For program point write_loop_returnLabel#1(lines 62 136) no Hoare annotation was computed. [2023-11-29 00:41:47,488 INFO L899 garLoopResultBuilder]: For program point L590(lines 590 594) no Hoare annotation was computed. [2023-11-29 00:41:47,488 INFO L899 garLoopResultBuilder]: For program point L524-1(lines 406 690) no Hoare annotation was computed. [2023-11-29 00:41:47,488 INFO L899 garLoopResultBuilder]: For program point L459-1(lines 406 690) no Hoare annotation was computed. [2023-11-29 00:41:47,488 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 00:41:47,488 INFO L899 garLoopResultBuilder]: For program point $Ultimate##159(lines 159 174) no Hoare annotation was computed. [2023-11-29 00:41:47,488 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 170) no Hoare annotation was computed. [2023-11-29 00:41:47,488 INFO L899 garLoopResultBuilder]: For program point L162-1(lines 162 170) no Hoare annotation was computed. [2023-11-29 00:41:47,488 INFO L899 garLoopResultBuilder]: For program point L625(lines 545 685) no Hoare annotation was computed. [2023-11-29 00:41:47,488 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 167) no Hoare annotation was computed. [2023-11-29 00:41:47,488 INFO L899 garLoopResultBuilder]: For program point eval_returnLabel#1(lines 289 402) no Hoare annotation was computed. [2023-11-29 00:41:47,488 INFO L899 garLoopResultBuilder]: For program point L626(lines 626 630) no Hoare annotation was computed. [2023-11-29 00:41:47,488 INFO L899 garLoopResultBuilder]: For program point L659-1(lines 545 685) no Hoare annotation was computed. [2023-11-29 00:41:47,488 INFO L899 garLoopResultBuilder]: For program point $Ultimate##219(lines 273 281) no Hoare annotation was computed. [2023-11-29 00:41:47,488 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 23) no Hoare annotation was computed. [2023-11-29 00:41:47,489 INFO L899 garLoopResultBuilder]: For program point L429-1(lines 406 690) no Hoare annotation was computed. [2023-11-29 00:41:47,489 INFO L899 garLoopResultBuilder]: For program point L231(lines 231 239) no Hoare annotation was computed. [2023-11-29 00:41:47,489 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 78) no Hoare annotation was computed. [2023-11-29 00:41:47,489 INFO L899 garLoopResultBuilder]: For program point L496(lines 406 690) no Hoare annotation was computed. [2023-11-29 00:41:47,489 INFO L899 garLoopResultBuilder]: For program point L529-1(lines 406 690) no Hoare annotation was computed. [2023-11-29 00:41:47,489 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 282) no Hoare annotation was computed. [2023-11-29 00:41:47,489 INFO L899 garLoopResultBuilder]: For program point L497(lines 497 501) no Hoare annotation was computed. [2023-11-29 00:41:47,489 INFO L899 garLoopResultBuilder]: For program point L464-1(lines 406 690) no Hoare annotation was computed. [2023-11-29 00:41:47,489 INFO L899 garLoopResultBuilder]: For program point L299(lines 298 396) no Hoare annotation was computed. [2023-11-29 00:41:47,489 INFO L899 garLoopResultBuilder]: For program point L266(lines 266 270) no Hoare annotation was computed. [2023-11-29 00:41:47,492 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:41:47,493 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:41:47,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:41:47 BoogieIcfgContainer [2023-11-29 00:41:47,571 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:41:47,572 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:41:47,572 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:41:47,572 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:41:47,573 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:36:15" (3/4) ... [2023-11-29 00:41:47,575 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 00:41:47,587 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-29 00:41:47,588 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-29 00:41:47,589 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 00:41:47,590 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 00:41:47,801 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e755ea4-31c1-441a-90d5-06b2b8721a6d/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 00:41:47,801 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e755ea4-31c1-441a-90d5-06b2b8721a6d/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 00:41:47,801 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:41:47,802 INFO L158 Benchmark]: Toolchain (without parser) took 333191.96ms. Allocated memory was 161.5MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 107.1MB in the beginning and 587.2MB in the end (delta: -480.1MB). Peak memory consumption was 878.1MB. Max. memory is 16.1GB. [2023-11-29 00:41:47,802 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:41:47,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.38ms. Allocated memory is still 161.5MB. Free memory was 107.1MB in the beginning and 91.7MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 00:41:47,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.83ms. Allocated memory is still 161.5MB. Free memory was 91.7MB in the beginning and 89.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:41:47,803 INFO L158 Benchmark]: Boogie Preprocessor took 62.86ms. Allocated memory is still 161.5MB. Free memory was 89.5MB in the beginning and 86.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 00:41:47,803 INFO L158 Benchmark]: RCFGBuilder took 721.93ms. Allocated memory is still 161.5MB. Free memory was 86.4MB in the beginning and 115.7MB in the end (delta: -29.3MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2023-11-29 00:41:47,804 INFO L158 Benchmark]: TraceAbstraction took 331683.60ms. Allocated memory was 161.5MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 115.1MB in the beginning and 596.6MB in the end (delta: -481.5MB). Peak memory consumption was 924.4MB. Max. memory is 16.1GB. [2023-11-29 00:41:47,804 INFO L158 Benchmark]: Witness Printer took 229.59ms. Allocated memory is still 1.5GB. Free memory was 596.6MB in the beginning and 587.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-29 00:41:47,805 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.16ms. Allocated memory is still 113.2MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 425.38ms. Allocated memory is still 161.5MB. Free memory was 107.1MB in the beginning and 91.7MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.83ms. Allocated memory is still 161.5MB. Free memory was 91.7MB in the beginning and 89.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.86ms. Allocated memory is still 161.5MB. Free memory was 89.5MB in the beginning and 86.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 721.93ms. Allocated memory is still 161.5MB. Free memory was 86.4MB in the beginning and 115.7MB in the end (delta: -29.3MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * TraceAbstraction took 331683.60ms. Allocated memory was 161.5MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 115.1MB in the beginning and 596.6MB in the end (delta: -481.5MB). Peak memory consumption was 924.4MB. Max. memory is 16.1GB. * Witness Printer took 229.59ms. Allocated memory is still 1.5GB. Free memory was 596.6MB in the beginning and 587.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. 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 - PositiveResult [Line: 23]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 120 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 331.5s, OverallIterations: 36, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 308.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10711 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10711 mSDsluCounter, 20584 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13666 mSDsCounter, 225 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2895 IncrementalHoareTripleChecker+Invalid, 3120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 225 mSolverCounterUnsat, 6918 mSDtfsCounter, 2895 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 568 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5181occurred in iteration=21, InterpolantAutomatonStates: 188, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.4s AutomataMinimizationTime, 36 MinimizatonAttempts, 8205 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 259 NumberOfFragments, 6824 HoareAnnotationTreeSize, 6 FomulaSimplifications, 4772324 FormulaSimplificationTreeSizeReduction, 296.2s HoareSimplificationTime, 6 FomulaSimplificationsInter, 579383 FormulaSimplificationTreeSizeReductionInter, 12.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 3554 NumberOfCodeBlocks, 3554 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3696 ConstructedInterpolants, 0 QuantifiedInterpolants, 7739 SizeOfPredicates, 6 NumberOfNonLiveVariables, 462 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 38 InterpolantComputations, 35 PerfectInterpolantSequences, 2052/2177 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 545]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!((e_g == 0)) && !((c1_st == 0))) && (d == 0)) && !((c2_st == 0))) && (wb_pc == 1)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((2 == wl_pc))) && !((0 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((wb_st == 0))) && (c2_pc == 1)) && (processed == 0)) && !((e_wl == 0))) && (c_req_up == r_i)) && (wb_i == 1)) || (((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((e_g == 1))) && !((e_e == 0))) && !((e_c == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && !((e_wl == 0))) && (0 == wl_pc)) && (wb_i == 1))) || ((((((((((((((((((((((((!((e_g == 0)) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((r_i == 1))) && !((e_e == 1))) && (wb_pc == 0)) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (processed == 0)) && !((e_wl == 0))) && (c1_st == 0)) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && (wb_pc == 1)) && !((e_g == 1))) && !((e_e == 0))) && !((e_c == 0))) && !((2 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (c2_pc == 1)) && !((e_wl == 0))) && (wb_i == 1))) || ((e_f == 2) && (((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && !((c2_st == 0))) && (wb_pc == 1)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && (((t_b + 2) == c) || ((t_b + 1) == c))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (c1_pc == 1)) && !((wb_st == 0))) && (c2_pc == 1)) && ((c_t == (t_b + 1)) || ((t_b + 2) == c_t))) && !((e_wl == 0))) && (data == (t_b + 1))) && (wb_i == 1)) || ((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && !((c2_st == 0))) && (wb_pc == 1)) && ((t_b + 2) == data)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && (((t_b + 2) == c) || ((t_b + 1) == c))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (c1_pc == 1)) && !((wb_st == 0))) && (c2_pc == 1)) && ((c_t == (t_b + 1)) || ((t_b + 2) == c_t))) && !((e_wl == 0))) && (wb_i == 1))))) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((!((e_g == 0)) && !((c1_st == 0))) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((r_i == 1))) && !((e_e == 1))) && (wb_pc == 0)) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (processed == 0)) && !((e_wl == 0))) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1)) || ((((((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && (d == 0)) && !((c2_st == 0))) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((2 == wl_pc))) && !((0 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && (wb_pc == 0)) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c2_pc == 1)) && (processed == 0)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && (d == 0)) && (wb_pc == 1)) && (c2_st == 0)) && (c2_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((2 == wl_pc))) && !((0 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && !((wb_st == 0))) && (processed == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && !((c2_st == 0))) && (wb_pc == 1)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (c1_pc == 1)) && !((wb_st == 0))) && !((r_st == 0))) && (c2_pc == 1)) && ((c_t == (t_b + 1)) || ((t_b + 2) == c_t))) && !((e_wl == 0))) && (data == (t_b + 1))) && (wb_i == 1)) || ((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && !((c2_st == 0))) && (wb_pc == 1)) && ((t_b + 2) == data)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (c1_pc == 1)) && !((wb_st == 0))) && !((r_st == 0))) && (c2_pc == 1)) && ((c_t == (t_b + 1)) || ((t_b + 2) == c_t))) && !((e_wl == 0))) && (wb_i == 1))) && (e_f == 2))) || (((((((((((((((((((((((!((e_g == 0)) && !((c1_st == 0))) && (d == 0)) && (wb_pc == 1)) && (c2_st == 0)) && (c2_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((r_i == 1))) && !((e_e == 1))) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && !((wb_st == 0))) && (processed == 0)) && !((e_wl == 0))) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && (d == 0)) && !((c2_st == 0))) && (wb_pc == 1)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((2 == wl_pc))) && !((0 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && !((wb_st == 0))) && (c2_pc == 1)) && (processed == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((e_g == 1))) && !((e_e == 0))) && !((e_c == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && !((e_wl == 0))) && (0 == wl_pc)) && (wb_i == 1))) || (((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && !((c2_st == 0))) && (wb_pc == 1)) && ((t_b + 2) == data)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((r_st == 0))) && (c2_pc == 1)) && (processed == 0)) && !((e_wl == 0))) && (wb_st == 0)) && (wb_i == 1))) || (((((((((((((((((((((((!((e_g == 0)) && !((c1_st == 0))) && (d == 0)) && !((c2_st == 0))) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((r_i == 1))) && !((e_e == 1))) && (wb_pc == 0)) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c2_pc == 1)) && (processed == 0)) && !((e_wl == 0))) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && (wb_pc == 1)) && (c2_st == 0)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((r_st == 0))) && (c2_pc == 1)) && (processed == 0)) && !((e_wl == 0))) && (data == (t_b + 1))) && (wb_st == 0)) && (wb_i == 1))) || (((((((((((((((((((((((!((e_g == 0)) && !((c1_st == 0))) && (d == 0)) && !((c2_st == 0))) && (wb_pc == 1)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((r_i == 1))) && !((e_e == 1))) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && !((wb_st == 0))) && (c2_pc == 1)) && (processed == 0)) && !((e_wl == 0))) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && (wb_pc == 1)) && !((e_g == 1))) && !((e_e == 0))) && !((e_c == 0))) && !((2 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (c2_pc == 1)) && !((e_wl == 0))) && (wb_i == 1))) || ((((((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((2 == wl_pc))) && !((0 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && (wb_pc == 0)) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (processed == 0)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && !((c2_st == 0))) && (wb_pc == 1)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((wb_st == 0))) && !((r_st == 0))) && (c2_pc == 1)) && !((e_wl == 0))) && (c_req_up == r_i)) && (wb_i == 1))) - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && (wb_pc == 1)) && ((t_b + 2) == data)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (c1_pc == 1)) && !((wb_st == 0))) && !((r_st == 0))) && (c2_pc == 1)) && !((e_wl == 0))) && (wb_i == 1)) || (((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && (wb_pc == 1)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (data == t_b)) && (c1_pc == 1)) && !((wb_st == 0))) && !((r_st == 0))) && (c2_pc == 1)) && !((e_wl == 0))) && (wb_i == 1))) || (((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && (wb_pc == 1)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (c1_pc == 1)) && !((wb_st == 0))) && !((r_st == 0))) && (c2_pc == 1)) && !((e_wl == 0))) && (data == (t_b + 1))) && (wb_i == 1))) && (e_f == 2)) && (2 == wl_pc)) || (((((((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && (d == 0)) && !((c2_st == 0))) && (wb_pc == 1)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((0 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((wb_st == 0))) && (c2_pc == 1)) && (processed == 0)) && !((e_wl == 0))) && (c_req_up == r_i)) && (wb_i == 1))) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c2_st == 0))) && (wb_pc == 1)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((r_st == 0))) && (c2_pc == 1)) && (processed == 0)) && !((e_wl == 0))) && (data == (t_b + 1))) && (c1_st == 0)) && (wb_st == 0)) && (wb_i == 1)) || (((((((((((((((((((((((!((e_g == 0)) && (d == 0)) && !((c2_st == 0))) && (c1_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((r_i == 1))) && !((e_e == 1))) && (wb_pc == 0)) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (processed == 0)) && !((e_wl == 0))) && (c1_st == 0)) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((((!((e_g == 0)) && (d == 0)) && !((c2_st == 0))) && (wb_pc == 1)) && (c1_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((r_i == 1))) && !((e_e == 1))) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && !((wb_st == 0))) && (processed == 0)) && !((e_wl == 0))) && (c1_st == 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && !((c2_st == 0))) && (wb_pc == 1)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (c1_pc == 1)) && !((wb_st == 0))) && !((r_st == 0))) && (c2_pc == 1)) && ((c_t == (t_b + 1)) || ((t_b + 2) == c_t))) && !((e_wl == 0))) && (data == (t_b + 1))) && (wb_i == 1)) || ((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && !((c2_st == 0))) && (wb_pc == 1)) && ((t_b + 2) == data)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (c1_pc == 1)) && !((wb_st == 0))) && !((r_st == 0))) && (c2_pc == 1)) && ((c_t == (t_b + 1)) || ((t_b + 2) == c_t))) && !((e_wl == 0))) && (wb_i == 1))) && (e_f == 2))) || (((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((e_g == 1))) && !((e_e == 0))) && !((e_c == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && !((e_wl == 0))) && (0 == wl_pc)) && (wb_i == 1))) || ((((((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && (d == 0)) && !((c2_st == 0))) && (c1_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((2 == wl_pc))) && !((0 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && (wb_pc == 0)) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (processed == 0)) && (c1_st == 0)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((((!((e_g == 0)) && !((c1_st == 0))) && (d == 0)) && !((c2_st == 0))) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((r_i == 1))) && !((e_e == 1))) && (wb_pc == 0)) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (processed == 0)) && !((e_wl == 0))) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && !((c2_st == 0))) && (wb_pc == 1)) && ((t_b + 2) == data)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((r_st == 0))) && (c2_pc == 1)) && (processed == 0)) && !((e_wl == 0))) && (wb_st == 0)) && (wb_i == 1))) || ((((((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && (d == 0)) && !((c2_st == 0))) && (wb_pc == 1)) && (c1_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((2 == wl_pc))) && !((0 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && !((wb_st == 0))) && (processed == 0)) && (c1_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && (wb_pc == 1)) && !((e_g == 1))) && !((e_e == 0))) && !((e_c == 0))) && !((2 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (c2_pc == 1)) && !((e_wl == 0))) && (wb_i == 1))) || ((((((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && (d == 0)) && !((c2_st == 0))) && (wb_pc == 1)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((2 == wl_pc))) && !((0 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((wb_st == 0))) && (processed == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((((!((e_g == 0)) && !((c1_st == 0))) && (d == 0)) && !((c2_st == 0))) && (wb_pc == 1)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((r_i == 1))) && !((e_e == 1))) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((wb_st == 0))) && (processed == 0)) && !((e_wl == 0))) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && (d == 0)) && !((c2_st == 0))) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((2 == wl_pc))) && !((0 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && (wb_pc == 0)) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (processed == 0)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && !((c2_st == 0))) && (wb_pc == 1)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((wb_st == 0))) && !((r_st == 0))) && (c2_pc == 1)) && !((e_wl == 0))) && (c_req_up == r_i)) && (wb_i == 1))) - InvariantResult [Line: 242]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((!((e_g == 0)) && (d == 0)) && !((c2_st == 0))) && (c1_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((r_i == 1))) && !((e_e == 1))) && (wb_pc == 0)) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && !((wb_st == 0))) && (c2_pc == 1)) && (processed == 0)) && !((e_wl == 0))) && (c1_st == 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1)) || (((((((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && (d == 0)) && !((c2_st == 0))) && (c1_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((2 == wl_pc))) && !((0 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && (wb_pc == 0)) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && !((wb_st == 0))) && (c2_pc == 1)) && (processed == 0)) && (c1_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c2_st == 0))) && (wb_pc == 1)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((wb_st == 0))) && !((r_st == 0))) && (c2_pc == 1)) && ((c_t == (t_b + 1)) || ((t_b + 2) == c_t))) && !((e_wl == 0))) && (data == (t_b + 1))) && (c1_st == 0)) && (wb_i == 1))) || ((((((((((((((((((((((((!((e_g == 0)) && !((c1_st == 0))) && (d == 0)) && !((c2_st == 0))) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((r_i == 1))) && !((e_e == 1))) && (wb_pc == 0)) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((wb_st == 0))) && (c2_pc == 1)) && (processed == 0)) && !((e_wl == 0))) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && (d == 0)) && !((c2_st == 0))) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((2 == wl_pc))) && !((0 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && (wb_pc == 0)) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((wb_st == 0))) && (c2_pc == 1)) && (processed == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((e_g == 1))) && !((e_e == 0))) && !((e_c == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && !((e_wl == 0))) && (0 == wl_pc)) && (wb_i == 1))) || (((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && !((c2_st == 0))) && (wb_pc == 1)) && ((t_b + 2) == data)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((wb_st == 0))) && !((r_st == 0))) && (c2_pc == 1)) && ((t_b + 2) == c_t)) && !((e_wl == 0))) && (wb_i == 1))) || ((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && (wb_pc == 1)) && !((e_g == 1))) && !((e_e == 0))) && !((e_c == 0))) && !((2 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (c2_pc == 1)) && !((e_wl == 0))) && (wb_i == 1))) || (((((((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((2 == wl_pc))) && !((0 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && (wb_pc == 0)) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && !((wb_st == 0))) && (processed == 0)) && (c1_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((2 == wl_pc))) && !((0 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && (wb_pc == 0)) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((wb_st == 0))) && (processed == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && (wb_pc == 1)) && (c2_st == 0)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((wb_st == 0))) && !((r_st == 0))) && (c2_pc == 1)) && ((c_t == (t_b + 1)) || ((t_b + 2) == c_t))) && !((e_wl == 0))) && (data == (t_b + 1))) && (wb_i == 1))) || ((((((((((((((((((((((((!((e_g == 0)) && !((c1_st == 0))) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((r_i == 1))) && !((e_e == 1))) && (wb_pc == 0)) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((wb_st == 0))) && (processed == 0)) && !((e_wl == 0))) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((!((e_g == 0)) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((r_i == 1))) && !((e_e == 1))) && (wb_pc == 0)) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && !((wb_st == 0))) && (processed == 0)) && !((e_wl == 0))) && (c1_st == 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((2 == wl_pc))) && !((0 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && (wb_pc == 0)) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (processed == 0)) && (c1_st == 0)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1)) || (((((((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((2 == wl_pc))) && !((0 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && (wb_pc == 0)) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (processed == 0)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((!((e_g == 0)) && !((c1_st == 0))) && (d == 0)) && (wb_pc == 1)) && (c2_st == 0)) && (c2_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((r_i == 1))) && !((e_e == 1))) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((wb_st == 0))) && (processed == 0)) && !((e_wl == 0))) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || (((e_f == 2) && (2 == wl_pc)) && ((((((((((((((((((((((!((e_g == 0)) && !((c1_st == 0))) && (((t_b + 1) == d) || ((t_b + 2) == d))) && !((c2_st == 0))) && (wb_pc == 1)) && ((t_b + 2) == data)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && (((t_b + 2) == c) || ((t_b + 1) == c))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (c1_pc == 1)) && !((wb_st == 0))) && !((r_st == 0))) && (c2_pc == 1)) && ((c_t == (t_b + 1)) || ((t_b + 2) == c_t))) && !((e_wl == 0))) && (wb_i == 1)) || (((((((((((((((((((((!((e_g == 0)) && !((c1_st == 0))) && (((t_b + 1) == d) || ((t_b + 2) == d))) && !((c2_st == 0))) && (wb_pc == 1)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && (((t_b + 2) == c) || ((t_b + 1) == c))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (c1_pc == 1)) && !((wb_st == 0))) && !((r_st == 0))) && (c2_pc == 1)) && ((c_t == (t_b + 1)) || ((t_b + 2) == c_t))) && !((e_wl == 0))) && (data == (t_b + 1))) && (wb_i == 1))))) || (((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c2_st == 0))) && (wb_pc == 1)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((r_st == 0))) && (c2_pc == 1)) && (processed == 0)) && !((e_wl == 0))) && (data == (t_b + 1))) && (c1_st == 0)) && (wb_st == 0)) && (wb_i == 1))) || ((((((((((((((((((((((((!((e_g == 0)) && (d == 0)) && !((c2_st == 0))) && (wb_pc == 1)) && (c1_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((r_i == 1))) && !((e_e == 1))) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && !((wb_st == 0))) && (c2_pc == 1)) && (processed == 0)) && !((e_wl == 0))) && (c1_st == 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && (d == 0)) && !((c2_st == 0))) && (wb_pc == 1)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((2 == wl_pc))) && !((0 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((wb_st == 0))) && (c2_pc == 1)) && (processed == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && (d == 0)) && !((c2_st == 0))) && (wb_pc == 1)) && (c1_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((2 == wl_pc))) && !((0 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && !((wb_st == 0))) && (c2_pc == 1)) && (processed == 0)) && (c1_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && (d == 0)) && (wb_pc == 1)) && (c2_st == 0)) && (c2_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((2 == wl_pc))) && !((0 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((wb_st == 0))) && (processed == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((!((e_g == 0)) && (d == 0)) && (wb_pc == 1)) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((r_i == 1))) && !((e_e == 1))) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && !((wb_st == 0))) && (processed == 0)) && !((e_wl == 0))) && (c1_st == 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((!((e_g == 0)) && (d == 0)) && !((c2_st == 0))) && (c1_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((r_i == 1))) && !((e_e == 1))) && (wb_pc == 0)) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c2_pc == 1)) && (processed == 0)) && !((e_wl == 0))) && (c1_st == 0)) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((e_g == 1))) && !((e_e == 0))) && !((e_c == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && !((e_wl == 0))) && (0 == wl_pc)) && (wb_i == 1))) || ((((((((((((((((((((((((!((e_g == 0)) && !((c1_st == 0))) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((r_i == 1))) && !((e_e == 1))) && (wb_pc == 0)) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (processed == 0)) && !((e_wl == 0))) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c2_st == 0))) && (wb_pc == 1)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((wb_st == 0))) && !((r_st == 0))) && (c2_pc == 1)) && ((c_t == (t_b + 1)) || ((t_b + 2) == c_t))) && !((e_wl == 0))) && (data == (t_b + 1))) && (wb_i == 1))) || (((((((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && (d == 0)) && !((c2_st == 0))) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((2 == wl_pc))) && !((0 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && (wb_pc == 0)) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (c2_pc == 1)) && (processed == 0)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && !((c2_st == 0))) && (wb_pc == 1)) && ((t_b + 2) == data)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((r_st == 0))) && (c2_pc == 1)) && (processed == 0)) && !((e_wl == 0))) && (wb_st == 0)) && (wb_i == 1))) || (((((((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && (d == 0)) && (wb_pc == 1)) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((2 == wl_pc))) && !((0 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && !((wb_st == 0))) && (processed == 0)) && (c1_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && (wb_pc == 1)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((wb_st == 0))) && !((r_st == 0))) && (c2_pc == 1)) && ((c_t == (t_b + 1)) || ((t_b + 2) == c_t))) && !((e_wl == 0))) && (data == (t_b + 1))) && (wb_i == 1))) || ((((((((((((((((((((((((!((e_g == 0)) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((r_i == 1))) && !((e_e == 1))) && (wb_pc == 0)) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (processed == 0)) && !((e_wl == 0))) && (c1_st == 0)) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((!((e_g == 0)) && !((c1_st == 0))) && (d == 0)) && !((c2_st == 0))) && (wb_pc == 1)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((2 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((wb_st == 0))) && (c2_pc == 1)) && (processed == 0)) && !((e_wl == 0))) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && !((c2_st == 0))) && (wb_pc == 1)) && ((t_b + 2) == data)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((wb_st == 0))) && !((r_st == 0))) && (c2_pc == 1)) && ((c_t == (t_b + 1)) || ((t_b + 2) == c_t))) && !((e_wl == 0))) && (wb_i == 1))) || (((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && (wb_pc == 1)) && (c2_st == 0)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((r_st == 0))) && (c2_pc == 1)) && (processed == 0)) && !((e_wl == 0))) && (data == (t_b + 1))) && (wb_st == 0)) && (wb_i == 1))) || ((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && (wb_pc == 1)) && !((e_g == 1))) && !((e_e == 0))) && !((e_c == 0))) && !((2 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (c2_pc == 1)) && !((e_wl == 0))) && (wb_i == 1))) || ((((((((((((((((((((((((!((e_g == 0)) && !((c1_st == 0))) && (d == 0)) && !((c2_st == 0))) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((r_i == 1))) && !((e_e == 1))) && (wb_pc == 0)) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (c2_pc == 1)) && (processed == 0)) && !((e_wl == 0))) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && (wb_pc == 1)) && (c2_st == 0)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (data == t_b)) && (e_f == 2)) && (c1_pc == 1)) && !((wb_st == 0))) && !((r_st == 0))) && (c2_pc == 1)) && (processed == 0)) && !((e_wl == 0))) && (c1_st == 0)) && (wb_i == 1))) || ((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && !((c2_st == 0))) && (wb_pc == 1)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && !((wb_st == 0))) && !((r_st == 0))) && (c2_pc == 1)) && !((e_wl == 0))) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && (d == 0)) && !((c2_st == 0))) && (c1_pc == 0)) && !((e_g == 1))) && (t_b == 0)) && !((e_e == 0))) && (data == 0)) && !((2 == wl_pc))) && !((0 == wl_pc))) && !((r_i == 1))) && !((e_e == 1))) && (wb_pc == 0)) && (r_st == 2)) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c2_pc == 1)) && (processed == 0)) && (c1_st == 0)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((e_f == 2) && (((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && !((c2_st == 0))) && (wb_pc == 1)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && (((t_b + 2) == c) || ((t_b + 1) == c))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (c1_pc == 1)) && !((wb_st == 0))) && (c2_pc == 1)) && ((c_t == (t_b + 1)) || ((t_b + 2) == c_t))) && !((e_wl == 0))) && (data == (t_b + 1))) && (wb_i == 1)) || ((((((((((((((((((((!((0 == wl_st)) && !((e_g == 0))) && !((c1_st == 0))) && !((c2_st == 0))) && (wb_pc == 1)) && ((t_b + 2) == data)) && !((e_g == 1))) && !((e_e == 0))) && !((r_i == 1))) && (((t_b + 2) == c) || ((t_b + 1) == c))) && !((e_e == 1))) && !((e_wl == 1))) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (c1_pc == 1)) && !((wb_st == 0))) && (c2_pc == 1)) && ((c_t == (t_b + 1)) || ((t_b + 2) == c_t))) && !((e_wl == 0))) && (wb_i == 1))))) RESULT: Ultimate proved your program to be correct! [2023-11-29 00:41:47,821 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e755ea4-31c1-441a-90d5-06b2b8721a6d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE