./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1f6c198-4b33-4972-8537-328b8e69bcf3/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1f6c198-4b33-4972-8537-328b8e69bcf3/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1f6c198-4b33-4972-8537-328b8e69bcf3/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1f6c198-4b33-4972-8537-328b8e69bcf3/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_15-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1f6c198-4b33-4972-8537-328b8e69bcf3/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1f6c198-4b33-4972-8537-328b8e69bcf3/bin/uautomizer-verify-aQ6SnzHsRB --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 ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:17:43,230 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:17:43,293 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1f6c198-4b33-4972-8537-328b8e69bcf3/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 05:17:43,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:17:43,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:17:43,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:17:43,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:17:43,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:17:43,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:17:43,350 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:17:43,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:17:43,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:17:43,351 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:17:43,351 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:17:43,351 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:17:43,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:17:43,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 05:17:43,351 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:17:43,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:17:43,352 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:17:43,352 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:17:43,352 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 05:17:43,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:17:43,352 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 05:17:43,352 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:17:43,352 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 05:17:43,352 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:17:43,352 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:17:43,353 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:17:43,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:17:43,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:17:43,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:17:43,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:17:43,353 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:17:43,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:17:43,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:17:43,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:17:43,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:17:43,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:17:43,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:17:43,354 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 05:17:43,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 05:17:43,355 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 05:17:43,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 05:17:43,355 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:17:43,355 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:17:43,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:17:43,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:17:43,355 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_b1f6c198-4b33-4972-8537-328b8e69bcf3/bin/uautomizer-verify-aQ6SnzHsRB 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 -> ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 [2024-11-28 05:17:43,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:17:43,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:17:43,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:17:43,688 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:17:43,688 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:17:43,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1f6c198-4b33-4972-8537-328b8e69bcf3/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/locks/test_locks_15-2.c [2024-11-28 05:17:46,632 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1f6c198-4b33-4972-8537-328b8e69bcf3/bin/uautomizer-verify-aQ6SnzHsRB/data/ce854e59d/bb610542bf3d4b9caf7cfab8ec4362d8/FLAGc815ec0e0 [2024-11-28 05:17:46,882 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:17:46,882 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1f6c198-4b33-4972-8537-328b8e69bcf3/sv-benchmarks/c/locks/test_locks_15-2.c [2024-11-28 05:17:46,890 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1f6c198-4b33-4972-8537-328b8e69bcf3/bin/uautomizer-verify-aQ6SnzHsRB/data/ce854e59d/bb610542bf3d4b9caf7cfab8ec4362d8/FLAGc815ec0e0 [2024-11-28 05:17:46,903 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1f6c198-4b33-4972-8537-328b8e69bcf3/bin/uautomizer-verify-aQ6SnzHsRB/data/ce854e59d/bb610542bf3d4b9caf7cfab8ec4362d8 [2024-11-28 05:17:46,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:17:46,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:17:46,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:17:46,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:17:46,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:17:46,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:17:46" (1/1) ... [2024-11-28 05:17:46,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71573260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:46, skipping insertion in model container [2024-11-28 05:17:46,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:17:46" (1/1) ... [2024-11-28 05:17:46,943 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:17:47,136 WARN L250 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_b1f6c198-4b33-4972-8537-328b8e69bcf3/sv-benchmarks/c/locks/test_locks_15-2.c[5628,5641] [2024-11-28 05:17:47,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:17:47,151 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:17:47,189 WARN L250 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_b1f6c198-4b33-4972-8537-328b8e69bcf3/sv-benchmarks/c/locks/test_locks_15-2.c[5628,5641] [2024-11-28 05:17:47,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:17:47,215 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:17:47,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:47 WrapperNode [2024-11-28 05:17:47,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:17:47,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:17:47,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:17:47,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:17:47,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:47" (1/1) ... [2024-11-28 05:17:47,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:47" (1/1) ... [2024-11-28 05:17:47,262 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 207 [2024-11-28 05:17:47,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:17:47,264 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:17:47,264 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:17:47,264 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:17:47,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:47" (1/1) ... [2024-11-28 05:17:47,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:47" (1/1) ... [2024-11-28 05:17:47,279 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:47" (1/1) ... [2024-11-28 05:17:47,301 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]. [2024-11-28 05:17:47,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:47" (1/1) ... [2024-11-28 05:17:47,301 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:47" (1/1) ... [2024-11-28 05:17:47,309 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:47" (1/1) ... [2024-11-28 05:17:47,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:47" (1/1) ... [2024-11-28 05:17:47,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:47" (1/1) ... [2024-11-28 05:17:47,319 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:47" (1/1) ... [2024-11-28 05:17:47,319 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:47" (1/1) ... [2024-11-28 05:17:47,324 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:17:47,325 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:17:47,325 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:17:47,325 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:17:47,329 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:47" (1/1) ... [2024-11-28 05:17:47,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:17:47,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1f6c198-4b33-4972-8537-328b8e69bcf3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:17:47,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1f6c198-4b33-4972-8537-328b8e69bcf3/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:17:47,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1f6c198-4b33-4972-8537-328b8e69bcf3/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:17:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:17:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:17:47,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:17:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 05:17:47,486 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:17:47,488 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:17:47,916 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-28 05:17:47,916 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:17:47,929 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:17:47,929 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 05:17:47,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:17:47 BoogieIcfgContainer [2024-11-28 05:17:47,930 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:17:47,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:17:47,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:17:47,936 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:17:47,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:17:46" (1/3) ... [2024-11-28 05:17:47,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f76cbef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:17:47, skipping insertion in model container [2024-11-28 05:17:47,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:17:47" (2/3) ... [2024-11-28 05:17:47,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f76cbef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:17:47, skipping insertion in model container [2024-11-28 05:17:47,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:17:47" (3/3) ... [2024-11-28 05:17:47,938 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2024-11-28 05:17:47,951 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:17:47,953 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_15-2.c that has 1 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 05:17:48,025 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:17:48,043 INFO L333 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, 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;@76eb8090, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:17:48,044 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 05:17:48,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 54 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:48,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-28 05:17:48,056 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:48,056 INFO L218 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] [2024-11-28 05:17:48,057 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:48,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:48,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1188560455, now seen corresponding path program 1 times [2024-11-28 05:17:48,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:48,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060471554] [2024-11-28 05:17:48,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:48,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:48,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:48,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:48,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060471554] [2024-11-28 05:17:48,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060471554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:48,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:48,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:48,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357406109] [2024-11-28 05:17:48,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:48,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:48,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:48,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:48,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:48,433 INFO L87 Difference]: Start difference. First operand has 55 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 54 states have internal predecessors, (102), 0 states have call successors, (0), 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 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:48,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:48,492 INFO L93 Difference]: Finished difference Result 111 states and 204 transitions. [2024-11-28 05:17:48,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:48,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-28 05:17:48,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:48,503 INFO L225 Difference]: With dead ends: 111 [2024-11-28 05:17:48,503 INFO L226 Difference]: Without dead ends: 99 [2024-11-28 05:17:48,506 INFO L434 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 [2024-11-28 05:17:48,509 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 75 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:48,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 197 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:48,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-28 05:17:48,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 67. [2024-11-28 05:17:48,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 66 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) [2024-11-28 05:17:48,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 126 transitions. [2024-11-28 05:17:48,563 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 126 transitions. Word has length 22 [2024-11-28 05:17:48,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:48,564 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 126 transitions. [2024-11-28 05:17:48,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:48,564 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 126 transitions. [2024-11-28 05:17:48,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-28 05:17:48,565 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:48,565 INFO L218 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] [2024-11-28 05:17:48,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 05:17:48,566 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:48,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:48,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1112262135, now seen corresponding path program 1 times [2024-11-28 05:17:48,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:48,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895215213] [2024-11-28 05:17:48,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:48,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:48,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:48,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895215213] [2024-11-28 05:17:48,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895215213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:48,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:48,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:48,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20822369] [2024-11-28 05:17:48,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:48,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:48,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:48,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:48,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:48,691 INFO L87 Difference]: Start difference. First operand 67 states and 126 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:48,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:48,724 INFO L93 Difference]: Finished difference Result 164 states and 309 transitions. [2024-11-28 05:17:48,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:48,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-28 05:17:48,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:48,726 INFO L225 Difference]: With dead ends: 164 [2024-11-28 05:17:48,726 INFO L226 Difference]: Without dead ends: 99 [2024-11-28 05:17:48,727 INFO L434 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 [2024-11-28 05:17:48,728 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 73 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:48,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 213 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:48,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-28 05:17:48,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2024-11-28 05:17:48,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.8958333333333333) internal successors, (182), 96 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:48,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 182 transitions. [2024-11-28 05:17:48,746 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 182 transitions. Word has length 22 [2024-11-28 05:17:48,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:48,746 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 182 transitions. [2024-11-28 05:17:48,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:48,746 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 182 transitions. [2024-11-28 05:17:48,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-28 05:17:48,750 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:48,750 INFO L218 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] [2024-11-28 05:17:48,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 05:17:48,750 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:48,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:48,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1809543287, now seen corresponding path program 1 times [2024-11-28 05:17:48,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:48,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994756582] [2024-11-28 05:17:48,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:48,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:48,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:48,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:48,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994756582] [2024-11-28 05:17:48,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994756582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:48,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:48,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:48,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931508922] [2024-11-28 05:17:48,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:48,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:48,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:48,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:48,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:48,850 INFO L87 Difference]: Start difference. First operand 97 states and 182 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:48,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:48,887 INFO L93 Difference]: Finished difference Result 150 states and 276 transitions. [2024-11-28 05:17:48,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:48,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-11-28 05:17:48,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:48,891 INFO L225 Difference]: With dead ends: 150 [2024-11-28 05:17:48,891 INFO L226 Difference]: Without dead ends: 102 [2024-11-28 05:17:48,891 INFO L434 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 [2024-11-28 05:17:48,892 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 75 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:48,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 240 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:48,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-28 05:17:48,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2024-11-28 05:17:48,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.8585858585858586) internal successors, (184), 99 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:48,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 184 transitions. [2024-11-28 05:17:48,903 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 184 transitions. Word has length 23 [2024-11-28 05:17:48,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:48,903 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 184 transitions. [2024-11-28 05:17:48,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 184 transitions. [2024-11-28 05:17:48,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-28 05:17:48,904 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:48,904 INFO L218 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] [2024-11-28 05:17:48,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 05:17:48,905 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:48,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:48,906 INFO L85 PathProgramCache]: Analyzing trace with hash 120599545, now seen corresponding path program 1 times [2024-11-28 05:17:48,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:48,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259633218] [2024-11-28 05:17:48,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:48,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:48,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:48,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:48,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259633218] [2024-11-28 05:17:48,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259633218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:48,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:48,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:48,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443781447] [2024-11-28 05:17:48,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:48,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:48,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:48,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:48,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:48,998 INFO L87 Difference]: Start difference. First operand 100 states and 184 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:49,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:49,021 INFO L93 Difference]: Finished difference Result 193 states and 357 transitions. [2024-11-28 05:17:49,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:49,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-11-28 05:17:49,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:49,024 INFO L225 Difference]: With dead ends: 193 [2024-11-28 05:17:49,027 INFO L226 Difference]: Without dead ends: 191 [2024-11-28 05:17:49,028 INFO L434 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 [2024-11-28 05:17:49,029 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 70 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:49,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 185 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:49,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-28 05:17:49,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 133. [2024-11-28 05:17:49,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.856060606060606) internal successors, (245), 132 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:49,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 245 transitions. [2024-11-28 05:17:49,052 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 245 transitions. Word has length 23 [2024-11-28 05:17:49,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:49,053 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 245 transitions. [2024-11-28 05:17:49,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:49,053 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 245 transitions. [2024-11-28 05:17:49,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-28 05:17:49,054 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:49,054 INFO L218 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] [2024-11-28 05:17:49,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 05:17:49,054 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:49,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:49,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1873545161, now seen corresponding path program 1 times [2024-11-28 05:17:49,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:49,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917380580] [2024-11-28 05:17:49,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:49,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:49,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:49,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:49,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917380580] [2024-11-28 05:17:49,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917380580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:49,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:49,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:49,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080193527] [2024-11-28 05:17:49,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:49,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:49,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:49,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:49,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:49,125 INFO L87 Difference]: Start difference. First operand 133 states and 245 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:49,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:49,154 INFO L93 Difference]: Finished difference Result 321 states and 595 transitions. [2024-11-28 05:17:49,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:49,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-11-28 05:17:49,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:49,156 INFO L225 Difference]: With dead ends: 321 [2024-11-28 05:17:49,157 INFO L226 Difference]: Without dead ends: 193 [2024-11-28 05:17:49,157 INFO L434 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 [2024-11-28 05:17:49,158 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 72 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:49,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 214 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:49,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-28 05:17:49,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2024-11-28 05:17:49,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 1.8473684210526315) internal successors, (351), 190 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:49,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 351 transitions. [2024-11-28 05:17:49,171 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 351 transitions. Word has length 23 [2024-11-28 05:17:49,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:49,171 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 351 transitions. [2024-11-28 05:17:49,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:49,171 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 351 transitions. [2024-11-28 05:17:49,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-28 05:17:49,172 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:49,172 INFO L218 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] [2024-11-28 05:17:49,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 05:17:49,172 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:49,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:49,173 INFO L85 PathProgramCache]: Analyzing trace with hash -556169332, now seen corresponding path program 1 times [2024-11-28 05:17:49,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:49,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177263760] [2024-11-28 05:17:49,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:49,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:49,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:49,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:49,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177263760] [2024-11-28 05:17:49,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177263760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:49,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:49,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:49,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289140436] [2024-11-28 05:17:49,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:49,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:49,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:49,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:49,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:49,226 INFO L87 Difference]: Start difference. First operand 191 states and 351 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:49,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:49,252 INFO L93 Difference]: Finished difference Result 288 states and 526 transitions. [2024-11-28 05:17:49,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:49,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-28 05:17:49,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:49,255 INFO L225 Difference]: With dead ends: 288 [2024-11-28 05:17:49,255 INFO L226 Difference]: Without dead ends: 195 [2024-11-28 05:17:49,255 INFO L434 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 [2024-11-28 05:17:49,257 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 74 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:49,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 236 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:49,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-28 05:17:49,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2024-11-28 05:17:49,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.828125) internal successors, (351), 192 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 351 transitions. [2024-11-28 05:17:49,273 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 351 transitions. Word has length 24 [2024-11-28 05:17:49,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:49,273 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 351 transitions. [2024-11-28 05:17:49,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:49,274 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 351 transitions. [2024-11-28 05:17:49,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-28 05:17:49,275 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:49,275 INFO L218 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] [2024-11-28 05:17:49,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 05:17:49,275 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:49,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:49,276 INFO L85 PathProgramCache]: Analyzing trace with hash 2049854222, now seen corresponding path program 1 times [2024-11-28 05:17:49,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:49,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914233754] [2024-11-28 05:17:49,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:49,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:49,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:49,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:49,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914233754] [2024-11-28 05:17:49,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914233754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:49,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:49,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:49,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653370866] [2024-11-28 05:17:49,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:49,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:49,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:49,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:49,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:49,353 INFO L87 Difference]: Start difference. First operand 193 states and 351 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:49,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:49,379 INFO L93 Difference]: Finished difference Result 561 states and 1025 transitions. [2024-11-28 05:17:49,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:49,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-28 05:17:49,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:49,382 INFO L225 Difference]: With dead ends: 561 [2024-11-28 05:17:49,382 INFO L226 Difference]: Without dead ends: 375 [2024-11-28 05:17:49,383 INFO L434 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 [2024-11-28 05:17:49,383 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 72 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:49,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 187 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:49,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-28 05:17:49,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2024-11-28 05:17:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 1.814516129032258) internal successors, (675), 372 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 675 transitions. [2024-11-28 05:17:49,442 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 675 transitions. Word has length 24 [2024-11-28 05:17:49,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:49,443 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 675 transitions. [2024-11-28 05:17:49,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:49,443 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 675 transitions. [2024-11-28 05:17:49,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-28 05:17:49,444 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:49,444 INFO L218 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] [2024-11-28 05:17:49,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 05:17:49,448 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:49,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:49,448 INFO L85 PathProgramCache]: Analyzing trace with hash -250968368, now seen corresponding path program 1 times [2024-11-28 05:17:49,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:49,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586603328] [2024-11-28 05:17:49,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:49,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:49,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:49,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:49,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586603328] [2024-11-28 05:17:49,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586603328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:49,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:49,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:49,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039150506] [2024-11-28 05:17:49,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:49,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:49,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:49,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:49,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:49,496 INFO L87 Difference]: Start difference. First operand 373 states and 675 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:49,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:49,515 INFO L93 Difference]: Finished difference Result 481 states and 877 transitions. [2024-11-28 05:17:49,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:49,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-28 05:17:49,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:49,518 INFO L225 Difference]: With dead ends: 481 [2024-11-28 05:17:49,518 INFO L226 Difference]: Without dead ends: 479 [2024-11-28 05:17:49,518 INFO L434 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 [2024-11-28 05:17:49,519 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 67 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:49,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 260 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:49,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-11-28 05:17:49,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 373. [2024-11-28 05:17:49,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 1.803763440860215) internal successors, (671), 372 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:49,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 671 transitions. [2024-11-28 05:17:49,535 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 671 transitions. Word has length 24 [2024-11-28 05:17:49,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:49,535 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 671 transitions. [2024-11-28 05:17:49,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:49,535 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 671 transitions. [2024-11-28 05:17:49,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-28 05:17:49,538 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:49,538 INFO L218 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] [2024-11-28 05:17:49,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 05:17:49,538 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:49,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:49,539 INFO L85 PathProgramCache]: Analyzing trace with hash -878816148, now seen corresponding path program 1 times [2024-11-28 05:17:49,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:49,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374290789] [2024-11-28 05:17:49,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:49,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:49,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:49,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:49,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374290789] [2024-11-28 05:17:49,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374290789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:49,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:49,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:49,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463142705] [2024-11-28 05:17:49,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:49,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:49,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:49,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:49,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:49,613 INFO L87 Difference]: Start difference. First operand 373 states and 671 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:49,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:49,654 INFO L93 Difference]: Finished difference Result 709 states and 1289 transitions. [2024-11-28 05:17:49,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:49,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-11-28 05:17:49,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:49,659 INFO L225 Difference]: With dead ends: 709 [2024-11-28 05:17:49,659 INFO L226 Difference]: Without dead ends: 707 [2024-11-28 05:17:49,660 INFO L434 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 [2024-11-28 05:17:49,662 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 64 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:49,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 181 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:49,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-11-28 05:17:49,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 513. [2024-11-28 05:17:49,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 1.779296875) internal successors, (911), 512 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 911 transitions. [2024-11-28 05:17:49,692 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 911 transitions. Word has length 25 [2024-11-28 05:17:49,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:49,694 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 911 transitions. [2024-11-28 05:17:49,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:49,694 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 911 transitions. [2024-11-28 05:17:49,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-28 05:17:49,695 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:49,695 INFO L218 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] [2024-11-28 05:17:49,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 05:17:49,696 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:49,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:49,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1422006442, now seen corresponding path program 1 times [2024-11-28 05:17:49,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:49,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988121579] [2024-11-28 05:17:49,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:49,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:49,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:49,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988121579] [2024-11-28 05:17:49,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988121579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:49,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:49,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:49,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245066406] [2024-11-28 05:17:49,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:49,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:49,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:49,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:49,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:49,759 INFO L87 Difference]: Start difference. First operand 513 states and 911 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:49,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:49,801 INFO L93 Difference]: Finished difference Result 1237 states and 2209 transitions. [2024-11-28 05:17:49,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:49,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-11-28 05:17:49,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:49,804 INFO L225 Difference]: With dead ends: 1237 [2024-11-28 05:17:49,804 INFO L226 Difference]: Without dead ends: 731 [2024-11-28 05:17:49,805 INFO L434 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 [2024-11-28 05:17:49,805 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 70 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:49,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 216 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:49,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-11-28 05:17:49,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 729. [2024-11-28 05:17:49,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 728 states have (on average 1.7733516483516483) internal successors, (1291), 728 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:49,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1291 transitions. [2024-11-28 05:17:49,838 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1291 transitions. Word has length 25 [2024-11-28 05:17:49,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:49,838 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 1291 transitions. [2024-11-28 05:17:49,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:49,838 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1291 transitions. [2024-11-28 05:17:49,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 05:17:49,840 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:49,840 INFO L218 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] [2024-11-28 05:17:49,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 05:17:49,841 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:49,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:49,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1473284061, now seen corresponding path program 1 times [2024-11-28 05:17:49,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:49,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626557610] [2024-11-28 05:17:49,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:49,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:49,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:49,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:49,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626557610] [2024-11-28 05:17:49,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626557610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:49,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:49,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:49,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830400745] [2024-11-28 05:17:49,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:49,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:49,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:49,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:49,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:49,893 INFO L87 Difference]: Start difference. First operand 729 states and 1291 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:49,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:49,933 INFO L93 Difference]: Finished difference Result 1101 states and 1945 transitions. [2024-11-28 05:17:49,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:49,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-28 05:17:49,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:49,936 INFO L225 Difference]: With dead ends: 1101 [2024-11-28 05:17:49,936 INFO L226 Difference]: Without dead ends: 743 [2024-11-28 05:17:49,938 INFO L434 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 [2024-11-28 05:17:49,939 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 72 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:49,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 228 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:49,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2024-11-28 05:17:49,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2024-11-28 05:17:49,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 740 states have (on average 1.7554054054054054) internal successors, (1299), 740 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:49,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1299 transitions. [2024-11-28 05:17:49,979 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1299 transitions. Word has length 26 [2024-11-28 05:17:49,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:49,979 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1299 transitions. [2024-11-28 05:17:49,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:49,980 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1299 transitions. [2024-11-28 05:17:49,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 05:17:49,981 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:49,981 INFO L218 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] [2024-11-28 05:17:49,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 05:17:49,981 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:49,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:49,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1132739493, now seen corresponding path program 1 times [2024-11-28 05:17:49,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:49,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262872433] [2024-11-28 05:17:49,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:49,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:50,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:50,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262872433] [2024-11-28 05:17:50,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262872433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:50,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:50,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:50,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919222479] [2024-11-28 05:17:50,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:50,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:50,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:50,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:50,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:50,035 INFO L87 Difference]: Start difference. First operand 741 states and 1299 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:50,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:50,079 INFO L93 Difference]: Finished difference Result 1385 states and 2461 transitions. [2024-11-28 05:17:50,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:50,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-28 05:17:50,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:50,087 INFO L225 Difference]: With dead ends: 1385 [2024-11-28 05:17:50,087 INFO L226 Difference]: Without dead ends: 1383 [2024-11-28 05:17:50,088 INFO L434 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 [2024-11-28 05:17:50,090 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 61 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:50,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:50,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-11-28 05:17:50,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1029. [2024-11-28 05:17:50,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 1028 states have (on average 1.722762645914397) internal successors, (1771), 1028 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:50,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1771 transitions. [2024-11-28 05:17:50,130 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1771 transitions. Word has length 26 [2024-11-28 05:17:50,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:50,130 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1771 transitions. [2024-11-28 05:17:50,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:50,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1771 transitions. [2024-11-28 05:17:50,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 05:17:50,132 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:50,132 INFO L218 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] [2024-11-28 05:17:50,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 05:17:50,132 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:50,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:50,134 INFO L85 PathProgramCache]: Analyzing trace with hash -861405213, now seen corresponding path program 1 times [2024-11-28 05:17:50,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:50,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028641042] [2024-11-28 05:17:50,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:50,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:50,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:50,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:50,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028641042] [2024-11-28 05:17:50,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028641042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:50,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:50,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:50,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712349123] [2024-11-28 05:17:50,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:50,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:50,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:50,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:50,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:50,171 INFO L87 Difference]: Start difference. First operand 1029 states and 1771 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:50,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:50,223 INFO L93 Difference]: Finished difference Result 2457 states and 4253 transitions. [2024-11-28 05:17:50,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:50,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-28 05:17:50,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:50,229 INFO L225 Difference]: With dead ends: 2457 [2024-11-28 05:17:50,229 INFO L226 Difference]: Without dead ends: 1447 [2024-11-28 05:17:50,230 INFO L434 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 [2024-11-28 05:17:50,232 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 69 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:50,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 217 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:50,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2024-11-28 05:17:50,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1445. [2024-11-28 05:17:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.7195290858725762) internal successors, (2483), 1444 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:50,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2483 transitions. [2024-11-28 05:17:50,296 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2483 transitions. Word has length 26 [2024-11-28 05:17:50,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:50,296 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 2483 transitions. [2024-11-28 05:17:50,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:50,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2483 transitions. [2024-11-28 05:17:50,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-28 05:17:50,298 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:50,298 INFO L218 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] [2024-11-28 05:17:50,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 05:17:50,299 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:50,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:50,299 INFO L85 PathProgramCache]: Analyzing trace with hash 755399007, now seen corresponding path program 1 times [2024-11-28 05:17:50,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:50,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250000474] [2024-11-28 05:17:50,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:50,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:50,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:50,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:50,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250000474] [2024-11-28 05:17:50,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250000474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:50,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:50,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:50,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272627393] [2024-11-28 05:17:50,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:50,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:50,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:50,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:50,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:50,345 INFO L87 Difference]: Start difference. First operand 1445 states and 2483 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:50,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:50,391 INFO L93 Difference]: Finished difference Result 2169 states and 3717 transitions. [2024-11-28 05:17:50,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:50,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-28 05:17:50,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:50,398 INFO L225 Difference]: With dead ends: 2169 [2024-11-28 05:17:50,398 INFO L226 Difference]: Without dead ends: 1463 [2024-11-28 05:17:50,400 INFO L434 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 [2024-11-28 05:17:50,400 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 71 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:50,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 224 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:50,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2024-11-28 05:17:50,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1461. [2024-11-28 05:17:50,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 1460 states have (on average 1.7006849315068493) internal successors, (2483), 1460 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:50,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 2483 transitions. [2024-11-28 05:17:50,458 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 2483 transitions. Word has length 27 [2024-11-28 05:17:50,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:50,459 INFO L471 AbstractCegarLoop]: Abstraction has 1461 states and 2483 transitions. [2024-11-28 05:17:50,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:50,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 2483 transitions. [2024-11-28 05:17:50,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-28 05:17:50,460 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:50,460 INFO L218 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] [2024-11-28 05:17:50,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 05:17:50,461 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:50,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:50,461 INFO L85 PathProgramCache]: Analyzing trace with hash -933544735, now seen corresponding path program 1 times [2024-11-28 05:17:50,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:50,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900529770] [2024-11-28 05:17:50,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:50,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:50,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:50,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:50,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900529770] [2024-11-28 05:17:50,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900529770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:50,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:50,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:50,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410298140] [2024-11-28 05:17:50,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:50,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:50,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:50,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:50,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:50,505 INFO L87 Difference]: Start difference. First operand 1461 states and 2483 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:50,564 INFO L93 Difference]: Finished difference Result 2697 states and 4661 transitions. [2024-11-28 05:17:50,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:50,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-28 05:17:50,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:50,573 INFO L225 Difference]: With dead ends: 2697 [2024-11-28 05:17:50,573 INFO L226 Difference]: Without dead ends: 2695 [2024-11-28 05:17:50,575 INFO L434 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 [2024-11-28 05:17:50,576 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 58 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:50,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 177 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:50,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2695 states. [2024-11-28 05:17:50,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2695 to 2053. [2024-11-28 05:17:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2052 states have (on average 1.662280701754386) internal successors, (3411), 2052 states have internal predecessors, (3411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:50,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 3411 transitions. [2024-11-28 05:17:50,660 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 3411 transitions. Word has length 27 [2024-11-28 05:17:50,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:50,660 INFO L471 AbstractCegarLoop]: Abstraction has 2053 states and 3411 transitions. [2024-11-28 05:17:50,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:50,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 3411 transitions. [2024-11-28 05:17:50,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-28 05:17:50,664 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:50,664 INFO L218 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] [2024-11-28 05:17:50,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 05:17:50,665 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:50,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:50,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1367277855, now seen corresponding path program 1 times [2024-11-28 05:17:50,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:50,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057632250] [2024-11-28 05:17:50,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:50,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:50,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:50,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:50,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057632250] [2024-11-28 05:17:50,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057632250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:50,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:50,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:50,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916076518] [2024-11-28 05:17:50,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:50,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:50,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:50,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:50,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:50,705 INFO L87 Difference]: Start difference. First operand 2053 states and 3411 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:50,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:50,795 INFO L93 Difference]: Finished difference Result 4873 states and 8149 transitions. [2024-11-28 05:17:50,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:50,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-28 05:17:50,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:50,805 INFO L225 Difference]: With dead ends: 4873 [2024-11-28 05:17:50,805 INFO L226 Difference]: Without dead ends: 2855 [2024-11-28 05:17:50,807 INFO L434 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 [2024-11-28 05:17:50,809 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 68 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:50,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 218 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:50,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2024-11-28 05:17:50,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 2853. [2024-11-28 05:17:50,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2852 states have (on average 1.66164095371669) internal successors, (4739), 2852 states have internal predecessors, (4739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:50,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4739 transitions. [2024-11-28 05:17:50,923 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4739 transitions. Word has length 27 [2024-11-28 05:17:50,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:50,923 INFO L471 AbstractCegarLoop]: Abstraction has 2853 states and 4739 transitions. [2024-11-28 05:17:50,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:50,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4739 transitions. [2024-11-28 05:17:50,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 05:17:50,926 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:50,926 INFO L218 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] [2024-11-28 05:17:50,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 05:17:50,926 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:50,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:50,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1125097720, now seen corresponding path program 1 times [2024-11-28 05:17:50,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:50,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761724562] [2024-11-28 05:17:50,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:50,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:50,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:50,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761724562] [2024-11-28 05:17:50,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761724562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:50,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:50,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:50,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992247675] [2024-11-28 05:17:50,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:50,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:50,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:50,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:50,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:50,969 INFO L87 Difference]: Start difference. First operand 2853 states and 4739 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:51,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:51,037 INFO L93 Difference]: Finished difference Result 4281 states and 7093 transitions. [2024-11-28 05:17:51,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:51,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-28 05:17:51,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:51,048 INFO L225 Difference]: With dead ends: 4281 [2024-11-28 05:17:51,048 INFO L226 Difference]: Without dead ends: 2887 [2024-11-28 05:17:51,050 INFO L434 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 [2024-11-28 05:17:51,050 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 70 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:51,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 220 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:51,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2024-11-28 05:17:51,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2885. [2024-11-28 05:17:51,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2885 states, 2884 states have (on average 1.6432038834951457) internal successors, (4739), 2884 states have internal predecessors, (4739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:51,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2885 states and 4739 transitions. [2024-11-28 05:17:51,170 INFO L78 Accepts]: Start accepts. Automaton has 2885 states and 4739 transitions. Word has length 28 [2024-11-28 05:17:51,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:51,170 INFO L471 AbstractCegarLoop]: Abstraction has 2885 states and 4739 transitions. [2024-11-28 05:17:51,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:51,170 INFO L276 IsEmpty]: Start isEmpty. Operand 2885 states and 4739 transitions. [2024-11-28 05:17:51,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 05:17:51,173 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:51,174 INFO L218 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] [2024-11-28 05:17:51,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 05:17:51,174 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:51,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:51,175 INFO L85 PathProgramCache]: Analyzing trace with hash -563846022, now seen corresponding path program 1 times [2024-11-28 05:17:51,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:51,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118927443] [2024-11-28 05:17:51,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:51,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:51,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:51,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:51,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118927443] [2024-11-28 05:17:51,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118927443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:51,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:51,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:51,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766906218] [2024-11-28 05:17:51,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:51,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:51,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:51,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:51,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:51,211 INFO L87 Difference]: Start difference. First operand 2885 states and 4739 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:51,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:51,346 INFO L93 Difference]: Finished difference Result 5257 states and 8805 transitions. [2024-11-28 05:17:51,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:51,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-28 05:17:51,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:51,365 INFO L225 Difference]: With dead ends: 5257 [2024-11-28 05:17:51,365 INFO L226 Difference]: Without dead ends: 5255 [2024-11-28 05:17:51,367 INFO L434 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 [2024-11-28 05:17:51,367 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 55 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:51,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 175 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:51,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5255 states. [2024-11-28 05:17:51,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5255 to 4101. [2024-11-28 05:17:51,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4101 states, 4100 states have (on average 1.6007317073170733) internal successors, (6563), 4100 states have internal predecessors, (6563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:51,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 6563 transitions. [2024-11-28 05:17:51,551 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 6563 transitions. Word has length 28 [2024-11-28 05:17:51,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:51,551 INFO L471 AbstractCegarLoop]: Abstraction has 4101 states and 6563 transitions. [2024-11-28 05:17:51,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:51,551 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 6563 transitions. [2024-11-28 05:17:51,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 05:17:51,555 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:51,555 INFO L218 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] [2024-11-28 05:17:51,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 05:17:51,556 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:51,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:51,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1736976568, now seen corresponding path program 1 times [2024-11-28 05:17:51,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:51,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399376868] [2024-11-28 05:17:51,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:51,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:51,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:51,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399376868] [2024-11-28 05:17:51,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399376868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:51,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:51,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:51,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063521601] [2024-11-28 05:17:51,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:51,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:51,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:51,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:51,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:51,586 INFO L87 Difference]: Start difference. First operand 4101 states and 6563 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:51,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:51,756 INFO L93 Difference]: Finished difference Result 9673 states and 15589 transitions. [2024-11-28 05:17:51,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:51,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-28 05:17:51,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:51,786 INFO L225 Difference]: With dead ends: 9673 [2024-11-28 05:17:51,790 INFO L226 Difference]: Without dead ends: 5639 [2024-11-28 05:17:51,794 INFO L434 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 [2024-11-28 05:17:51,795 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 67 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:51,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 219 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:51,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2024-11-28 05:17:51,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5637. [2024-11-28 05:17:52,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5637 states, 5636 states have (on average 1.60166784953868) internal successors, (9027), 5636 states have internal predecessors, (9027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:52,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5637 states to 5637 states and 9027 transitions. [2024-11-28 05:17:52,045 INFO L78 Accepts]: Start accepts. Automaton has 5637 states and 9027 transitions. Word has length 28 [2024-11-28 05:17:52,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:52,046 INFO L471 AbstractCegarLoop]: Abstraction has 5637 states and 9027 transitions. [2024-11-28 05:17:52,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:52,046 INFO L276 IsEmpty]: Start isEmpty. Operand 5637 states and 9027 transitions. [2024-11-28 05:17:52,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 05:17:52,051 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:52,052 INFO L218 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] [2024-11-28 05:17:52,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 05:17:52,052 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:52,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:52,053 INFO L85 PathProgramCache]: Analyzing trace with hash -299143724, now seen corresponding path program 1 times [2024-11-28 05:17:52,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:52,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927780291] [2024-11-28 05:17:52,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:52,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:52,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:52,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927780291] [2024-11-28 05:17:52,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927780291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:52,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:52,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:52,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367363401] [2024-11-28 05:17:52,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:52,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:52,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:52,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:52,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:52,090 INFO L87 Difference]: Start difference. First operand 5637 states and 9027 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:52,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:52,237 INFO L93 Difference]: Finished difference Result 8457 states and 13509 transitions. [2024-11-28 05:17:52,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:52,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-28 05:17:52,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:52,251 INFO L225 Difference]: With dead ends: 8457 [2024-11-28 05:17:52,251 INFO L226 Difference]: Without dead ends: 5703 [2024-11-28 05:17:52,254 INFO L434 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 [2024-11-28 05:17:52,255 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 69 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:52,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 216 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:52,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5703 states. [2024-11-28 05:17:52,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5703 to 5701. [2024-11-28 05:17:52,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5701 states, 5700 states have (on average 1.5836842105263158) internal successors, (9027), 5700 states have internal predecessors, (9027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:52,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5701 states to 5701 states and 9027 transitions. [2024-11-28 05:17:52,502 INFO L78 Accepts]: Start accepts. Automaton has 5701 states and 9027 transitions. Word has length 29 [2024-11-28 05:17:52,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:52,502 INFO L471 AbstractCegarLoop]: Abstraction has 5701 states and 9027 transitions. [2024-11-28 05:17:52,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:52,502 INFO L276 IsEmpty]: Start isEmpty. Operand 5701 states and 9027 transitions. [2024-11-28 05:17:52,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 05:17:52,509 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:52,509 INFO L218 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] [2024-11-28 05:17:52,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 05:17:52,509 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:52,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:52,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1988087466, now seen corresponding path program 1 times [2024-11-28 05:17:52,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:52,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929256084] [2024-11-28 05:17:52,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:52,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:52,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:52,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:52,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929256084] [2024-11-28 05:17:52,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929256084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:52,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:52,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:52,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535552185] [2024-11-28 05:17:52,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:52,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:52,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:52,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:52,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:52,563 INFO L87 Difference]: Start difference. First operand 5701 states and 9027 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:52,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:52,811 INFO L93 Difference]: Finished difference Result 10249 states and 16581 transitions. [2024-11-28 05:17:52,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:52,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-28 05:17:52,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:52,837 INFO L225 Difference]: With dead ends: 10249 [2024-11-28 05:17:52,837 INFO L226 Difference]: Without dead ends: 10247 [2024-11-28 05:17:52,841 INFO L434 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 [2024-11-28 05:17:52,842 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 52 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:52,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 173 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:52,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10247 states. [2024-11-28 05:17:53,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10247 to 8197. [2024-11-28 05:17:53,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8197 states, 8196 states have (on average 1.5386774036115178) internal successors, (12611), 8196 states have internal predecessors, (12611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:53,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8197 states to 8197 states and 12611 transitions. [2024-11-28 05:17:53,166 INFO L78 Accepts]: Start accepts. Automaton has 8197 states and 12611 transitions. Word has length 29 [2024-11-28 05:17:53,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:53,166 INFO L471 AbstractCegarLoop]: Abstraction has 8197 states and 12611 transitions. [2024-11-28 05:17:53,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:53,166 INFO L276 IsEmpty]: Start isEmpty. Operand 8197 states and 12611 transitions. [2024-11-28 05:17:53,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 05:17:53,174 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:53,175 INFO L218 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] [2024-11-28 05:17:53,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 05:17:53,175 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:53,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:53,175 INFO L85 PathProgramCache]: Analyzing trace with hash 312735124, now seen corresponding path program 1 times [2024-11-28 05:17:53,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:53,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210553262] [2024-11-28 05:17:53,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:53,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:53,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:53,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:53,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210553262] [2024-11-28 05:17:53,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210553262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:53,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:53,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:53,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483632981] [2024-11-28 05:17:53,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:53,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:53,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:53,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:53,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:53,214 INFO L87 Difference]: Start difference. First operand 8197 states and 12611 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:53,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:53,447 INFO L93 Difference]: Finished difference Result 19209 states and 29765 transitions. [2024-11-28 05:17:53,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:53,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-28 05:17:53,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:53,473 INFO L225 Difference]: With dead ends: 19209 [2024-11-28 05:17:53,474 INFO L226 Difference]: Without dead ends: 11143 [2024-11-28 05:17:53,482 INFO L434 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 [2024-11-28 05:17:53,484 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 66 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:53,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:53,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11143 states. [2024-11-28 05:17:53,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11143 to 11141. [2024-11-28 05:17:53,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11141 states, 11140 states have (on average 1.5399461400359067) internal successors, (17155), 11140 states have internal predecessors, (17155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:53,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11141 states to 11141 states and 17155 transitions. [2024-11-28 05:17:53,881 INFO L78 Accepts]: Start accepts. Automaton has 11141 states and 17155 transitions. Word has length 29 [2024-11-28 05:17:53,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:53,882 INFO L471 AbstractCegarLoop]: Abstraction has 11141 states and 17155 transitions. [2024-11-28 05:17:53,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:53,882 INFO L276 IsEmpty]: Start isEmpty. Operand 11141 states and 17155 transitions. [2024-11-28 05:17:53,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 05:17:53,891 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:53,891 INFO L218 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] [2024-11-28 05:17:53,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 05:17:53,891 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:53,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:53,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1500955187, now seen corresponding path program 1 times [2024-11-28 05:17:53,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:53,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605510068] [2024-11-28 05:17:53,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:53,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:53,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:53,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:53,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605510068] [2024-11-28 05:17:53,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605510068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:53,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:53,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:53,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236919484] [2024-11-28 05:17:53,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:53,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:53,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:53,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:53,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:53,930 INFO L87 Difference]: Start difference. First operand 11141 states and 17155 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:54,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:54,107 INFO L93 Difference]: Finished difference Result 16713 states and 25669 transitions. [2024-11-28 05:17:54,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:54,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-28 05:17:54,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:54,132 INFO L225 Difference]: With dead ends: 16713 [2024-11-28 05:17:54,132 INFO L226 Difference]: Without dead ends: 11271 [2024-11-28 05:17:54,139 INFO L434 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 [2024-11-28 05:17:54,141 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 68 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:54,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 212 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:54,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11271 states. [2024-11-28 05:17:54,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11271 to 11269. [2024-11-28 05:17:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11269 states, 11268 states have (on average 1.522452964146255) internal successors, (17155), 11268 states have internal predecessors, (17155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:54,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11269 states to 11269 states and 17155 transitions. [2024-11-28 05:17:54,642 INFO L78 Accepts]: Start accepts. Automaton has 11269 states and 17155 transitions. Word has length 30 [2024-11-28 05:17:54,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:54,642 INFO L471 AbstractCegarLoop]: Abstraction has 11269 states and 17155 transitions. [2024-11-28 05:17:54,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:54,643 INFO L276 IsEmpty]: Start isEmpty. Operand 11269 states and 17155 transitions. [2024-11-28 05:17:54,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 05:17:54,654 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:54,655 INFO L218 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] [2024-11-28 05:17:54,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 05:17:54,655 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:54,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:54,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1105068367, now seen corresponding path program 1 times [2024-11-28 05:17:54,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:54,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75516552] [2024-11-28 05:17:54,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:54,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:54,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:54,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75516552] [2024-11-28 05:17:54,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75516552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:54,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:54,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:54,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222086039] [2024-11-28 05:17:54,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:54,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:54,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:54,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:54,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:54,697 INFO L87 Difference]: Start difference. First operand 11269 states and 17155 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:55,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:55,044 INFO L93 Difference]: Finished difference Result 19977 states and 31109 transitions. [2024-11-28 05:17:55,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:55,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-28 05:17:55,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:55,081 INFO L225 Difference]: With dead ends: 19977 [2024-11-28 05:17:55,081 INFO L226 Difference]: Without dead ends: 19975 [2024-11-28 05:17:55,085 INFO L434 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 [2024-11-28 05:17:55,086 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 49 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:55,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:55,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19975 states. [2024-11-28 05:17:55,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19975 to 16389. [2024-11-28 05:17:55,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16389 states, 16388 states have (on average 1.476385159873078) internal successors, (24195), 16388 states have internal predecessors, (24195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:55,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16389 states to 16389 states and 24195 transitions. [2024-11-28 05:17:55,550 INFO L78 Accepts]: Start accepts. Automaton has 16389 states and 24195 transitions. Word has length 30 [2024-11-28 05:17:55,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:55,550 INFO L471 AbstractCegarLoop]: Abstraction has 16389 states and 24195 transitions. [2024-11-28 05:17:55,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:55,551 INFO L276 IsEmpty]: Start isEmpty. Operand 16389 states and 24195 transitions. [2024-11-28 05:17:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 05:17:55,567 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:55,567 INFO L218 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] [2024-11-28 05:17:55,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-28 05:17:55,568 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:55,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:55,568 INFO L85 PathProgramCache]: Analyzing trace with hash -889076339, now seen corresponding path program 1 times [2024-11-28 05:17:55,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:55,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463847574] [2024-11-28 05:17:55,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:55,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:55,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:55,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:55,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463847574] [2024-11-28 05:17:55,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463847574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:55,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:55,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:55,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963819974] [2024-11-28 05:17:55,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:55,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:55,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:55,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:55,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:55,594 INFO L87 Difference]: Start difference. First operand 16389 states and 24195 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:55,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:55,936 INFO L93 Difference]: Finished difference Result 38153 states and 56709 transitions. [2024-11-28 05:17:55,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:55,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-28 05:17:55,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:55,980 INFO L225 Difference]: With dead ends: 38153 [2024-11-28 05:17:55,981 INFO L226 Difference]: Without dead ends: 22023 [2024-11-28 05:17:55,999 INFO L434 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 [2024-11-28 05:17:55,999 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 65 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:56,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 221 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:56,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22023 states. [2024-11-28 05:17:56,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22023 to 22021. [2024-11-28 05:17:56,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22021 states, 22020 states have (on average 1.4766121707538602) internal successors, (32515), 22020 states have internal predecessors, (32515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:56,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22021 states to 22021 states and 32515 transitions. [2024-11-28 05:17:56,576 INFO L78 Accepts]: Start accepts. Automaton has 22021 states and 32515 transitions. Word has length 30 [2024-11-28 05:17:56,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:56,577 INFO L471 AbstractCegarLoop]: Abstraction has 22021 states and 32515 transitions. [2024-11-28 05:17:56,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:56,577 INFO L276 IsEmpty]: Start isEmpty. Operand 22021 states and 32515 transitions. [2024-11-28 05:17:56,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 05:17:56,595 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:56,595 INFO L218 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] [2024-11-28 05:17:56,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-28 05:17:56,595 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:56,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:56,596 INFO L85 PathProgramCache]: Analyzing trace with hash -102404535, now seen corresponding path program 1 times [2024-11-28 05:17:56,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:56,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378296373] [2024-11-28 05:17:56,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:56,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:56,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:56,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:56,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378296373] [2024-11-28 05:17:56,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378296373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:56,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:56,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:56,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768390572] [2024-11-28 05:17:56,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:56,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:56,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:56,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:56,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:56,627 INFO L87 Difference]: Start difference. First operand 22021 states and 32515 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:56,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:56,896 INFO L93 Difference]: Finished difference Result 33033 states and 48645 transitions. [2024-11-28 05:17:56,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:56,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-28 05:17:56,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:56,943 INFO L225 Difference]: With dead ends: 33033 [2024-11-28 05:17:56,944 INFO L226 Difference]: Without dead ends: 22279 [2024-11-28 05:17:56,957 INFO L434 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 [2024-11-28 05:17:56,957 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 67 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:56,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 208 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:56,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22279 states. [2024-11-28 05:17:57,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22279 to 22277. [2024-11-28 05:17:57,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22277 states, 22276 states have (on average 1.4596426647513019) internal successors, (32515), 22276 states have internal predecessors, (32515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:57,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22277 states to 22277 states and 32515 transitions. [2024-11-28 05:17:57,718 INFO L78 Accepts]: Start accepts. Automaton has 22277 states and 32515 transitions. Word has length 31 [2024-11-28 05:17:57,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:57,718 INFO L471 AbstractCegarLoop]: Abstraction has 22277 states and 32515 transitions. [2024-11-28 05:17:57,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:57,718 INFO L276 IsEmpty]: Start isEmpty. Operand 22277 states and 32515 transitions. [2024-11-28 05:17:57,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 05:17:57,743 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:57,743 INFO L218 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] [2024-11-28 05:17:57,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 05:17:57,745 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:57,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:57,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1791348277, now seen corresponding path program 1 times [2024-11-28 05:17:57,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:57,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43439594] [2024-11-28 05:17:57,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:57,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:57,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:57,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43439594] [2024-11-28 05:17:57,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43439594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:57,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:57,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:57,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981107568] [2024-11-28 05:17:57,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:57,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:57,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:57,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:57,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:57,797 INFO L87 Difference]: Start difference. First operand 22277 states and 32515 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:58,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:58,440 INFO L93 Difference]: Finished difference Result 38921 states and 58117 transitions. [2024-11-28 05:17:58,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:58,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-28 05:17:58,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:17:58,517 INFO L225 Difference]: With dead ends: 38921 [2024-11-28 05:17:58,518 INFO L226 Difference]: Without dead ends: 38919 [2024-11-28 05:17:58,524 INFO L434 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 [2024-11-28 05:17:58,524 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 46 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:17:58,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 169 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:17:58,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38919 states. [2024-11-28 05:17:59,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38919 to 32773. [2024-11-28 05:17:59,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32773 states, 32772 states have (on average 1.4139814475772001) internal successors, (46339), 32772 states have internal predecessors, (46339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:59,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32773 states to 32773 states and 46339 transitions. [2024-11-28 05:17:59,293 INFO L78 Accepts]: Start accepts. Automaton has 32773 states and 46339 transitions. Word has length 31 [2024-11-28 05:17:59,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:17:59,294 INFO L471 AbstractCegarLoop]: Abstraction has 32773 states and 46339 transitions. [2024-11-28 05:17:59,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:59,294 INFO L276 IsEmpty]: Start isEmpty. Operand 32773 states and 46339 transitions. [2024-11-28 05:17:59,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 05:17:59,313 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:17:59,313 INFO L218 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] [2024-11-28 05:17:59,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 05:17:59,314 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:17:59,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:59,314 INFO L85 PathProgramCache]: Analyzing trace with hash 509474313, now seen corresponding path program 1 times [2024-11-28 05:17:59,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:59,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014650267] [2024-11-28 05:17:59,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:59,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:59,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:59,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:59,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014650267] [2024-11-28 05:17:59,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014650267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:59,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:59,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:17:59,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521654201] [2024-11-28 05:17:59,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:59,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:17:59,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:59,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:17:59,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:17:59,358 INFO L87 Difference]: Start difference. First operand 32773 states and 46339 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:17:59,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:17:59,977 INFO L93 Difference]: Finished difference Result 75785 states and 107781 transitions. [2024-11-28 05:17:59,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:17:59,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-28 05:17:59,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:00,054 INFO L225 Difference]: With dead ends: 75785 [2024-11-28 05:18:00,054 INFO L226 Difference]: Without dead ends: 43527 [2024-11-28 05:18:00,077 INFO L434 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 [2024-11-28 05:18:00,078 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 64 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:18:00,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 222 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:18:00,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43527 states. [2024-11-28 05:18:00,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43527 to 43525. [2024-11-28 05:18:00,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43525 states, 43524 states have (on average 1.4117038875103392) internal successors, (61443), 43524 states have internal predecessors, (61443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:18:01,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43525 states to 43525 states and 61443 transitions. [2024-11-28 05:18:01,049 INFO L78 Accepts]: Start accepts. Automaton has 43525 states and 61443 transitions. Word has length 31 [2024-11-28 05:18:01,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:01,049 INFO L471 AbstractCegarLoop]: Abstraction has 43525 states and 61443 transitions. [2024-11-28 05:18:01,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:18:01,049 INFO L276 IsEmpty]: Start isEmpty. Operand 43525 states and 61443 transitions. [2024-11-28 05:18:01,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 05:18:01,223 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:01,223 INFO L218 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] [2024-11-28 05:18:01,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-28 05:18:01,223 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:18:01,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:01,224 INFO L85 PathProgramCache]: Analyzing trace with hash 302993058, now seen corresponding path program 1 times [2024-11-28 05:18:01,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:18:01,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828375974] [2024-11-28 05:18:01,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:01,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:18:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:01,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:18:01,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:18:01,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828375974] [2024-11-28 05:18:01,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828375974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:18:01,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:18:01,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:18:01,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117247284] [2024-11-28 05:18:01,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:18:01,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:18:01,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:18:01,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:18:01,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:18:01,254 INFO L87 Difference]: Start difference. First operand 43525 states and 61443 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:18:02,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:02,003 INFO L93 Difference]: Finished difference Result 65289 states and 91909 transitions. [2024-11-28 05:18:02,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:18:02,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-28 05:18:02,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:02,071 INFO L225 Difference]: With dead ends: 65289 [2024-11-28 05:18:02,071 INFO L226 Difference]: Without dead ends: 44039 [2024-11-28 05:18:02,090 INFO L434 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 [2024-11-28 05:18:02,091 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 66 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:18:02,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 204 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:18:02,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44039 states. [2024-11-28 05:18:03,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44039 to 44037. [2024-11-28 05:18:03,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44037 states, 44036 states have (on average 1.395290217095104) internal successors, (61443), 44036 states have internal predecessors, (61443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:18:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44037 states to 44037 states and 61443 transitions. [2024-11-28 05:18:03,284 INFO L78 Accepts]: Start accepts. Automaton has 44037 states and 61443 transitions. Word has length 32 [2024-11-28 05:18:03,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:03,284 INFO L471 AbstractCegarLoop]: Abstraction has 44037 states and 61443 transitions. [2024-11-28 05:18:03,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:18:03,284 INFO L276 IsEmpty]: Start isEmpty. Operand 44037 states and 61443 transitions. [2024-11-28 05:18:03,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 05:18:03,305 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:03,305 INFO L218 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] [2024-11-28 05:18:03,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-28 05:18:03,306 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:18:03,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:03,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1385950684, now seen corresponding path program 1 times [2024-11-28 05:18:03,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:18:03,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436857491] [2024-11-28 05:18:03,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:03,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:18:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:03,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:18:03,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:18:03,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436857491] [2024-11-28 05:18:03,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436857491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:18:03,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:18:03,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:18:03,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771146818] [2024-11-28 05:18:03,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:18:03,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:18:03,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:18:03,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:18:03,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:18:03,334 INFO L87 Difference]: Start difference. First operand 44037 states and 61443 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:18:04,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:04,480 INFO L93 Difference]: Finished difference Result 129033 states and 178181 transitions. [2024-11-28 05:18:04,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:18:04,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-28 05:18:04,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:04,581 INFO L225 Difference]: With dead ends: 129033 [2024-11-28 05:18:04,581 INFO L226 Difference]: Without dead ends: 86023 [2024-11-28 05:18:04,616 INFO L434 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 [2024-11-28 05:18:04,616 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 64 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:18:04,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 187 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:18:04,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86023 states. [2024-11-28 05:18:06,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86023 to 86021. [2024-11-28 05:18:06,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86021 states, 86020 states have (on average 1.357114624505929) internal successors, (116739), 86020 states have internal predecessors, (116739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:18:06,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86021 states to 86021 states and 116739 transitions. [2024-11-28 05:18:06,146 INFO L78 Accepts]: Start accepts. Automaton has 86021 states and 116739 transitions. Word has length 32 [2024-11-28 05:18:06,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:06,146 INFO L471 AbstractCegarLoop]: Abstraction has 86021 states and 116739 transitions. [2024-11-28 05:18:06,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:18:06,147 INFO L276 IsEmpty]: Start isEmpty. Operand 86021 states and 116739 transitions. [2024-11-28 05:18:06,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 05:18:06,191 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:06,191 INFO L218 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] [2024-11-28 05:18:06,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-28 05:18:06,191 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:18:06,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:06,192 INFO L85 PathProgramCache]: Analyzing trace with hash 608194022, now seen corresponding path program 1 times [2024-11-28 05:18:06,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:18:06,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900247264] [2024-11-28 05:18:06,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:06,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:18:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:06,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:18:06,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:18:06,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900247264] [2024-11-28 05:18:06,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900247264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:18:06,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:18:06,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:18:06,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776472962] [2024-11-28 05:18:06,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:18:06,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:18:06,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:18:06,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:18:06,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:18:06,220 INFO L87 Difference]: Start difference. First operand 86021 states and 116739 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:18:07,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:07,951 INFO L93 Difference]: Finished difference Result 96265 states and 135173 transitions. [2024-11-28 05:18:07,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:18:07,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-28 05:18:07,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:08,039 INFO L225 Difference]: With dead ends: 96265 [2024-11-28 05:18:08,039 INFO L226 Difference]: Without dead ends: 96263 [2024-11-28 05:18:08,050 INFO L434 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 [2024-11-28 05:18:08,051 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 43 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:18:08,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 220 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:18:08,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96263 states. [2024-11-28 05:18:09,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96263 to 86021. [2024-11-28 05:18:09,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86021 states, 86020 states have (on average 1.345210416182283) internal successors, (115715), 86020 states have internal predecessors, (115715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:18:09,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86021 states to 86021 states and 115715 transitions. [2024-11-28 05:18:09,487 INFO L78 Accepts]: Start accepts. Automaton has 86021 states and 115715 transitions. Word has length 32 [2024-11-28 05:18:09,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:09,487 INFO L471 AbstractCegarLoop]: Abstraction has 86021 states and 115715 transitions. [2024-11-28 05:18:09,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:18:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 86021 states and 115715 transitions. [2024-11-28 05:18:09,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-28 05:18:09,533 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:09,533 INFO L218 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] [2024-11-28 05:18:09,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-28 05:18:09,534 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:18:09,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:09,535 INFO L85 PathProgramCache]: Analyzing trace with hash -14583106, now seen corresponding path program 1 times [2024-11-28 05:18:09,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:18:09,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301521367] [2024-11-28 05:18:09,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:09,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:18:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:09,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:18:09,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:18:09,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301521367] [2024-11-28 05:18:09,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301521367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:18:09,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:18:09,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:18:09,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56767802] [2024-11-28 05:18:09,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:18:09,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:18:09,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:18:09,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:18:09,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:18:09,566 INFO L87 Difference]: Start difference. First operand 86021 states and 115715 transitions. Second operand has 3 states, 3 states have (on average 11.0) 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) [2024-11-28 05:18:11,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:11,890 INFO L93 Difference]: Finished difference Result 146441 states and 200709 transitions. [2024-11-28 05:18:11,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:18:11,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) 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 [2024-11-28 05:18:11,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:11,991 INFO L225 Difference]: With dead ends: 146441 [2024-11-28 05:18:11,991 INFO L226 Difference]: Without dead ends: 146439 [2024-11-28 05:18:12,005 INFO L434 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 [2024-11-28 05:18:12,006 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 40 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:18:12,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:18:12,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146439 states. [2024-11-28 05:18:13,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146439 to 130053. [2024-11-28 05:18:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130053 states, 130052 states have (on average 1.3070694799003475) internal successors, (169987), 130052 states have internal predecessors, (169987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:18:13,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130053 states to 130053 states and 169987 transitions. [2024-11-28 05:18:13,946 INFO L78 Accepts]: Start accepts. Automaton has 130053 states and 169987 transitions. Word has length 33 [2024-11-28 05:18:13,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:13,946 INFO L471 AbstractCegarLoop]: Abstraction has 130053 states and 169987 transitions. [2024-11-28 05:18:13,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) 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) [2024-11-28 05:18:13,946 INFO L276 IsEmpty]: Start isEmpty. Operand 130053 states and 169987 transitions. [2024-11-28 05:18:14,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-28 05:18:14,000 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:14,000 INFO L218 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] [2024-11-28 05:18:14,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-28 05:18:14,000 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:18:14,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:14,001 INFO L85 PathProgramCache]: Analyzing trace with hash -2008727812, now seen corresponding path program 1 times [2024-11-28 05:18:14,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:18:14,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034965413] [2024-11-28 05:18:14,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:14,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:18:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:14,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:18:14,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:18:14,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034965413] [2024-11-28 05:18:14,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034965413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:18:14,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:18:14,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:18:14,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202702122] [2024-11-28 05:18:14,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:18:14,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:18:14,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:18:14,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:18:14,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:18:14,030 INFO L87 Difference]: Start difference. First operand 130053 states and 169987 transitions. Second operand has 3 states, 3 states have (on average 11.0) 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) [2024-11-28 05:18:16,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:16,702 INFO L93 Difference]: Finished difference Result 297993 states and 391173 transitions. [2024-11-28 05:18:16,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:18:16,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) 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 [2024-11-28 05:18:16,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:16,849 INFO L225 Difference]: With dead ends: 297993 [2024-11-28 05:18:16,849 INFO L226 Difference]: Without dead ends: 168967 [2024-11-28 05:18:16,896 INFO L434 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 [2024-11-28 05:18:16,897 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 62 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:18:16,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 224 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:18:16,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168967 states. [2024-11-28 05:18:19,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168967 to 168965. [2024-11-28 05:18:20,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168965 states, 168964 states have (on average 1.2969567481830448) internal successors, (219139), 168964 states have internal predecessors, (219139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:18:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168965 states to 168965 states and 219139 transitions. [2024-11-28 05:18:20,307 INFO L78 Accepts]: Start accepts. Automaton has 168965 states and 219139 transitions. Word has length 33 [2024-11-28 05:18:20,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:20,307 INFO L471 AbstractCegarLoop]: Abstraction has 168965 states and 219139 transitions. [2024-11-28 05:18:20,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) 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) [2024-11-28 05:18:20,308 INFO L276 IsEmpty]: Start isEmpty. Operand 168965 states and 219139 transitions. [2024-11-28 05:18:20,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-28 05:18:20,398 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:20,398 INFO L218 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, 1] [2024-11-28 05:18:20,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-28 05:18:20,398 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:18:20,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:20,399 INFO L85 PathProgramCache]: Analyzing trace with hash -451860807, now seen corresponding path program 1 times [2024-11-28 05:18:20,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:18:20,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632794778] [2024-11-28 05:18:20,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:20,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:18:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:20,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:18:20,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:18:20,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632794778] [2024-11-28 05:18:20,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632794778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:18:20,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:18:20,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:18:20,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400864957] [2024-11-28 05:18:20,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:18:20,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:18:20,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:18:20,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:18:20,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:18:20,425 INFO L87 Difference]: Start difference. First operand 168965 states and 219139 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:18:22,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:22,828 INFO L93 Difference]: Finished difference Result 254985 states and 330757 transitions. [2024-11-28 05:18:22,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:18:22,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-28 05:18:22,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:23,038 INFO L225 Difference]: With dead ends: 254985 [2024-11-28 05:18:23,039 INFO L226 Difference]: Without dead ends: 172039 [2024-11-28 05:18:23,083 INFO L434 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 [2024-11-28 05:18:23,084 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 64 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:18:23,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 196 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:18:23,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172039 states.