./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --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 8ff0a322ea14915785d13405f40f59a899d91f6127d01ad0d503cb7ec027b40c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:06:20,858 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:06:20,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 06:06:20,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:06:20,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:06:20,937 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:06:20,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:06:20,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:06:20,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:06:20,938 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:06:20,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:06:20,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:06:20,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:06:20,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:06:20,938 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:06:20,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:06:20,938 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:06:20,939 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 06:06:20,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:06:20,939 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 06:06:20,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:06:20,940 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:06:20,940 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:06:20,940 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:06:20,940 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 06:06:20,940 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:06:20,940 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:06:20,940 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:06:20,940 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:06:20,941 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:06:20,941 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:06:20,941 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:06:20,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:06:20,942 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:06:20,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:06:20,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:06:20,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:06:20,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:06:20,942 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:06:20,942 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:06:20,942 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:06:20,942 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:06:20,942 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:06:20,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:06:20,942 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:06:20,942 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:06:20,942 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:06:20,942 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:06:20,942 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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 -> 8ff0a322ea14915785d13405f40f59a899d91f6127d01ad0d503cb7ec027b40c [2025-01-09 06:06:21,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:06:21,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:06:21,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:06:21,172 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:06:21,173 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:06:21,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2025-01-09 06:06:22,419 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eca1078a4/d8c0b87650f548818904741b09b7d21b/FLAG71f6d8fbd [2025-01-09 06:06:22,707 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:06:22,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2025-01-09 06:06:22,719 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eca1078a4/d8c0b87650f548818904741b09b7d21b/FLAG71f6d8fbd [2025-01-09 06:06:23,002 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eca1078a4/d8c0b87650f548818904741b09b7d21b [2025-01-09 06:06:23,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:06:23,006 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:06:23,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:06:23,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:06:23,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:06:23,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:06:23" (1/1) ... [2025-01-09 06:06:23,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bea4536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:23, skipping insertion in model container [2025-01-09 06:06:23,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:06:23" (1/1) ... [2025-01-09 06:06:23,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:06:23,163 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[911,924] [2025-01-09 06:06:23,213 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[8416,8429] [2025-01-09 06:06:23,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:06:23,245 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:06:23,255 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[911,924] [2025-01-09 06:06:23,277 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[8416,8429] [2025-01-09 06:06:23,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:06:23,315 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:06:23,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:23 WrapperNode [2025-01-09 06:06:23,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:06:23,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:06:23,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:06:23,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:06:23,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:23" (1/1) ... [2025-01-09 06:06:23,336 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:23" (1/1) ... [2025-01-09 06:06:23,382 INFO L138 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 422 [2025-01-09 06:06:23,383 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:06:23,384 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:06:23,385 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:06:23,385 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:06:23,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:23" (1/1) ... [2025-01-09 06:06:23,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:23" (1/1) ... [2025-01-09 06:06:23,396 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:23" (1/1) ... [2025-01-09 06:06:23,419 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]. [2025-01-09 06:06:23,419 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:23" (1/1) ... [2025-01-09 06:06:23,419 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:23" (1/1) ... [2025-01-09 06:06:23,424 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:23" (1/1) ... [2025-01-09 06:06:23,425 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:23" (1/1) ... [2025-01-09 06:06:23,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:23" (1/1) ... [2025-01-09 06:06:23,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:23" (1/1) ... [2025-01-09 06:06:23,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:23" (1/1) ... [2025-01-09 06:06:23,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:06:23,433 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:06:23,433 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:06:23,433 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:06:23,434 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:23" (1/1) ... [2025-01-09 06:06:23,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:06:23,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:06:23,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 06:06:23,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 06:06:23,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:06:23,490 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 06:06:23,490 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 06:06:23,491 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-01-09 06:06:23,491 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-01-09 06:06:23,491 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-01-09 06:06:23,491 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-01-09 06:06:23,491 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-01-09 06:06:23,491 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-01-09 06:06:23,491 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-01-09 06:06:23,491 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-01-09 06:06:23,492 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-01-09 06:06:23,492 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-01-09 06:06:23,492 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-01-09 06:06:23,492 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-01-09 06:06:23,492 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-01-09 06:06:23,493 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-01-09 06:06:23,493 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-01-09 06:06:23,493 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-01-09 06:06:23,494 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-01-09 06:06:23,494 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-01-09 06:06:23,494 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-01-09 06:06:23,494 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-01-09 06:06:23,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:06:23,494 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-01-09 06:06:23,494 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-01-09 06:06:23,494 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-01-09 06:06:23,494 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-01-09 06:06:23,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:06:23,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:06:23,494 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-01-09 06:06:23,494 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-01-09 06:06:23,587 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:06:23,589 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:06:23,935 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##48: assume !(1 == ~q_free~0); [2025-01-09 06:06:23,935 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2025-01-09 06:06:24,000 INFO L? ?]: Removed 64 outVars from TransFormulas that were not future-live. [2025-01-09 06:06:24,000 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:06:24,020 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:06:24,023 INFO L312 CfgBuilder]: Removed 8 assume(true) statements. [2025-01-09 06:06:24,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:06:24 BoogieIcfgContainer [2025-01-09 06:06:24,024 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:06:24,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:06:24,028 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:06:24,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:06:24,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:06:23" (1/3) ... [2025-01-09 06:06:24,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6418b34a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:06:24, skipping insertion in model container [2025-01-09 06:06:24,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:23" (2/3) ... [2025-01-09 06:06:24,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6418b34a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:06:24, skipping insertion in model container [2025-01-09 06:06:24,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:06:24" (3/3) ... [2025-01-09 06:06:24,034 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.01.cil-1.c [2025-01-09 06:06:24,046 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:06:24,048 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.01.cil-1.c that has 15 procedures, 218 locations, 1 initial locations, 8 loop locations, and 2 error locations. [2025-01-09 06:06:24,095 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:06:24,106 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;@41f79122, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:06:24,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 06:06:24,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 218 states, 172 states have (on average 1.4883720930232558) internal successors, (256), 176 states have internal predecessors, (256), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 06:06:24,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 06:06:24,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:24,119 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:24,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:24,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:24,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1079980018, now seen corresponding path program 1 times [2025-01-09 06:06:24,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:24,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360412602] [2025-01-09 06:06:24,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:24,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:24,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 06:06:24,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 06:06:24,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:24,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:24,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:24,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:24,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360412602] [2025-01-09 06:06:24,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360412602] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:24,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:24,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:24,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789415102] [2025-01-09 06:06:24,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:24,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:24,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:24,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:24,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:24,488 INFO L87 Difference]: Start difference. First operand has 218 states, 172 states have (on average 1.4883720930232558) internal successors, (256), 176 states have internal predecessors, (256), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:25,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:25,034 INFO L93 Difference]: Finished difference Result 514 states and 753 transitions. [2025-01-09 06:06:25,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:25,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2025-01-09 06:06:25,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:25,050 INFO L225 Difference]: With dead ends: 514 [2025-01-09 06:06:25,050 INFO L226 Difference]: Without dead ends: 303 [2025-01-09 06:06:25,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:25,056 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 419 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:25,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 626 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:06:25,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-01-09 06:06:25,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 296. [2025-01-09 06:06:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 233 states have (on average 1.4549356223175967) internal successors, (339), 238 states have internal predecessors, (339), 41 states have call successors, (41), 20 states have call predecessors, (41), 20 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-01-09 06:06:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 420 transitions. [2025-01-09 06:06:25,116 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 420 transitions. Word has length 55 [2025-01-09 06:06:25,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:25,117 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 420 transitions. [2025-01-09 06:06:25,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:25,118 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 420 transitions. [2025-01-09 06:06:25,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 06:06:25,123 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:25,124 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:25,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:06:25,124 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:25,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:25,125 INFO L85 PathProgramCache]: Analyzing trace with hash 605288566, now seen corresponding path program 1 times [2025-01-09 06:06:25,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:25,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211336209] [2025-01-09 06:06:25,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:25,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:25,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 06:06:25,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 06:06:25,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:25,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:25,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:25,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:25,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211336209] [2025-01-09 06:06:25,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211336209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:25,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:25,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:25,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537419282] [2025-01-09 06:06:25,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:25,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:25,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:25,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:25,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:25,295 INFO L87 Difference]: Start difference. First operand 296 states and 420 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:25,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:25,819 INFO L93 Difference]: Finished difference Result 581 states and 825 transitions. [2025-01-09 06:06:25,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:25,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2025-01-09 06:06:25,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:25,822 INFO L225 Difference]: With dead ends: 581 [2025-01-09 06:06:25,822 INFO L226 Difference]: Without dead ends: 402 [2025-01-09 06:06:25,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:06:25,827 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 399 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:25,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 909 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:06:25,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-01-09 06:06:25,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 379. [2025-01-09 06:06:25,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 299 states have (on average 1.4448160535117056) internal successors, (432), 305 states have internal predecessors, (432), 51 states have call successors, (51), 26 states have call predecessors, (51), 27 states have return successors, (53), 50 states have call predecessors, (53), 49 states have call successors, (53) [2025-01-09 06:06:25,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 536 transitions. [2025-01-09 06:06:25,869 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 536 transitions. Word has length 55 [2025-01-09 06:06:25,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:25,869 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 536 transitions. [2025-01-09 06:06:25,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:25,869 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 536 transitions. [2025-01-09 06:06:25,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 06:06:25,874 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:25,874 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:25,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:06:25,875 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:25,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:25,875 INFO L85 PathProgramCache]: Analyzing trace with hash 853435060, now seen corresponding path program 1 times [2025-01-09 06:06:25,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:25,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447000839] [2025-01-09 06:06:25,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:25,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:25,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 06:06:25,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 06:06:25,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:25,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:25,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:25,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:25,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447000839] [2025-01-09 06:06:25,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447000839] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:25,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:25,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:25,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261019067] [2025-01-09 06:06:25,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:25,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:25,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:25,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:25,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:25,993 INFO L87 Difference]: Start difference. First operand 379 states and 536 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:26,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:26,285 INFO L93 Difference]: Finished difference Result 656 states and 932 transitions. [2025-01-09 06:06:26,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:26,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2025-01-09 06:06:26,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:26,289 INFO L225 Difference]: With dead ends: 656 [2025-01-09 06:06:26,289 INFO L226 Difference]: Without dead ends: 394 [2025-01-09 06:06:26,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:26,291 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 356 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:26,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 447 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:06:26,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-01-09 06:06:26,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 379. [2025-01-09 06:06:26,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 299 states have (on average 1.434782608695652) internal successors, (429), 305 states have internal predecessors, (429), 51 states have call successors, (51), 26 states have call predecessors, (51), 27 states have return successors, (53), 50 states have call predecessors, (53), 49 states have call successors, (53) [2025-01-09 06:06:26,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 533 transitions. [2025-01-09 06:06:26,323 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 533 transitions. Word has length 55 [2025-01-09 06:06:26,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:26,323 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 533 transitions. [2025-01-09 06:06:26,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:26,323 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 533 transitions. [2025-01-09 06:06:26,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 06:06:26,324 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:26,325 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:26,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:06:26,325 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:26,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:26,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1277081782, now seen corresponding path program 1 times [2025-01-09 06:06:26,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:26,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960626016] [2025-01-09 06:06:26,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:26,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:26,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 06:06:26,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 06:06:26,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:26,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:26,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:26,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:26,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960626016] [2025-01-09 06:06:26,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960626016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:26,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:26,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:26,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462550930] [2025-01-09 06:06:26,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:26,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:26,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:26,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:26,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:26,421 INFO L87 Difference]: Start difference. First operand 379 states and 533 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:26,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:26,458 INFO L93 Difference]: Finished difference Result 649 states and 923 transitions. [2025-01-09 06:06:26,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:06:26,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2025-01-09 06:06:26,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:26,461 INFO L225 Difference]: With dead ends: 649 [2025-01-09 06:06:26,462 INFO L226 Difference]: Without dead ends: 388 [2025-01-09 06:06:26,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:26,464 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 0 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:26,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1162 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:26,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-01-09 06:06:26,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2025-01-09 06:06:26,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 308 states have (on average 1.422077922077922) internal successors, (438), 314 states have internal predecessors, (438), 51 states have call successors, (51), 26 states have call predecessors, (51), 27 states have return successors, (53), 50 states have call predecessors, (53), 49 states have call successors, (53) [2025-01-09 06:06:26,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 542 transitions. [2025-01-09 06:06:26,492 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 542 transitions. Word has length 55 [2025-01-09 06:06:26,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:26,493 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 542 transitions. [2025-01-09 06:06:26,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:26,493 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 542 transitions. [2025-01-09 06:06:26,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 06:06:26,495 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:26,495 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:26,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:06:26,495 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:26,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:26,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1978681656, now seen corresponding path program 1 times [2025-01-09 06:06:26,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:26,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681990166] [2025-01-09 06:06:26,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:26,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:26,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 06:06:26,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 06:06:26,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:26,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:26,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:26,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:26,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681990166] [2025-01-09 06:06:26,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681990166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:26,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:26,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:26,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188691670] [2025-01-09 06:06:26,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:26,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:26,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:26,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:26,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:26,572 INFO L87 Difference]: Start difference. First operand 388 states and 542 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:26,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:26,906 INFO L93 Difference]: Finished difference Result 1632 states and 2331 transitions. [2025-01-09 06:06:26,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:26,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2025-01-09 06:06:26,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:26,917 INFO L225 Difference]: With dead ends: 1632 [2025-01-09 06:06:26,917 INFO L226 Difference]: Without dead ends: 1362 [2025-01-09 06:06:26,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:06:26,919 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 778 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:26,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 824 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:06:26,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2025-01-09 06:06:27,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1333. [2025-01-09 06:06:27,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 1058 states have (on average 1.393194706994329) internal successors, (1474), 1081 states have internal predecessors, (1474), 166 states have call successors, (166), 98 states have call predecessors, (166), 107 states have return successors, (226), 156 states have call predecessors, (226), 164 states have call successors, (226) [2025-01-09 06:06:27,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1866 transitions. [2025-01-09 06:06:27,064 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1866 transitions. Word has length 55 [2025-01-09 06:06:27,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:27,064 INFO L471 AbstractCegarLoop]: Abstraction has 1333 states and 1866 transitions. [2025-01-09 06:06:27,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:27,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1866 transitions. [2025-01-09 06:06:27,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:06:27,066 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:27,066 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:27,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:06:27,066 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:27,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:27,067 INFO L85 PathProgramCache]: Analyzing trace with hash 2038598496, now seen corresponding path program 1 times [2025-01-09 06:06:27,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:27,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150134411] [2025-01-09 06:06:27,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:27,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:27,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:06:27,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:06:27,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:27,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:27,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:27,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:27,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150134411] [2025-01-09 06:06:27,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150134411] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:27,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:27,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:27,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161541655] [2025-01-09 06:06:27,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:27,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:27,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:27,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:27,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:27,150 INFO L87 Difference]: Start difference. First operand 1333 states and 1866 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:27,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:27,580 INFO L93 Difference]: Finished difference Result 1548 states and 2180 transitions. [2025-01-09 06:06:27,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:27,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 63 [2025-01-09 06:06:27,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:27,589 INFO L225 Difference]: With dead ends: 1548 [2025-01-09 06:06:27,589 INFO L226 Difference]: Without dead ends: 1448 [2025-01-09 06:06:27,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:27,591 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 290 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:27,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 671 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:06:27,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2025-01-09 06:06:27,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1441. [2025-01-09 06:06:27,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1441 states, 1144 states have (on average 1.395979020979021) internal successors, (1597), 1169 states have internal predecessors, (1597), 179 states have call successors, (179), 105 states have call predecessors, (179), 116 states have return successors, (244), 170 states have call predecessors, (244), 177 states have call successors, (244) [2025-01-09 06:06:27,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 2020 transitions. [2025-01-09 06:06:27,706 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 2020 transitions. Word has length 63 [2025-01-09 06:06:27,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:27,706 INFO L471 AbstractCegarLoop]: Abstraction has 1441 states and 2020 transitions. [2025-01-09 06:06:27,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:27,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 2020 transitions. [2025-01-09 06:06:27,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:06:27,708 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:27,708 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:27,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:06:27,708 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:27,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:27,709 INFO L85 PathProgramCache]: Analyzing trace with hash -247920096, now seen corresponding path program 1 times [2025-01-09 06:06:27,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:27,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396304560] [2025-01-09 06:06:27,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:27,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:27,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:06:27,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:06:27,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:27,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:27,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:27,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:27,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396304560] [2025-01-09 06:06:27,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396304560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:27,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:27,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:27,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087905303] [2025-01-09 06:06:27,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:27,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:27,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:27,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:27,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:27,818 INFO L87 Difference]: Start difference. First operand 1441 states and 2020 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:28,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:28,379 INFO L93 Difference]: Finished difference Result 1796 states and 2523 transitions. [2025-01-09 06:06:28,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:28,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 63 [2025-01-09 06:06:28,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:28,388 INFO L225 Difference]: With dead ends: 1796 [2025-01-09 06:06:28,388 INFO L226 Difference]: Without dead ends: 1595 [2025-01-09 06:06:28,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:06:28,391 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 424 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:28,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 972 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:06:28,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2025-01-09 06:06:28,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1549. [2025-01-09 06:06:28,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1549 states, 1230 states have (on average 1.397560975609756) internal successors, (1719), 1257 states have internal predecessors, (1719), 192 states have call successors, (192), 112 states have call predecessors, (192), 125 states have return successors, (265), 184 states have call predecessors, (265), 190 states have call successors, (265) [2025-01-09 06:06:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 2176 transitions. [2025-01-09 06:06:28,470 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 2176 transitions. Word has length 63 [2025-01-09 06:06:28,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:28,471 INFO L471 AbstractCegarLoop]: Abstraction has 1549 states and 2176 transitions. [2025-01-09 06:06:28,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:28,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 2176 transitions. [2025-01-09 06:06:28,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:06:28,473 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:28,473 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:28,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 06:06:28,474 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:28,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:28,474 INFO L85 PathProgramCache]: Analyzing trace with hash -263438814, now seen corresponding path program 1 times [2025-01-09 06:06:28,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:28,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150412977] [2025-01-09 06:06:28,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:28,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:28,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:06:28,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:06:28,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:28,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:28,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:28,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:28,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150412977] [2025-01-09 06:06:28,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150412977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:28,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:28,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:06:28,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555270782] [2025-01-09 06:06:28,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:28,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:06:28,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:28,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:06:28,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:28,534 INFO L87 Difference]: Start difference. First operand 1549 states and 2176 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:06:28,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:28,713 INFO L93 Difference]: Finished difference Result 2419 states and 3422 transitions. [2025-01-09 06:06:28,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:28,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2025-01-09 06:06:28,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:28,723 INFO L225 Difference]: With dead ends: 2419 [2025-01-09 06:06:28,723 INFO L226 Difference]: Without dead ends: 2116 [2025-01-09 06:06:28,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:28,725 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 388 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:28,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 759 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:06:28,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2025-01-09 06:06:28,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 2099. [2025-01-09 06:06:28,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2099 states, 1670 states have (on average 1.3934131736526947) internal successors, (2327), 1705 states have internal predecessors, (2327), 252 states have call successors, (252), 154 states have call predecessors, (252), 175 states have return successors, (350), 244 states have call predecessors, (350), 250 states have call successors, (350) [2025-01-09 06:06:28,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 2929 transitions. [2025-01-09 06:06:28,831 INFO L78 Accepts]: Start accepts. Automaton has 2099 states and 2929 transitions. Word has length 63 [2025-01-09 06:06:28,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:28,832 INFO L471 AbstractCegarLoop]: Abstraction has 2099 states and 2929 transitions. [2025-01-09 06:06:28,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:06:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 2929 transitions. [2025-01-09 06:06:28,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 06:06:28,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:28,835 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:28,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 06:06:28,835 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:28,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:28,835 INFO L85 PathProgramCache]: Analyzing trace with hash -891129783, now seen corresponding path program 1 times [2025-01-09 06:06:28,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:28,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481480042] [2025-01-09 06:06:28,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:28,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:28,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:06:28,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:06:28,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:28,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:28,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:28,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:28,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481480042] [2025-01-09 06:06:28,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481480042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:28,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:28,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:28,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131853269] [2025-01-09 06:06:28,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:28,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:28,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:28,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:28,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:28,881 INFO L87 Difference]: Start difference. First operand 2099 states and 2929 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:06:28,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:28,963 INFO L93 Difference]: Finished difference Result 2972 states and 4163 transitions. [2025-01-09 06:06:28,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:28,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2025-01-09 06:06:28,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:28,972 INFO L225 Difference]: With dead ends: 2972 [2025-01-09 06:06:28,973 INFO L226 Difference]: Without dead ends: 2119 [2025-01-09 06:06:28,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:28,975 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 0 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:28,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1454 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:28,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2025-01-09 06:06:29,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 2119. [2025-01-09 06:06:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2119 states, 1686 states have (on average 1.3867141162514829) internal successors, (2338), 1721 states have internal predecessors, (2338), 252 states have call successors, (252), 154 states have call predecessors, (252), 179 states have return successors, (357), 248 states have call predecessors, (357), 250 states have call successors, (357) [2025-01-09 06:06:29,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 2119 states and 2947 transitions. [2025-01-09 06:06:29,077 INFO L78 Accepts]: Start accepts. Automaton has 2119 states and 2947 transitions. Word has length 64 [2025-01-09 06:06:29,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:29,077 INFO L471 AbstractCegarLoop]: Abstraction has 2119 states and 2947 transitions. [2025-01-09 06:06:29,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:06:29,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 2947 transitions. [2025-01-09 06:06:29,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 06:06:29,078 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:29,079 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:29,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 06:06:29,079 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:29,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:29,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1285496569, now seen corresponding path program 1 times [2025-01-09 06:06:29,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:29,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131924926] [2025-01-09 06:06:29,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:29,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:29,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:06:29,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:06:29,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:29,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:29,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:29,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:29,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131924926] [2025-01-09 06:06:29,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131924926] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:29,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:29,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:29,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957875612] [2025-01-09 06:06:29,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:29,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:29,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:29,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:29,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:29,145 INFO L87 Difference]: Start difference. First operand 2119 states and 2947 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:06:29,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:29,654 INFO L93 Difference]: Finished difference Result 4581 states and 6384 transitions. [2025-01-09 06:06:29,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:06:29,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2025-01-09 06:06:29,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:29,665 INFO L225 Difference]: With dead ends: 4581 [2025-01-09 06:06:29,666 INFO L226 Difference]: Without dead ends: 2409 [2025-01-09 06:06:29,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:06:29,671 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 1105 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:29,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1524 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:06:29,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2409 states. [2025-01-09 06:06:29,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2409 to 2044. [2025-01-09 06:06:29,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 1611 states have (on average 1.3680943513345747) internal successors, (2204), 1646 states have internal predecessors, (2204), 252 states have call successors, (252), 154 states have call predecessors, (252), 179 states have return successors, (345), 248 states have call predecessors, (345), 250 states have call successors, (345) [2025-01-09 06:06:29,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2801 transitions. [2025-01-09 06:06:29,776 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2801 transitions. Word has length 64 [2025-01-09 06:06:29,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:29,777 INFO L471 AbstractCegarLoop]: Abstraction has 2044 states and 2801 transitions. [2025-01-09 06:06:29,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:06:29,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2801 transitions. [2025-01-09 06:06:29,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 06:06:29,778 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:29,778 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:29,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 06:06:29,779 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:29,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:29,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1508011930, now seen corresponding path program 1 times [2025-01-09 06:06:29,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:29,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884345450] [2025-01-09 06:06:29,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:29,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:29,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 06:06:29,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 06:06:29,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:29,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:29,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:29,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:29,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884345450] [2025-01-09 06:06:29,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884345450] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:29,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:29,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:29,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690607700] [2025-01-09 06:06:29,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:29,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:29,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:29,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:29,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:29,833 INFO L87 Difference]: Start difference. First operand 2044 states and 2801 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:06:29,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:29,982 INFO L93 Difference]: Finished difference Result 2887 states and 3928 transitions. [2025-01-09 06:06:29,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:29,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2025-01-09 06:06:29,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:29,993 INFO L225 Difference]: With dead ends: 2887 [2025-01-09 06:06:29,994 INFO L226 Difference]: Without dead ends: 2089 [2025-01-09 06:06:29,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:29,998 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 0 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:29,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1415 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:30,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2025-01-09 06:06:30,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 2089. [2025-01-09 06:06:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 1647 states have (on average 1.3600485731633272) internal successors, (2240), 1682 states have internal predecessors, (2240), 252 states have call successors, (252), 154 states have call predecessors, (252), 188 states have return successors, (354), 257 states have call predecessors, (354), 250 states have call successors, (354) [2025-01-09 06:06:30,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2846 transitions. [2025-01-09 06:06:30,128 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2846 transitions. Word has length 65 [2025-01-09 06:06:30,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:30,128 INFO L471 AbstractCegarLoop]: Abstraction has 2089 states and 2846 transitions. [2025-01-09 06:06:30,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:06:30,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2846 transitions. [2025-01-09 06:06:30,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 06:06:30,131 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:30,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 06:06:30,132 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:30,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:30,133 INFO L85 PathProgramCache]: Analyzing trace with hash -863727332, now seen corresponding path program 1 times [2025-01-09 06:06:30,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:30,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021508028] [2025-01-09 06:06:30,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:30,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:30,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 06:06:30,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 06:06:30,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:30,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:30,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:30,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021508028] [2025-01-09 06:06:30,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021508028] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:30,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:30,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:30,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806162899] [2025-01-09 06:06:30,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:30,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:30,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:30,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:30,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:30,230 INFO L87 Difference]: Start difference. First operand 2089 states and 2846 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:30,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:30,764 INFO L93 Difference]: Finished difference Result 2986 states and 3996 transitions. [2025-01-09 06:06:30,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:06:30,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-01-09 06:06:30,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:30,776 INFO L225 Difference]: With dead ends: 2986 [2025-01-09 06:06:30,777 INFO L226 Difference]: Without dead ends: 2228 [2025-01-09 06:06:30,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:06:30,781 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 424 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:30,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 693 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:06:30,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2025-01-09 06:06:30,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 2098. [2025-01-09 06:06:30,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 1656 states have (on average 1.3568840579710144) internal successors, (2247), 1689 states have internal predecessors, (2247), 253 states have call successors, (253), 155 states have call predecessors, (253), 187 states have return successors, (349), 258 states have call predecessors, (349), 251 states have call successors, (349) [2025-01-09 06:06:30,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 2849 transitions. [2025-01-09 06:06:30,895 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 2849 transitions. Word has length 65 [2025-01-09 06:06:30,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:30,895 INFO L471 AbstractCegarLoop]: Abstraction has 2098 states and 2849 transitions. [2025-01-09 06:06:30,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:30,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2849 transitions. [2025-01-09 06:06:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 06:06:30,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:30,899 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:30,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 06:06:30,899 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:30,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:30,899 INFO L85 PathProgramCache]: Analyzing trace with hash -644872614, now seen corresponding path program 1 times [2025-01-09 06:06:30,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:30,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518080108] [2025-01-09 06:06:30,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:30,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:30,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 06:06:30,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 06:06:30,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:30,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:30,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:30,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:30,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518080108] [2025-01-09 06:06:30,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518080108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:30,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:30,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:06:30,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084010229] [2025-01-09 06:06:30,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:30,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:06:30,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:30,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:06:30,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:30,944 INFO L87 Difference]: Start difference. First operand 2098 states and 2849 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:31,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:31,305 INFO L93 Difference]: Finished difference Result 3788 states and 5083 transitions. [2025-01-09 06:06:31,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:06:31,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-01-09 06:06:31,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:31,318 INFO L225 Difference]: With dead ends: 3788 [2025-01-09 06:06:31,318 INFO L226 Difference]: Without dead ends: 2939 [2025-01-09 06:06:31,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:31,322 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 379 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:31,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 355 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:06:31,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2025-01-09 06:06:31,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 2929. [2025-01-09 06:06:31,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2929 states, 2292 states have (on average 1.331588132635253) internal successors, (3052), 2338 states have internal predecessors, (3052), 357 states have call successors, (357), 219 states have call predecessors, (357), 278 states have return successors, (526), 379 states have call predecessors, (526), 355 states have call successors, (526) [2025-01-09 06:06:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 3935 transitions. [2025-01-09 06:06:31,507 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 3935 transitions. Word has length 65 [2025-01-09 06:06:31,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:31,507 INFO L471 AbstractCegarLoop]: Abstraction has 2929 states and 3935 transitions. [2025-01-09 06:06:31,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:31,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 3935 transitions. [2025-01-09 06:06:31,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 06:06:31,509 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:31,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 06:06:31,509 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:31,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:31,510 INFO L85 PathProgramCache]: Analyzing trace with hash -956653344, now seen corresponding path program 1 times [2025-01-09 06:06:31,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:31,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14756834] [2025-01-09 06:06:31,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:31,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:31,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 06:06:31,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 06:06:31,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:31,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:31,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:31,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14756834] [2025-01-09 06:06:31,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14756834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:31,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:31,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:06:31,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895935258] [2025-01-09 06:06:31,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:31,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:06:31,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:31,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:06:31,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:06:31,533 INFO L87 Difference]: Start difference. First operand 2929 states and 3935 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:06:31,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:31,645 INFO L93 Difference]: Finished difference Result 4473 states and 6023 transitions. [2025-01-09 06:06:31,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:06:31,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2025-01-09 06:06:31,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:31,652 INFO L225 Difference]: With dead ends: 4473 [2025-01-09 06:06:31,653 INFO L226 Difference]: Without dead ends: 1226 [2025-01-09 06:06:31,659 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 [2025-01-09 06:06:31,659 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 254 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:31,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 271 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:31,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2025-01-09 06:06:31,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1226. [2025-01-09 06:06:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 975 states have (on average 1.3856410256410256) internal successors, (1351), 995 states have internal predecessors, (1351), 150 states have call successors, (150), 90 states have call predecessors, (150), 100 states have return successors, (212), 142 states have call predecessors, (212), 150 states have call successors, (212) [2025-01-09 06:06:31,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1713 transitions. [2025-01-09 06:06:31,742 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1713 transitions. Word has length 66 [2025-01-09 06:06:31,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:31,742 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1713 transitions. [2025-01-09 06:06:31,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:06:31,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1713 transitions. [2025-01-09 06:06:31,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 06:06:31,744 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:31,744 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:31,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 06:06:31,744 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:31,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:31,745 INFO L85 PathProgramCache]: Analyzing trace with hash 990024867, now seen corresponding path program 1 times [2025-01-09 06:06:31,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:31,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296323214] [2025-01-09 06:06:31,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:31,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:31,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 06:06:31,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 06:06:31,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:31,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:31,802 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 06:06:31,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:31,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296323214] [2025-01-09 06:06:31,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296323214] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:06:31,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845011904] [2025-01-09 06:06:31,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:31,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:06:31,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:06:31,804 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 06:06:31,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 06:06:31,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 06:06:31,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 06:06:31,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:31,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:31,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 06:06:31,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:06:31,929 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 06:06:31,930 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 06:06:31,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845011904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:31,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 06:06:31,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 06:06:31,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116615357] [2025-01-09 06:06:31,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:31,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:06:31,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:31,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:06:31,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:31,931 INFO L87 Difference]: Start difference. First operand 1226 states and 1713 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 06:06:32,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:32,134 INFO L93 Difference]: Finished difference Result 3534 states and 4972 transitions. [2025-01-09 06:06:32,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:06:32,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 89 [2025-01-09 06:06:32,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:32,148 INFO L225 Difference]: With dead ends: 3534 [2025-01-09 06:06:32,148 INFO L226 Difference]: Without dead ends: 1685 [2025-01-09 06:06:32,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:32,154 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 112 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:32,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 383 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:32,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2025-01-09 06:06:32,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1685. [2025-01-09 06:06:32,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1685 states, 1347 states have (on average 1.3711952487008165) internal successors, (1847), 1371 states have internal predecessors, (1847), 200 states have call successors, (200), 123 states have call predecessors, (200), 137 states have return successors, (286), 192 states have call predecessors, (286), 200 states have call successors, (286) [2025-01-09 06:06:32,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 2333 transitions. [2025-01-09 06:06:32,268 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 2333 transitions. Word has length 89 [2025-01-09 06:06:32,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:32,268 INFO L471 AbstractCegarLoop]: Abstraction has 1685 states and 2333 transitions. [2025-01-09 06:06:32,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 06:06:32,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 2333 transitions. [2025-01-09 06:06:32,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 06:06:32,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:32,271 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:32,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 06:06:32,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 06:06:32,475 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:32,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:32,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1480607905, now seen corresponding path program 1 times [2025-01-09 06:06:32,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:32,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960431056] [2025-01-09 06:06:32,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:32,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:32,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 06:06:32,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 06:06:32,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:32,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:32,527 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-09 06:06:32,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:32,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960431056] [2025-01-09 06:06:32,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960431056] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:06:32,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228750694] [2025-01-09 06:06:32,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:32,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:06:32,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:06:32,532 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 06:06:32,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 06:06:32,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 06:06:32,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 06:06:32,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:32,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:32,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 06:06:32,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:06:32,654 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 06:06:32,654 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 06:06:32,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228750694] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:32,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 06:06:32,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 06:06:32,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904340352] [2025-01-09 06:06:32,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:32,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:06:32,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:32,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:06:32,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:32,656 INFO L87 Difference]: Start difference. First operand 1685 states and 2333 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 06:06:32,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:32,749 INFO L93 Difference]: Finished difference Result 3624 states and 5084 transitions. [2025-01-09 06:06:32,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:06:32,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 130 [2025-01-09 06:06:32,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:32,760 INFO L225 Difference]: With dead ends: 3624 [2025-01-09 06:06:32,761 INFO L226 Difference]: Without dead ends: 1949 [2025-01-09 06:06:32,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:32,764 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 115 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:32,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 163 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:32,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2025-01-09 06:06:32,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1949. [2025-01-09 06:06:32,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1949 states, 1581 states have (on average 1.2985452245414295) internal successors, (2053), 1605 states have internal predecessors, (2053), 206 states have call successors, (206), 144 states have call predecessors, (206), 161 states have return successors, (298), 201 states have call predecessors, (298), 206 states have call successors, (298) [2025-01-09 06:06:32,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 2557 transitions. [2025-01-09 06:06:32,855 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 2557 transitions. Word has length 130 [2025-01-09 06:06:32,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:32,856 INFO L471 AbstractCegarLoop]: Abstraction has 1949 states and 2557 transitions. [2025-01-09 06:06:32,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 06:06:32,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 2557 transitions. [2025-01-09 06:06:32,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 06:06:32,858 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:32,858 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:32,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 06:06:33,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 06:06:33,059 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:33,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:33,060 INFO L85 PathProgramCache]: Analyzing trace with hash -191909726, now seen corresponding path program 2 times [2025-01-09 06:06:33,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:33,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226916893] [2025-01-09 06:06:33,060 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 06:06:33,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:33,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 130 statements into 2 equivalence classes. [2025-01-09 06:06:33,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 53 of 130 statements. [2025-01-09 06:06:33,071 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 06:06:33,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:33,099 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-01-09 06:06:33,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:33,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226916893] [2025-01-09 06:06:33,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226916893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:33,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:33,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:33,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806247991] [2025-01-09 06:06:33,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:33,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:33,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:33,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:33,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:33,100 INFO L87 Difference]: Start difference. First operand 1949 states and 2557 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 06:06:33,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:33,178 INFO L93 Difference]: Finished difference Result 3905 states and 5270 transitions. [2025-01-09 06:06:33,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:06:33,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 130 [2025-01-09 06:06:33,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:33,187 INFO L225 Difference]: With dead ends: 3905 [2025-01-09 06:06:33,187 INFO L226 Difference]: Without dead ends: 1967 [2025-01-09 06:06:33,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:33,191 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:33,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 534 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:33,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2025-01-09 06:06:33,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1967. [2025-01-09 06:06:33,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1967 states, 1599 states have (on average 1.2764227642276422) internal successors, (2041), 1623 states have internal predecessors, (2041), 206 states have call successors, (206), 144 states have call predecessors, (206), 161 states have return successors, (298), 201 states have call predecessors, (298), 206 states have call successors, (298) [2025-01-09 06:06:33,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 2545 transitions. [2025-01-09 06:06:33,279 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 2545 transitions. Word has length 130 [2025-01-09 06:06:33,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:33,279 INFO L471 AbstractCegarLoop]: Abstraction has 1967 states and 2545 transitions. [2025-01-09 06:06:33,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 06:06:33,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 2545 transitions. [2025-01-09 06:06:33,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 06:06:33,281 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:33,282 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:33,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 06:06:33,283 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:33,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:33,283 INFO L85 PathProgramCache]: Analyzing trace with hash -99851294, now seen corresponding path program 1 times [2025-01-09 06:06:33,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:33,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460859344] [2025-01-09 06:06:33,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:33,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:33,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 06:06:33,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 06:06:33,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:33,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-01-09 06:06:33,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:33,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460859344] [2025-01-09 06:06:33,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460859344] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:33,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:33,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:33,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393874303] [2025-01-09 06:06:33,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:33,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:33,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:33,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:33,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:33,407 INFO L87 Difference]: Start difference. First operand 1967 states and 2545 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:06:33,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:33,688 INFO L93 Difference]: Finished difference Result 3441 states and 4441 transitions. [2025-01-09 06:06:33,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:33,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 130 [2025-01-09 06:06:33,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:33,696 INFO L225 Difference]: With dead ends: 3441 [2025-01-09 06:06:33,696 INFO L226 Difference]: Without dead ends: 2088 [2025-01-09 06:06:33,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:06:33,699 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 186 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:33,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 409 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:06:33,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2025-01-09 06:06:33,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 1939. [2025-01-09 06:06:33,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1939 states, 1578 states have (on average 1.2712294043092522) internal successors, (2006), 1595 states have internal predecessors, (2006), 206 states have call successors, (206), 144 states have call predecessors, (206), 154 states have return successors, (283), 200 states have call predecessors, (283), 206 states have call successors, (283) [2025-01-09 06:06:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2495 transitions. [2025-01-09 06:06:33,788 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 2495 transitions. Word has length 130 [2025-01-09 06:06:33,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:33,789 INFO L471 AbstractCegarLoop]: Abstraction has 1939 states and 2495 transitions. [2025-01-09 06:06:33,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:06:33,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2495 transitions. [2025-01-09 06:06:33,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 06:06:33,790 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:33,791 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:33,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 06:06:33,791 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:33,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:33,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1251533924, now seen corresponding path program 1 times [2025-01-09 06:06:33,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:33,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919904518] [2025-01-09 06:06:33,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:33,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:33,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 06:06:33,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 06:06:33,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:33,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:33,856 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-01-09 06:06:33,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:33,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919904518] [2025-01-09 06:06:33,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919904518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:33,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:33,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:33,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125000500] [2025-01-09 06:06:33,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:33,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:33,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:33,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:33,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:33,857 INFO L87 Difference]: Start difference. First operand 1939 states and 2495 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:06:34,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:34,061 INFO L93 Difference]: Finished difference Result 3726 states and 4786 transitions. [2025-01-09 06:06:34,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:34,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 130 [2025-01-09 06:06:34,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:34,069 INFO L225 Difference]: With dead ends: 3726 [2025-01-09 06:06:34,069 INFO L226 Difference]: Without dead ends: 1799 [2025-01-09 06:06:34,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:06:34,073 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 174 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:34,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 224 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:06:34,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2025-01-09 06:06:34,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1527. [2025-01-09 06:06:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1527 states, 1251 states have (on average 1.2134292565947242) internal successors, (1518), 1263 states have internal predecessors, (1518), 150 states have call successors, (150), 111 states have call predecessors, (150), 125 states have return successors, (192), 153 states have call predecessors, (192), 150 states have call successors, (192) [2025-01-09 06:06:34,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 1860 transitions. [2025-01-09 06:06:34,156 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 1860 transitions. Word has length 130 [2025-01-09 06:06:34,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:34,158 INFO L471 AbstractCegarLoop]: Abstraction has 1527 states and 1860 transitions. [2025-01-09 06:06:34,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:06:34,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 1860 transitions. [2025-01-09 06:06:34,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 06:06:34,159 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:34,160 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:34,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 06:06:34,160 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:34,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:34,161 INFO L85 PathProgramCache]: Analyzing trace with hash -367440990, now seen corresponding path program 1 times [2025-01-09 06:06:34,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:34,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379439771] [2025-01-09 06:06:34,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:34,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:34,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 06:06:34,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 06:06:34,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:34,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:34,214 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-09 06:06:34,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:34,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379439771] [2025-01-09 06:06:34,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379439771] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:06:34,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120795946] [2025-01-09 06:06:34,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:34,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:06:34,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:06:34,217 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 06:06:34,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 06:06:34,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 06:06:34,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 06:06:34,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:34,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:34,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 06:06:34,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:06:34,317 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 06:06:34,321 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 06:06:34,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120795946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:34,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 06:06:34,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2025-01-09 06:06:34,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992660649] [2025-01-09 06:06:34,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:34,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:06:34,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:34,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:06:34,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:34,323 INFO L87 Difference]: Start difference. First operand 1527 states and 1860 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 06:06:34,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:34,393 INFO L93 Difference]: Finished difference Result 3033 states and 3712 transitions. [2025-01-09 06:06:34,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:06:34,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 130 [2025-01-09 06:06:34,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:34,401 INFO L225 Difference]: With dead ends: 3033 [2025-01-09 06:06:34,401 INFO L226 Difference]: Without dead ends: 1518 [2025-01-09 06:06:34,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:34,404 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 110 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:34,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 255 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:34,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2025-01-09 06:06:34,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1518. [2025-01-09 06:06:34,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1242 states have (on average 1.1932367149758454) internal successors, (1482), 1254 states have internal predecessors, (1482), 150 states have call successors, (150), 111 states have call predecessors, (150), 125 states have return successors, (192), 153 states have call predecessors, (192), 150 states have call successors, (192) [2025-01-09 06:06:34,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1824 transitions. [2025-01-09 06:06:34,479 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1824 transitions. Word has length 130 [2025-01-09 06:06:34,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:34,480 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 1824 transitions. [2025-01-09 06:06:34,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 06:06:34,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1824 transitions. [2025-01-09 06:06:34,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 06:06:34,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:34,482 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:34,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 06:06:34,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:06:34,684 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:34,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:34,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1524013987, now seen corresponding path program 1 times [2025-01-09 06:06:34,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:34,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205609882] [2025-01-09 06:06:34,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:34,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:34,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 06:06:34,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 06:06:34,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:34,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:34,756 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 06:06:34,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:34,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205609882] [2025-01-09 06:06:34,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205609882] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:06:34,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163868114] [2025-01-09 06:06:34,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:34,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:06:34,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:06:34,760 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 06:06:34,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 06:06:34,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 06:06:34,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 06:06:34,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:34,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:34,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 06:06:34,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:06:34,864 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 06:06:34,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 06:06:34,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163868114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:34,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 06:06:34,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-01-09 06:06:34,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228003529] [2025-01-09 06:06:34,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:34,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:06:34,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:34,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:06:34,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:06:34,869 INFO L87 Difference]: Start difference. First operand 1518 states and 1824 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 06:06:35,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:35,016 INFO L93 Difference]: Finished difference Result 3547 states and 4235 transitions. [2025-01-09 06:06:35,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:06:35,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 131 [2025-01-09 06:06:35,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:35,027 INFO L225 Difference]: With dead ends: 3547 [2025-01-09 06:06:35,027 INFO L226 Difference]: Without dead ends: 1024 [2025-01-09 06:06:35,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:06:35,035 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 105 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:35,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 322 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:35,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2025-01-09 06:06:35,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1024. [2025-01-09 06:06:35,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 831 states have (on average 1.1600481347773766) internal successors, (964), 839 states have internal predecessors, (964), 110 states have call successors, (110), 78 states have call predecessors, (110), 82 states have return successors, (124), 107 states have call predecessors, (124), 110 states have call successors, (124) [2025-01-09 06:06:35,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1198 transitions. [2025-01-09 06:06:35,140 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1198 transitions. Word has length 131 [2025-01-09 06:06:35,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:35,141 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1198 transitions. [2025-01-09 06:06:35,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 06:06:35,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1198 transitions. [2025-01-09 06:06:35,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 06:06:35,142 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:35,142 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:35,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 06:06:35,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-09 06:06:35,344 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:35,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:35,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1301375943, now seen corresponding path program 1 times [2025-01-09 06:06:35,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:35,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424571917] [2025-01-09 06:06:35,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:35,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:35,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 06:06:35,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 06:06:35,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:35,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:35,393 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 06:06:35,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:35,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424571917] [2025-01-09 06:06:35,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424571917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:35,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:35,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:06:35,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707071126] [2025-01-09 06:06:35,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:35,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:06:35,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:35,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:06:35,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:35,395 INFO L87 Difference]: Start difference. First operand 1024 states and 1198 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 06:06:35,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:35,528 INFO L93 Difference]: Finished difference Result 1827 states and 2158 transitions. [2025-01-09 06:06:35,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:35,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 132 [2025-01-09 06:06:35,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:35,537 INFO L225 Difference]: With dead ends: 1827 [2025-01-09 06:06:35,537 INFO L226 Difference]: Without dead ends: 1024 [2025-01-09 06:06:35,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:35,540 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 190 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:35,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 371 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:06:35,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2025-01-09 06:06:35,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1024. [2025-01-09 06:06:35,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 831 states have (on average 1.1456077015643802) internal successors, (952), 839 states have internal predecessors, (952), 110 states have call successors, (110), 78 states have call predecessors, (110), 82 states have return successors, (124), 107 states have call predecessors, (124), 110 states have call successors, (124) [2025-01-09 06:06:35,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1186 transitions. [2025-01-09 06:06:35,596 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1186 transitions. Word has length 132 [2025-01-09 06:06:35,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:35,597 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1186 transitions. [2025-01-09 06:06:35,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 06:06:35,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1186 transitions. [2025-01-09 06:06:35,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 06:06:35,598 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:35,598 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:35,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 06:06:35,598 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:35,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:35,599 INFO L85 PathProgramCache]: Analyzing trace with hash 139890629, now seen corresponding path program 1 times [2025-01-09 06:06:35,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:35,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815770966] [2025-01-09 06:06:35,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:35,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:35,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 06:06:35,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 06:06:35,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:35,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:35,692 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-01-09 06:06:35,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:35,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815770966] [2025-01-09 06:06:35,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815770966] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:35,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:35,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:06:35,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420635082] [2025-01-09 06:06:35,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:35,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:06:35,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:35,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:06:35,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:35,693 INFO L87 Difference]: Start difference. First operand 1024 states and 1186 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 06:06:35,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:35,837 INFO L93 Difference]: Finished difference Result 1263 states and 1454 transitions. [2025-01-09 06:06:35,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:35,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 133 [2025-01-09 06:06:35,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:35,841 INFO L225 Difference]: With dead ends: 1263 [2025-01-09 06:06:35,841 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 06:06:35,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:35,844 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 200 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:35,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 393 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:06:35,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 06:06:35,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 06:06:35,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:06:35,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 06:06:35,847 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 133 [2025-01-09 06:06:35,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:35,847 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 06:06:35,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 06:06:35,847 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 06:06:35,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 06:06:35,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-01-09 06:06:35,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-09 06:06:35,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 06:06:35,852 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:35,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 06:06:53,790 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 06:06:53,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 06:06:53 BoogieIcfgContainer [2025-01-09 06:06:53,818 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 06:06:53,819 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 06:06:53,819 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 06:06:53,819 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 06:06:53,820 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:06:24" (3/4) ... [2025-01-09 06:06:53,821 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 06:06:53,830 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2025-01-09 06:06:53,831 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2025-01-09 06:06:53,831 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2025-01-09 06:06:53,831 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2025-01-09 06:06:53,831 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2025-01-09 06:06:53,831 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2025-01-09 06:06:53,831 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2025-01-09 06:06:53,831 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2025-01-09 06:06:53,831 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2025-01-09 06:06:53,831 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2025-01-09 06:06:53,831 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2025-01-09 06:06:53,831 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2025-01-09 06:06:53,831 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2025-01-09 06:06:53,831 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2025-01-09 06:06:53,840 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-01-09 06:06:53,840 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 06:06:53,844 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 06:06:53,844 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 06:06:53,951 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 06:06:53,951 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 06:06:53,951 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 06:06:53,952 INFO L158 Benchmark]: Toolchain (without parser) took 30946.34ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 124.3MB in the beginning and 575.8MB in the end (delta: -451.5MB). Peak memory consumption was 773.4MB. Max. memory is 16.1GB. [2025-01-09 06:06:53,952 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 06:06:53,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.53ms. Allocated memory is still 167.8MB. Free memory was 124.3MB in the beginning and 107.0MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 06:06:53,953 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.44ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 105.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 06:06:53,953 INFO L158 Benchmark]: Boogie Preprocessor took 48.66ms. Allocated memory is still 167.8MB. Free memory was 105.0MB in the beginning and 102.1MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 06:06:53,953 INFO L158 Benchmark]: RCFGBuilder took 590.88ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 71.5MB in the end (delta: 30.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 06:06:53,953 INFO L158 Benchmark]: TraceAbstraction took 29792.00ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 70.8MB in the beginning and 588.3MB in the end (delta: -517.6MB). Peak memory consumption was 777.2MB. Max. memory is 16.1GB. [2025-01-09 06:06:53,953 INFO L158 Benchmark]: Witness Printer took 132.17ms. Allocated memory is still 1.4GB. Free memory was 588.3MB in the beginning and 575.8MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 06:06:53,954 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.53ms. Allocated memory is still 167.8MB. Free memory was 124.3MB in the beginning and 107.0MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.44ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 105.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.66ms. Allocated memory is still 167.8MB. Free memory was 105.0MB in the beginning and 102.1MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 590.88ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 71.5MB in the end (delta: 30.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 29792.00ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 70.8MB in the beginning and 588.3MB in the end (delta: -517.6MB). Peak memory consumption was 777.2MB. Max. memory is 16.1GB. * Witness Printer took 132.17ms. Allocated memory is still 1.4GB. Free memory was 588.3MB in the beginning and 575.8MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 599]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 27]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 218 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 11.8s, OverallIterations: 23, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6570 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6408 mSDsluCounter, 15136 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9753 mSDsCounter, 885 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4716 IncrementalHoareTripleChecker+Invalid, 5601 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 885 mSolverCounterUnsat, 5383 mSDtfsCounter, 4716 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 652 GetRequests, 554 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2929occurred in iteration=13, InterpolantAutomatonStates: 127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 1070 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2468 NumberOfCodeBlocks, 2391 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2441 ConstructedInterpolants, 0 QuantifiedInterpolants, 3425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1587 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 27 InterpolantComputations, 23 PerfectInterpolantSequences, 853/897 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 678]: Location Invariant Derived location invariant: (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1)) || (((((((p_dw_pc == 0) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (m_pc != 1)) && (t1_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1))) || ((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (((long long) local + 1) == token)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) - InvariantResult [Line: 172]: Location Invariant Derived location invariant: (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) - InvariantResult [Line: 499]: Loop Invariant Derived loop invariant: (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) - InvariantResult [Line: 1007]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_pc == t1_pc)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (t1_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1)) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_pc != t1_pc)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_pc == t1_pc)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (m_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || ((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (m_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1))) || (((((((p_dw_pc == 0) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (((long long) local + 1) == token)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1))) - InvariantResult [Line: 634]: Location Invariant Derived location invariant: (((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1)) || ((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (((long long) local + 1) == token)) && (q_write_ev == q_read_ev)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_pc == t1_pc)) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) - InvariantResult [Line: 789]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_pc == t1_pc)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (t1_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1)) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_pc != t1_pc)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_pc == t1_pc)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (m_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || ((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (m_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1))) || (((((((p_dw_pc == 0) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (((long long) local + 1) == token)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1))) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) - InvariantResult [Line: 218]: Location Invariant Derived location invariant: (((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (M_E == 2)) RESULT: Ultimate proved your program to be correct! [2025-01-09 06:06:53,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE