./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_2.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/systemc/pc_sfifo_2.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 b74079121634b4e5d8b815834e604eed77442466d93875e78a8cab3fe135fa1f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:15:43,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:15:43,538 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:15:43,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:15:43,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:15:43,577 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:15:43,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:15:43,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:15:43,578 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:15:43,578 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:15:43,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:15:43,578 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:15:43,579 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:15:43,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:15:43,579 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:15:43,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:15:43,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:15:43,579 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:15:43,579 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:15:43,579 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:15:43,581 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:15:43,581 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:15:43,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:15:43,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:15:43,582 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:15:43,582 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:15:43,582 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:15:43,582 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:15:43,582 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:15:43,582 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:15:43,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:15:43,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:15:43,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:15:43,583 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:15:43,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:15:43,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:15:43,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:15:43,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:15:43,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:15:43,584 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:15:43,584 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:15:43,584 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:15:43,584 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:15:43,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:15:43,584 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:15:43,584 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:15:43,585 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:15:43,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:15:43,585 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 -> b74079121634b4e5d8b815834e604eed77442466d93875e78a8cab3fe135fa1f [2025-01-09 04:15:43,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:15:43,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:15:43,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:15:43,865 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:15:43,865 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:15:43,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2025-01-09 04:15:45,187 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd940162c/450e05f508f04996855ca0ea7c7c5fa8/FLAGd7e600208 [2025-01-09 04:15:45,456 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:15:45,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2025-01-09 04:15:45,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd940162c/450e05f508f04996855ca0ea7c7c5fa8/FLAGd7e600208 [2025-01-09 04:15:45,754 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd940162c/450e05f508f04996855ca0ea7c7c5fa8 [2025-01-09 04:15:45,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:15:45,758 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:15:45,759 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:15:45,759 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:15:45,764 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:15:45,764 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:15:45" (1/1) ... [2025-01-09 04:15:45,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184cb39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:45, skipping insertion in model container [2025-01-09 04:15:45,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:15:45" (1/1) ... [2025-01-09 04:15:45,788 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:15:45,914 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/systemc/pc_sfifo_2.cil-1.c[643,656] [2025-01-09 04:15:45,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:15:45,995 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:15:46,005 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/systemc/pc_sfifo_2.cil-1.c[643,656] [2025-01-09 04:15:46,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:15:46,059 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:15:46,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:46 WrapperNode [2025-01-09 04:15:46,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:15:46,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:15:46,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:15:46,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:15:46,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:46" (1/1) ... [2025-01-09 04:15:46,076 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:46" (1/1) ... [2025-01-09 04:15:46,100 INFO L138 Inliner]: procedures = 29, calls = 31, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 177 [2025-01-09 04:15:46,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:15:46,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:15:46,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:15:46,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:15:46,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:46" (1/1) ... [2025-01-09 04:15:46,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:46" (1/1) ... [2025-01-09 04:15:46,118 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:46" (1/1) ... [2025-01-09 04:15:46,136 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 04:15:46,139 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:46" (1/1) ... [2025-01-09 04:15:46,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:46" (1/1) ... [2025-01-09 04:15:46,146 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:46" (1/1) ... [2025-01-09 04:15:46,149 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:46" (1/1) ... [2025-01-09 04:15:46,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:46" (1/1) ... [2025-01-09 04:15:46,157 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:46" (1/1) ... [2025-01-09 04:15:46,160 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:46" (1/1) ... [2025-01-09 04:15:46,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:15:46,163 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:15:46,163 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:15:46,163 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:15:46,164 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:46" (1/1) ... [2025-01-09 04:15:46,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:15:46,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:46,198 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 04:15:46,200 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 04:15:46,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:15:46,225 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-01-09 04:15:46,225 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-01-09 04:15:46,225 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-01-09 04:15:46,225 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-01-09 04:15:46,226 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 04:15:46,226 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 04:15:46,226 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 04:15:46,226 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 04:15:46,226 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 04:15:46,226 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 04:15:46,227 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 04:15:46,227 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 04:15:46,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:15:46,227 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 04:15:46,228 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 04:15:46,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:15:46,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:15:46,228 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-01-09 04:15:46,228 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-01-09 04:15:46,291 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:15:46,293 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:15:46,529 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-01-09 04:15:46,529 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:15:46,539 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:15:46,539 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 04:15:46,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:15:46 BoogieIcfgContainer [2025-01-09 04:15:46,540 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:15:46,542 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:15:46,542 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:15:46,546 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:15:46,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:15:45" (1/3) ... [2025-01-09 04:15:46,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15301c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:15:46, skipping insertion in model container [2025-01-09 04:15:46,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:46" (2/3) ... [2025-01-09 04:15:46,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15301c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:15:46, skipping insertion in model container [2025-01-09 04:15:46,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:15:46" (3/3) ... [2025-01-09 04:15:46,549 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2025-01-09 04:15:46,562 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:15:46,564 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1.c that has 9 procedures, 99 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-09 04:15:46,609 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:15:46,617 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;@732d79c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:15:46,618 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:15:46,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 79 states have internal predecessors, (112), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 04:15:46,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 04:15:46,629 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:46,629 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] [2025-01-09 04:15:46,630 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:46,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:46,634 INFO L85 PathProgramCache]: Analyzing trace with hash -200948337, now seen corresponding path program 1 times [2025-01-09 04:15:46,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:46,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728314788] [2025-01-09 04:15:46,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:46,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:46,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 04:15:46,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 04:15:46,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:46,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:46,928 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 04:15:46,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:46,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728314788] [2025-01-09 04:15:46,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728314788] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:46,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:46,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:46,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912251842] [2025-01-09 04:15:46,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:46,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:46,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:46,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:46,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:46,958 INFO L87 Difference]: Start difference. First operand has 99 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 79 states have internal predecessors, (112), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 04:15:47,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:47,006 INFO L93 Difference]: Finished difference Result 189 states and 269 transitions. [2025-01-09 04:15:47,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:47,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 61 [2025-01-09 04:15:47,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:47,019 INFO L225 Difference]: With dead ends: 189 [2025-01-09 04:15:47,019 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 04:15:47,024 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 04:15:47,027 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 125 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:47,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 130 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:47,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 04:15:47,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-01-09 04:15:47,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 71 states have (on average 1.4225352112676057) internal successors, (101), 73 states have internal predecessors, (101), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 04:15:47,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 127 transitions. [2025-01-09 04:15:47,085 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 127 transitions. Word has length 61 [2025-01-09 04:15:47,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:47,086 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 127 transitions. [2025-01-09 04:15:47,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 04:15:47,087 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 127 transitions. [2025-01-09 04:15:47,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 04:15:47,091 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:47,092 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] [2025-01-09 04:15:47,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:15:47,092 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:47,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:47,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1739288367, now seen corresponding path program 1 times [2025-01-09 04:15:47,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:47,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589472236] [2025-01-09 04:15:47,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:47,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:47,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 04:15:47,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 04:15:47,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:47,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:47,373 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 04:15:47,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:47,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589472236] [2025-01-09 04:15:47,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589472236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:47,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:47,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:15:47,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582286815] [2025-01-09 04:15:47,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:47,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:15:47,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:47,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:15:47,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:15:47,379 INFO L87 Difference]: Start difference. First operand 93 states and 127 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 04:15:47,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:47,710 INFO L93 Difference]: Finished difference Result 276 states and 387 transitions. [2025-01-09 04:15:47,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:15:47,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 61 [2025-01-09 04:15:47,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:47,714 INFO L225 Difference]: With dead ends: 276 [2025-01-09 04:15:47,714 INFO L226 Difference]: Without dead ends: 192 [2025-01-09 04:15:47,715 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 04:15:47,716 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 201 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:47,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 309 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:15:47,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-01-09 04:15:47,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 185. [2025-01-09 04:15:47,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 143 states have (on average 1.4055944055944056) internal successors, (201), 147 states have internal predecessors, (201), 25 states have call successors, (25), 15 states have call predecessors, (25), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2025-01-09 04:15:47,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 254 transitions. [2025-01-09 04:15:47,753 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 254 transitions. Word has length 61 [2025-01-09 04:15:47,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:47,754 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 254 transitions. [2025-01-09 04:15:47,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 04:15:47,754 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 254 transitions. [2025-01-09 04:15:47,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 04:15:47,756 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:47,756 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] [2025-01-09 04:15:47,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:15:47,756 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:47,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:47,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1535952367, now seen corresponding path program 1 times [2025-01-09 04:15:47,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:47,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113231668] [2025-01-09 04:15:47,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:47,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:47,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 04:15:47,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 04:15:47,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:47,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:47,923 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 04:15:47,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:47,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113231668] [2025-01-09 04:15:47,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113231668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:47,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:47,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:15:47,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759027231] [2025-01-09 04:15:47,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:47,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:15:47,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:47,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:15:47,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:47,926 INFO L87 Difference]: Start difference. First operand 185 states and 254 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 04:15:48,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:48,376 INFO L93 Difference]: Finished difference Result 490 states and 672 transitions. [2025-01-09 04:15:48,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:15:48,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 61 [2025-01-09 04:15:48,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:48,379 INFO L225 Difference]: With dead ends: 490 [2025-01-09 04:15:48,382 INFO L226 Difference]: Without dead ends: 321 [2025-01-09 04:15:48,383 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 04:15:48,386 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 219 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:48,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 562 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:15:48,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-01-09 04:15:48,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 277. [2025-01-09 04:15:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 215 states have (on average 1.3953488372093024) internal successors, (300), 221 states have internal predecessors, (300), 36 states have call successors, (36), 22 states have call predecessors, (36), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) [2025-01-09 04:15:48,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 383 transitions. [2025-01-09 04:15:48,448 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 383 transitions. Word has length 61 [2025-01-09 04:15:48,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:48,448 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 383 transitions. [2025-01-09 04:15:48,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 04:15:48,448 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 383 transitions. [2025-01-09 04:15:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 04:15:48,452 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:48,453 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] [2025-01-09 04:15:48,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:15:48,453 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:48,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:48,453 INFO L85 PathProgramCache]: Analyzing trace with hash 403209679, now seen corresponding path program 1 times [2025-01-09 04:15:48,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:48,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669064527] [2025-01-09 04:15:48,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:48,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:48,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 04:15:48,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 04:15:48,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:48,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:48,569 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 04:15:48,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:48,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669064527] [2025-01-09 04:15:48,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669064527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:48,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:48,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:15:48,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137097019] [2025-01-09 04:15:48,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:48,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:15:48,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:48,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:15:48,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:48,571 INFO L87 Difference]: Start difference. First operand 277 states and 383 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 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 04:15:48,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:48,624 INFO L93 Difference]: Finished difference Result 537 states and 744 transitions. [2025-01-09 04:15:48,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:15:48,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 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 61 [2025-01-09 04:15:48,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:48,627 INFO L225 Difference]: With dead ends: 537 [2025-01-09 04:15:48,627 INFO L226 Difference]: Without dead ends: 282 [2025-01-09 04:15:48,628 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 04:15:48,629 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 615 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 04:15:48,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 615 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:48,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-01-09 04:15:48,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2025-01-09 04:15:48,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 219 states have (on average 1.3789954337899544) internal successors, (302), 225 states have internal predecessors, (302), 36 states have call successors, (36), 22 states have call predecessors, (36), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) [2025-01-09 04:15:48,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 386 transitions. [2025-01-09 04:15:48,666 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 386 transitions. Word has length 61 [2025-01-09 04:15:48,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:48,667 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 386 transitions. [2025-01-09 04:15:48,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 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 04:15:48,668 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 386 transitions. [2025-01-09 04:15:48,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 04:15:48,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:48,672 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] [2025-01-09 04:15:48,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:15:48,672 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:48,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:48,673 INFO L85 PathProgramCache]: Analyzing trace with hash -440795823, now seen corresponding path program 1 times [2025-01-09 04:15:48,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:48,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926561635] [2025-01-09 04:15:48,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:48,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:48,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 04:15:48,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 04:15:48,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:48,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:48,798 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 04:15:48,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:48,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926561635] [2025-01-09 04:15:48,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926561635] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:48,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:48,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:15:48,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699140878] [2025-01-09 04:15:48,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:48,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:15:48,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:48,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:15:48,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:48,800 INFO L87 Difference]: Start difference. First operand 282 states and 386 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 04:15:49,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:49,391 INFO L93 Difference]: Finished difference Result 2208 states and 3070 transitions. [2025-01-09 04:15:49,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:15:49,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 61 [2025-01-09 04:15:49,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:49,406 INFO L225 Difference]: With dead ends: 2208 [2025-01-09 04:15:49,406 INFO L226 Difference]: Without dead ends: 1948 [2025-01-09 04:15:49,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:15:49,409 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 802 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:49,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 1139 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:15:49,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2025-01-09 04:15:49,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1818. [2025-01-09 04:15:49,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1818 states, 1416 states have (on average 1.3368644067796611) internal successors, (1893), 1450 states have internal predecessors, (1893), 201 states have call successors, (201), 166 states have call predecessors, (201), 200 states have return successors, (317), 204 states have call predecessors, (317), 199 states have call successors, (317) [2025-01-09 04:15:49,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 2411 transitions. [2025-01-09 04:15:49,600 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 2411 transitions. Word has length 61 [2025-01-09 04:15:49,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:49,600 INFO L471 AbstractCegarLoop]: Abstraction has 1818 states and 2411 transitions. [2025-01-09 04:15:49,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 04:15:49,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2411 transitions. [2025-01-09 04:15:49,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 04:15:49,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:49,602 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] [2025-01-09 04:15:49,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:15:49,603 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:49,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:49,603 INFO L85 PathProgramCache]: Analyzing trace with hash 478178800, now seen corresponding path program 1 times [2025-01-09 04:15:49,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:49,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339363847] [2025-01-09 04:15:49,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:49,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:49,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 04:15:49,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 04:15:49,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:49,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:49,688 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 04:15:49,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:49,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339363847] [2025-01-09 04:15:49,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339363847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:49,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:49,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:15:49,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209086985] [2025-01-09 04:15:49,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:49,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:15:49,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:49,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:15:49,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:49,690 INFO L87 Difference]: Start difference. First operand 1818 states and 2411 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 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 04:15:49,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:49,877 INFO L93 Difference]: Finished difference Result 3659 states and 4902 transitions. [2025-01-09 04:15:49,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:15:49,878 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 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 61 [2025-01-09 04:15:49,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:49,890 INFO L225 Difference]: With dead ends: 3659 [2025-01-09 04:15:49,890 INFO L226 Difference]: Without dead ends: 1863 [2025-01-09 04:15:49,896 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 04:15:49,897 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 615 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 04:15:49,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 615 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:49,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2025-01-09 04:15:50,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1863. [2025-01-09 04:15:50,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1863 states, 1452 states have (on average 1.3181818181818181) internal successors, (1914), 1486 states have internal predecessors, (1914), 201 states have call successors, (201), 166 states have call predecessors, (201), 209 states have return successors, (335), 213 states have call predecessors, (335), 199 states have call successors, (335) [2025-01-09 04:15:50,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1863 states and 2450 transitions. [2025-01-09 04:15:50,095 INFO L78 Accepts]: Start accepts. Automaton has 1863 states and 2450 transitions. Word has length 61 [2025-01-09 04:15:50,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:50,095 INFO L471 AbstractCegarLoop]: Abstraction has 1863 states and 2450 transitions. [2025-01-09 04:15:50,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 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 04:15:50,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1863 states and 2450 transitions. [2025-01-09 04:15:50,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 04:15:50,097 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:50,097 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] [2025-01-09 04:15:50,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:15:50,098 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:50,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:50,098 INFO L85 PathProgramCache]: Analyzing trace with hash 540218414, now seen corresponding path program 1 times [2025-01-09 04:15:50,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:50,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331195617] [2025-01-09 04:15:50,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:50,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:50,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 04:15:50,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 04:15:50,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:50,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:50,262 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 04:15:50,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:50,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331195617] [2025-01-09 04:15:50,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331195617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:50,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:50,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:15:50,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322838238] [2025-01-09 04:15:50,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:50,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:15:50,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:50,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:15:50,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:50,265 INFO L87 Difference]: Start difference. First operand 1863 states and 2450 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 04:15:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:50,767 INFO L93 Difference]: Finished difference Result 3559 states and 4639 transitions. [2025-01-09 04:15:50,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 04:15:50,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 61 [2025-01-09 04:15:50,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:50,781 INFO L225 Difference]: With dead ends: 3559 [2025-01-09 04:15:50,782 INFO L226 Difference]: Without dead ends: 2065 [2025-01-09 04:15:50,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:15:50,788 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 226 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:50,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 369 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:15:50,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2065 states. [2025-01-09 04:15:50,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2065 to 1873. [2025-01-09 04:15:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1464 states have (on average 1.310792349726776) internal successors, (1919), 1493 states have internal predecessors, (1919), 202 states have call successors, (202), 167 states have call predecessors, (202), 206 states have return successors, (319), 215 states have call predecessors, (319), 200 states have call successors, (319) [2025-01-09 04:15:50,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2440 transitions. [2025-01-09 04:15:50,938 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2440 transitions. Word has length 61 [2025-01-09 04:15:50,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:50,939 INFO L471 AbstractCegarLoop]: Abstraction has 1873 states and 2440 transitions. [2025-01-09 04:15:50,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 04:15:50,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2440 transitions. [2025-01-09 04:15:50,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 04:15:50,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:50,942 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] [2025-01-09 04:15:50,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:15:50,942 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:50,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:50,943 INFO L85 PathProgramCache]: Analyzing trace with hash 962920240, now seen corresponding path program 1 times [2025-01-09 04:15:50,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:50,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211837699] [2025-01-09 04:15:50,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:50,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:50,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 04:15:50,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 04:15:50,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:50,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:51,001 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 04:15:51,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:51,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211837699] [2025-01-09 04:15:51,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211837699] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:51,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:51,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:15:51,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577863901] [2025-01-09 04:15:51,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:51,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:15:51,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:51,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:15:51,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:15:51,003 INFO L87 Difference]: Start difference. First operand 1873 states and 2440 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 04:15:51,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:51,409 INFO L93 Difference]: Finished difference Result 5502 states and 7211 transitions. [2025-01-09 04:15:51,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:15:51,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 61 [2025-01-09 04:15:51,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:51,435 INFO L225 Difference]: With dead ends: 5502 [2025-01-09 04:15:51,435 INFO L226 Difference]: Without dead ends: 3654 [2025-01-09 04:15:51,443 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 04:15:51,444 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 182 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:51,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 183 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:15:51,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2025-01-09 04:15:51,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3650. [2025-01-09 04:15:51,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3650 states, 2828 states have (on average 1.2772277227722773) internal successors, (3612), 2887 states have internal predecessors, (3612), 404 states have call successors, (404), 333 states have call predecessors, (404), 417 states have return successors, (697), 435 states have call predecessors, (697), 402 states have call successors, (697) [2025-01-09 04:15:51,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 4713 transitions. [2025-01-09 04:15:51,719 INFO L78 Accepts]: Start accepts. Automaton has 3650 states and 4713 transitions. Word has length 61 [2025-01-09 04:15:51,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:51,719 INFO L471 AbstractCegarLoop]: Abstraction has 3650 states and 4713 transitions. [2025-01-09 04:15:51,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 04:15:51,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3650 states and 4713 transitions. [2025-01-09 04:15:51,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 04:15:51,721 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:51,722 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] [2025-01-09 04:15:51,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:15:51,722 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:51,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:51,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1977542758, now seen corresponding path program 1 times [2025-01-09 04:15:51,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:51,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642134840] [2025-01-09 04:15:51,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:51,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:51,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 04:15:51,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 04:15:51,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:51,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:51,759 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 04:15:51,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:51,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642134840] [2025-01-09 04:15:51,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642134840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:51,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:51,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:51,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232169171] [2025-01-09 04:15:51,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:51,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:51,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:51,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:51,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:51,760 INFO L87 Difference]: Start difference. First operand 3650 states and 4713 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 04:15:52,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:52,182 INFO L93 Difference]: Finished difference Result 9627 states and 12575 transitions. [2025-01-09 04:15:52,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:52,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 62 [2025-01-09 04:15:52,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:52,223 INFO L225 Difference]: With dead ends: 9627 [2025-01-09 04:15:52,223 INFO L226 Difference]: Without dead ends: 5981 [2025-01-09 04:15:52,236 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 04:15:52,237 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 101 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:52,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 229 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:52,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5981 states. [2025-01-09 04:15:52,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5981 to 5847. [2025-01-09 04:15:52,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5847 states, 4487 states have (on average 1.2716737240918208) internal successors, (5706), 4563 states have internal predecessors, (5706), 665 states have call successors, (665), 565 states have call predecessors, (665), 694 states have return successors, (1151), 724 states have call predecessors, (1151), 663 states have call successors, (1151) [2025-01-09 04:15:52,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5847 states to 5847 states and 7522 transitions. [2025-01-09 04:15:52,644 INFO L78 Accepts]: Start accepts. Automaton has 5847 states and 7522 transitions. Word has length 62 [2025-01-09 04:15:52,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:52,645 INFO L471 AbstractCegarLoop]: Abstraction has 5847 states and 7522 transitions. [2025-01-09 04:15:52,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 04:15:52,645 INFO L276 IsEmpty]: Start isEmpty. Operand 5847 states and 7522 transitions. [2025-01-09 04:15:52,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:15:52,648 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:52,648 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, 1] [2025-01-09 04:15:52,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:15:52,648 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:52,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:52,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1971572668, now seen corresponding path program 1 times [2025-01-09 04:15:52,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:52,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248249085] [2025-01-09 04:15:52,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:52,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:52,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:15:52,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:15:52,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:52,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:52,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:52,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:52,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248249085] [2025-01-09 04:15:52,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248249085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:52,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:52,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:15:52,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405348506] [2025-01-09 04:15:52,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:52,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:15:52,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:52,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:15:52,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:15:52,720 INFO L87 Difference]: Start difference. First operand 5847 states and 7522 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 04:15:53,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:53,149 INFO L93 Difference]: Finished difference Result 6965 states and 8901 transitions. [2025-01-09 04:15:53,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:15:53,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 67 [2025-01-09 04:15:53,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:53,187 INFO L225 Difference]: With dead ends: 6965 [2025-01-09 04:15:53,188 INFO L226 Difference]: Without dead ends: 6962 [2025-01-09 04:15:53,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:15:53,192 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 265 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:53,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 223 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:15:53,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6962 states. [2025-01-09 04:15:53,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6962 to 6863. [2025-01-09 04:15:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6863 states, 5252 states have (on average 1.2638994668697638) internal successors, (6638), 5337 states have internal predecessors, (6638), 791 states have call successors, (791), 679 states have call predecessors, (791), 819 states have return successors, (1344), 852 states have call predecessors, (1344), 790 states have call successors, (1344) [2025-01-09 04:15:53,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6863 states to 6863 states and 8773 transitions. [2025-01-09 04:15:53,793 INFO L78 Accepts]: Start accepts. Automaton has 6863 states and 8773 transitions. Word has length 67 [2025-01-09 04:15:53,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:53,794 INFO L471 AbstractCegarLoop]: Abstraction has 6863 states and 8773 transitions. [2025-01-09 04:15:53,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 04:15:53,795 INFO L276 IsEmpty]: Start isEmpty. Operand 6863 states and 8773 transitions. [2025-01-09 04:15:53,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:15:53,797 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:53,797 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, 1, 1] [2025-01-09 04:15:53,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:15:53,797 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:53,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:53,798 INFO L85 PathProgramCache]: Analyzing trace with hash 988858685, now seen corresponding path program 1 times [2025-01-09 04:15:53,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:53,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749170227] [2025-01-09 04:15:53,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:53,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:53,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:15:53,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:15:53,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:53,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:53,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:53,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749170227] [2025-01-09 04:15:53,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749170227] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:15:53,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940572028] [2025-01-09 04:15:53,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:53,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:15:53,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:53,935 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 04:15:53,937 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 04:15:53,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:15:54,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:15:54,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:54,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:54,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 04:15:54,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:15:54,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:54,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:15:54,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:54,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940572028] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:15:54,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:15:54,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2025-01-09 04:15:54,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302522288] [2025-01-09 04:15:54,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:15:54,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:15:54,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:54,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:15:54,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:15:54,479 INFO L87 Difference]: Start difference. First operand 6863 states and 8773 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 04:15:55,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:55,820 INFO L93 Difference]: Finished difference Result 14739 states and 18746 transitions. [2025-01-09 04:15:55,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:15:55,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 68 [2025-01-09 04:15:55,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:55,919 INFO L225 Difference]: With dead ends: 14739 [2025-01-09 04:15:55,919 INFO L226 Difference]: Without dead ends: 14736 [2025-01-09 04:15:55,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:15:55,927 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 418 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:55,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1182 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:15:55,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14736 states. [2025-01-09 04:15:56,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14736 to 13426. [2025-01-09 04:15:56,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13426 states, 10291 states have (on average 1.2631425517442425) internal successors, (12999), 10456 states have internal predecessors, (12999), 1523 states have call successors, (1523), 1313 states have call predecessors, (1523), 1611 states have return successors, (2611), 1662 states have call predecessors, (2611), 1522 states have call successors, (2611) [2025-01-09 04:15:56,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13426 states to 13426 states and 17133 transitions. [2025-01-09 04:15:56,917 INFO L78 Accepts]: Start accepts. Automaton has 13426 states and 17133 transitions. Word has length 68 [2025-01-09 04:15:56,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:56,917 INFO L471 AbstractCegarLoop]: Abstraction has 13426 states and 17133 transitions. [2025-01-09 04:15:56,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 04:15:56,918 INFO L276 IsEmpty]: Start isEmpty. Operand 13426 states and 17133 transitions. [2025-01-09 04:15:56,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:15:56,922 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:56,922 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:56,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:15:57,186 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,SelfDestructingSolverStorable10 [2025-01-09 04:15:57,187 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:57,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:57,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1012308155, now seen corresponding path program 2 times [2025-01-09 04:15:57,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:57,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545129497] [2025-01-09 04:15:57,188 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:15:57,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:57,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-01-09 04:15:57,202 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:15:57,203 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:15:57,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:57,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:57,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545129497] [2025-01-09 04:15:57,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545129497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:57,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:57,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:57,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486430603] [2025-01-09 04:15:57,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:57,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:57,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:57,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:57,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:57,241 INFO L87 Difference]: Start difference. First operand 13426 states and 17133 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 04:15:58,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:58,039 INFO L93 Difference]: Finished difference Result 20152 states and 25822 transitions. [2025-01-09 04:15:58,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:15:58,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 70 [2025-01-09 04:15:58,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:58,087 INFO L225 Difference]: With dead ends: 20152 [2025-01-09 04:15:58,087 INFO L226 Difference]: Without dead ends: 7576 [2025-01-09 04:15:58,128 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 04:15:58,129 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 97 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:58,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 312 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:58,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7576 states. [2025-01-09 04:15:58,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7576 to 7478. [2025-01-09 04:15:58,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7478 states, 5744 states have (on average 1.233983286908078) internal successors, (7088), 5823 states have internal predecessors, (7088), 857 states have call successors, (857), 735 states have call predecessors, (857), 876 states have return successors, (1357), 925 states have call predecessors, (1357), 856 states have call successors, (1357) [2025-01-09 04:15:58,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7478 states to 7478 states and 9302 transitions. [2025-01-09 04:15:58,695 INFO L78 Accepts]: Start accepts. Automaton has 7478 states and 9302 transitions. Word has length 70 [2025-01-09 04:15:58,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:58,695 INFO L471 AbstractCegarLoop]: Abstraction has 7478 states and 9302 transitions. [2025-01-09 04:15:58,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 04:15:58,696 INFO L276 IsEmpty]: Start isEmpty. Operand 7478 states and 9302 transitions. [2025-01-09 04:15:58,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 04:15:58,699 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:58,699 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:15:58,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:15:58,699 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:58,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:58,700 INFO L85 PathProgramCache]: Analyzing trace with hash 403091264, now seen corresponding path program 1 times [2025-01-09 04:15:58,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:58,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668046668] [2025-01-09 04:15:58,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:58,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:58,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:15:58,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:15:58,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:58,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:58,803 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 04:15:58,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:58,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668046668] [2025-01-09 04:15:58,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668046668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:58,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:58,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:15:58,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686703487] [2025-01-09 04:15:58,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:58,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:15:58,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:58,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:15:58,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:58,805 INFO L87 Difference]: Start difference. First operand 7478 states and 9302 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:16:00,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:00,091 INFO L93 Difference]: Finished difference Result 22464 states and 28073 transitions. [2025-01-09 04:16:00,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:16:00,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 79 [2025-01-09 04:16:00,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:00,183 INFO L225 Difference]: With dead ends: 22464 [2025-01-09 04:16:00,183 INFO L226 Difference]: Without dead ends: 15014 [2025-01-09 04:16:00,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:16:00,214 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 478 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:00,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 497 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:16:00,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15014 states. [2025-01-09 04:16:01,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15014 to 14371. [2025-01-09 04:16:01,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14371 states, 10958 states have (on average 1.2080671655411572) internal successors, (13238), 11141 states have internal predecessors, (13238), 1664 states have call successors, (1664), 1435 states have call predecessors, (1664), 1748 states have return successors, (2856), 1800 states have call predecessors, (2856), 1663 states have call successors, (2856) [2025-01-09 04:16:01,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14371 states to 14371 states and 17758 transitions. [2025-01-09 04:16:01,267 INFO L78 Accepts]: Start accepts. Automaton has 14371 states and 17758 transitions. Word has length 79 [2025-01-09 04:16:01,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:01,268 INFO L471 AbstractCegarLoop]: Abstraction has 14371 states and 17758 transitions. [2025-01-09 04:16:01,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:16:01,268 INFO L276 IsEmpty]: Start isEmpty. Operand 14371 states and 17758 transitions. [2025-01-09 04:16:01,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 04:16:01,274 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:01,274 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:16:01,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:16:01,274 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:01,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:01,275 INFO L85 PathProgramCache]: Analyzing trace with hash -228143040, now seen corresponding path program 1 times [2025-01-09 04:16:01,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:01,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846246359] [2025-01-09 04:16:01,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:01,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:01,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 04:16:01,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 04:16:01,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:01,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:01,390 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:16:01,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:01,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846246359] [2025-01-09 04:16:01,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846246359] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:01,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:01,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:16:01,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356863672] [2025-01-09 04:16:01,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:01,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:16:01,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:01,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:16:01,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:16:01,393 INFO L87 Difference]: Start difference. First operand 14371 states and 17758 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:16:03,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:03,256 INFO L93 Difference]: Finished difference Result 25945 states and 32083 transitions. [2025-01-09 04:16:03,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 04:16:03,257 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 85 [2025-01-09 04:16:03,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:03,332 INFO L225 Difference]: With dead ends: 25945 [2025-01-09 04:16:03,332 INFO L226 Difference]: Without dead ends: 12203 [2025-01-09 04:16:03,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:16:03,379 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 809 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:03,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 602 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:16:03,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12203 states. [2025-01-09 04:16:04,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12203 to 11475. [2025-01-09 04:16:04,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11475 states, 8794 states have (on average 1.1983170343415965) internal successors, (10538), 8933 states have internal predecessors, (10538), 1299 states have call successors, (1299), 1116 states have call predecessors, (1299), 1381 states have return successors, (2055), 1431 states have call predecessors, (2055), 1298 states have call successors, (2055) [2025-01-09 04:16:04,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11475 states to 11475 states and 13892 transitions. [2025-01-09 04:16:04,300 INFO L78 Accepts]: Start accepts. Automaton has 11475 states and 13892 transitions. Word has length 85 [2025-01-09 04:16:04,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:04,301 INFO L471 AbstractCegarLoop]: Abstraction has 11475 states and 13892 transitions. [2025-01-09 04:16:04,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:16:04,301 INFO L276 IsEmpty]: Start isEmpty. Operand 11475 states and 13892 transitions. [2025-01-09 04:16:04,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 04:16:04,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:04,313 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:16:04,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:16:04,313 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:04,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:04,314 INFO L85 PathProgramCache]: Analyzing trace with hash 937236794, now seen corresponding path program 1 times [2025-01-09 04:16:04,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:04,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150781368] [2025-01-09 04:16:04,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:04,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:04,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 04:16:04,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 04:16:04,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:04,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:04,443 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 17 proven. 17 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-09 04:16:04,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:04,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150781368] [2025-01-09 04:16:04,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150781368] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:16:04,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198240885] [2025-01-09 04:16:04,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:04,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:16:04,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:16:04,446 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 04:16:04,448 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 04:16:04,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 04:16:04,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 04:16:04,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:04,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:04,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:16:04,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:16:04,605 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:16:04,605 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:16:04,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198240885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:04,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:16:04,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-01-09 04:16:04,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204891233] [2025-01-09 04:16:04,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:04,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:04,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:04,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:04,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:16:04,608 INFO L87 Difference]: Start difference. First operand 11475 states and 13892 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 04:16:04,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:04,924 INFO L93 Difference]: Finished difference Result 16490 states and 19960 transitions. [2025-01-09 04:16:04,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:16:04,925 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 138 [2025-01-09 04:16:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:04,960 INFO L225 Difference]: With dead ends: 16490 [2025-01-09 04:16:04,960 INFO L226 Difference]: Without dead ends: 5043 [2025-01-09 04:16:04,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:16:04,985 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:04,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 601 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:16:04,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5043 states. [2025-01-09 04:16:05,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5043 to 4855. [2025-01-09 04:16:05,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4855 states, 3801 states have (on average 1.185214417258616) internal successors, (4505), 3843 states have internal predecessors, (4505), 505 states have call successors, (505), 417 states have call predecessors, (505), 548 states have return successors, (800), 594 states have call predecessors, (800), 504 states have call successors, (800) [2025-01-09 04:16:05,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4855 states to 4855 states and 5810 transitions. [2025-01-09 04:16:05,316 INFO L78 Accepts]: Start accepts. Automaton has 4855 states and 5810 transitions. Word has length 138 [2025-01-09 04:16:05,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:05,316 INFO L471 AbstractCegarLoop]: Abstraction has 4855 states and 5810 transitions. [2025-01-09 04:16:05,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 04:16:05,316 INFO L276 IsEmpty]: Start isEmpty. Operand 4855 states and 5810 transitions. [2025-01-09 04:16:05,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 04:16:05,324 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:05,324 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:16:05,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 04:16:05,528 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,SelfDestructingSolverStorable14 [2025-01-09 04:16:05,528 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:05,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:05,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1310865746, now seen corresponding path program 1 times [2025-01-09 04:16:05,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:05,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486171911] [2025-01-09 04:16:05,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:05,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:05,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 04:16:05,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 04:16:05,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:05,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:05,576 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-09 04:16:05,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:05,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486171911] [2025-01-09 04:16:05,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486171911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:05,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:05,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:16:05,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63047252] [2025-01-09 04:16:05,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:05,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:16:05,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:05,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:16:05,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:16:05,578 INFO L87 Difference]: Start difference. First operand 4855 states and 5810 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 04:16:05,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:05,859 INFO L93 Difference]: Finished difference Result 5168 states and 6176 transitions. [2025-01-09 04:16:05,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:16:05,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 140 [2025-01-09 04:16:05,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:05,884 INFO L225 Difference]: With dead ends: 5168 [2025-01-09 04:16:05,884 INFO L226 Difference]: Without dead ends: 4447 [2025-01-09 04:16:05,887 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 04:16:05,888 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:05,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 123 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:16:05,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4447 states. [2025-01-09 04:16:06,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4447 to 4447. [2025-01-09 04:16:06,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4447 states, 3489 states have (on average 1.1871596445973058) internal successors, (4142), 3528 states have internal predecessors, (4142), 459 states have call successors, (459), 377 states have call predecessors, (459), 498 states have return successors, (737), 541 states have call predecessors, (737), 458 states have call successors, (737) [2025-01-09 04:16:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4447 states to 4447 states and 5338 transitions. [2025-01-09 04:16:06,185 INFO L78 Accepts]: Start accepts. Automaton has 4447 states and 5338 transitions. Word has length 140 [2025-01-09 04:16:06,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:06,185 INFO L471 AbstractCegarLoop]: Abstraction has 4447 states and 5338 transitions. [2025-01-09 04:16:06,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 04:16:06,186 INFO L276 IsEmpty]: Start isEmpty. Operand 4447 states and 5338 transitions. [2025-01-09 04:16:06,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 04:16:06,193 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:06,193 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:16:06,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:16:06,194 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:06,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:06,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1891421501, now seen corresponding path program 1 times [2025-01-09 04:16:06,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:06,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35422594] [2025-01-09 04:16:06,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:06,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:06,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 04:16:06,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 04:16:06,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:06,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:06,278 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-01-09 04:16:06,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:06,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35422594] [2025-01-09 04:16:06,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35422594] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:06,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:06,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:16:06,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218437335] [2025-01-09 04:16:06,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:06,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:16:06,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:06,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:16:06,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:16:06,281 INFO L87 Difference]: Start difference. First operand 4447 states and 5338 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 04:16:06,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:06,686 INFO L93 Difference]: Finished difference Result 8527 states and 10268 transitions. [2025-01-09 04:16:06,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:16:06,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 149 [2025-01-09 04:16:06,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:06,712 INFO L225 Difference]: With dead ends: 8527 [2025-01-09 04:16:06,712 INFO L226 Difference]: Without dead ends: 4399 [2025-01-09 04:16:06,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 04:16:06,721 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 92 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:06,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 297 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:16:06,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4399 states. [2025-01-09 04:16:06,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4399 to 4165. [2025-01-09 04:16:06,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4165 states, 3274 states have (on average 1.1905925473427001) internal successors, (3898), 3321 states have internal predecessors, (3898), 425 states have call successors, (425), 351 states have call predecessors, (425), 465 states have return successors, (682), 492 states have call predecessors, (682), 424 states have call successors, (682) [2025-01-09 04:16:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4165 states to 4165 states and 5005 transitions. [2025-01-09 04:16:07,009 INFO L78 Accepts]: Start accepts. Automaton has 4165 states and 5005 transitions. Word has length 149 [2025-01-09 04:16:07,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:07,012 INFO L471 AbstractCegarLoop]: Abstraction has 4165 states and 5005 transitions. [2025-01-09 04:16:07,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 04:16:07,012 INFO L276 IsEmpty]: Start isEmpty. Operand 4165 states and 5005 transitions. [2025-01-09 04:16:07,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 04:16:07,018 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:07,019 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:16:07,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:16:07,019 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:07,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:07,019 INFO L85 PathProgramCache]: Analyzing trace with hash -471797827, now seen corresponding path program 1 times [2025-01-09 04:16:07,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:07,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85633308] [2025-01-09 04:16:07,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:07,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:07,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 04:16:07,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 04:16:07,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:07,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:07,287 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-01-09 04:16:07,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:07,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85633308] [2025-01-09 04:16:07,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85633308] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:16:07,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056840633] [2025-01-09 04:16:07,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:07,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:16:07,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:16:07,290 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 04:16:07,293 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 04:16:07,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 04:16:07,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 04:16:07,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:07,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:07,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 04:16:07,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:16:07,556 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 04:16:07,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:16:07,816 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-01-09 04:16:07,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056840633] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:16:07,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:16:07,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2025-01-09 04:16:07,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900006714] [2025-01-09 04:16:07,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:16:07,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:16:07,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:07,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:16:07,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:16:07,819 INFO L87 Difference]: Start difference. First operand 4165 states and 5005 transitions. Second operand has 13 states, 13 states have (on average 17.615384615384617) internal successors, (229), 13 states have internal predecessors, (229), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2025-01-09 04:16:08,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:08,976 INFO L93 Difference]: Finished difference Result 11719 states and 14687 transitions. [2025-01-09 04:16:08,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 04:16:08,977 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 17.615384615384617) internal successors, (229), 13 states have internal predecessors, (229), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 152 [2025-01-09 04:16:08,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:09,011 INFO L225 Difference]: With dead ends: 11719 [2025-01-09 04:16:09,012 INFO L226 Difference]: Without dead ends: 6054 [2025-01-09 04:16:09,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 312 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2025-01-09 04:16:09,026 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 732 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:09,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 380 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:16:09,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6054 states. [2025-01-09 04:16:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6054 to 4902. [2025-01-09 04:16:09,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4902 states, 3777 states have (on average 1.1723590150913423) internal successors, (4428), 3852 states have internal predecessors, (4428), 532 states have call successors, (532), 450 states have call predecessors, (532), 592 states have return successors, (987), 599 states have call predecessors, (987), 531 states have call successors, (987) [2025-01-09 04:16:09,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4902 states to 4902 states and 5947 transitions. [2025-01-09 04:16:09,413 INFO L78 Accepts]: Start accepts. Automaton has 4902 states and 5947 transitions. Word has length 152 [2025-01-09 04:16:09,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:09,414 INFO L471 AbstractCegarLoop]: Abstraction has 4902 states and 5947 transitions. [2025-01-09 04:16:09,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.615384615384617) internal successors, (229), 13 states have internal predecessors, (229), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2025-01-09 04:16:09,414 INFO L276 IsEmpty]: Start isEmpty. Operand 4902 states and 5947 transitions. [2025-01-09 04:16:09,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 04:16:09,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:09,422 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:16:09,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 04:16:09,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:16:09,623 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:09,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:09,624 INFO L85 PathProgramCache]: Analyzing trace with hash -384770487, now seen corresponding path program 1 times [2025-01-09 04:16:09,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:09,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142592109] [2025-01-09 04:16:09,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:09,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:09,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 04:16:09,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 04:16:09,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:09,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:09,733 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-01-09 04:16:09,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:09,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142592109] [2025-01-09 04:16:09,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142592109] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:16:09,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215052881] [2025-01-09 04:16:09,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:09,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:16:09,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:16:09,736 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 04:16:09,740 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 04:16:09,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 04:16:09,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 04:16:09,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:09,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:09,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 04:16:09,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:16:09,897 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-01-09 04:16:09,897 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:16:09,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215052881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:09,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:16:09,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-01-09 04:16:09,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405073303] [2025-01-09 04:16:09,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:09,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:16:09,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:09,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:16:09,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:16:09,899 INFO L87 Difference]: Start difference. First operand 4902 states and 5947 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 04:16:10,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:10,218 INFO L93 Difference]: Finished difference Result 6504 states and 7829 transitions. [2025-01-09 04:16:10,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:16:10,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 168 [2025-01-09 04:16:10,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:10,241 INFO L225 Difference]: With dead ends: 6504 [2025-01-09 04:16:10,242 INFO L226 Difference]: Without dead ends: 1439 [2025-01-09 04:16:10,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:16:10,252 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 147 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:10,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 209 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:16:10,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2025-01-09 04:16:10,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1366. [2025-01-09 04:16:10,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1069 states have (on average 1.137511693171188) internal successors, (1216), 1081 states have internal predecessors, (1216), 145 states have call successors, (145), 124 states have call predecessors, (145), 151 states have return successors, (214), 160 states have call predecessors, (214), 144 states have call successors, (214) [2025-01-09 04:16:10,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1575 transitions. [2025-01-09 04:16:10,395 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1575 transitions. Word has length 168 [2025-01-09 04:16:10,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:10,395 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 1575 transitions. [2025-01-09 04:16:10,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 04:16:10,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1575 transitions. [2025-01-09 04:16:10,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-01-09 04:16:10,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:10,402 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:16:10,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 04:16:10,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:16:10,603 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:10,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:10,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1184688435, now seen corresponding path program 1 times [2025-01-09 04:16:10,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:10,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32862458] [2025-01-09 04:16:10,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:10,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:10,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-01-09 04:16:10,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-01-09 04:16:10,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:10,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:10,713 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 54 proven. 7 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2025-01-09 04:16:10,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:10,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32862458] [2025-01-09 04:16:10,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32862458] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:16:10,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24382810] [2025-01-09 04:16:10,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:10,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:16:10,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:16:10,717 INFO L229 MonitoredProcess]: Starting monitored process 6 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 04:16:10,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 04:16:10,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-01-09 04:16:10,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-01-09 04:16:10,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:10,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:10,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 04:16:10,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:16:11,012 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 240 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 04:16:11,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:16:11,279 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 91 proven. 7 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2025-01-09 04:16:11,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24382810] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:16:11,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:16:11,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-09 04:16:11,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174162036] [2025-01-09 04:16:11,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:16:11,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:16:11,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:11,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:16:11,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:16:11,282 INFO L87 Difference]: Start difference. First operand 1366 states and 1575 transitions. Second operand has 9 states, 9 states have (on average 22.555555555555557) internal successors, (203), 8 states have internal predecessors, (203), 4 states have call successors, (38), 6 states have call predecessors, (38), 8 states have return successors, (37), 4 states have call predecessors, (37), 4 states have call successors, (37) [2025-01-09 04:16:11,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:11,670 INFO L93 Difference]: Finished difference Result 1655 states and 1896 transitions. [2025-01-09 04:16:11,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:16:11,671 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 22.555555555555557) internal successors, (203), 8 states have internal predecessors, (203), 4 states have call successors, (38), 6 states have call predecessors, (38), 8 states have return successors, (37), 4 states have call predecessors, (37), 4 states have call successors, (37) Word has length 238 [2025-01-09 04:16:11,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:11,683 INFO L225 Difference]: With dead ends: 1655 [2025-01-09 04:16:11,683 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 04:16:11,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 472 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:16:11,686 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 175 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:11,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 420 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:16:11,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 04:16:11,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 04:16:11,686 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 04:16:11,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 04:16:11,697 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 238 [2025-01-09 04:16:11,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:11,698 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 04:16:11,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.555555555555557) internal successors, (203), 8 states have internal predecessors, (203), 4 states have call successors, (38), 6 states have call predecessors, (38), 8 states have return successors, (37), 4 states have call predecessors, (37), 4 states have call successors, (37) [2025-01-09 04:16:11,698 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 04:16:11,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 04:16:11,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 04:16:11,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 04:16:11,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:16:11,904 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] [2025-01-09 04:16:11,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 04:16:41,679 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 04:16:41,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:16:41 BoogieIcfgContainer [2025-01-09 04:16:41,725 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 04:16:41,726 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 04:16:41,729 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 04:16:41,730 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 04:16:41,730 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:15:46" (3/4) ... [2025-01-09 04:16:41,732 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 04:16:41,738 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2025-01-09 04:16:41,738 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2025-01-09 04:16:41,739 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2025-01-09 04:16:41,739 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2025-01-09 04:16:41,739 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2025-01-09 04:16:41,739 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2025-01-09 04:16:41,739 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2025-01-09 04:16:41,739 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2025-01-09 04:16:41,746 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-01-09 04:16:41,747 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 04:16:41,747 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 04:16:41,748 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:16:41,860 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 04:16:41,862 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 04:16:41,862 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 04:16:41,863 INFO L158 Benchmark]: Toolchain (without parser) took 56105.00ms. Allocated memory was 142.6MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 103.6MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 469.8MB. Max. memory is 16.1GB. [2025-01-09 04:16:41,863 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:16:41,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.11ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 90.3MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:16:41,864 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.67ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 89.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:16:41,864 INFO L158 Benchmark]: Boogie Preprocessor took 58.41ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 87.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:16:41,865 INFO L158 Benchmark]: RCFGBuilder took 377.12ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 69.2MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:16:41,866 INFO L158 Benchmark]: TraceAbstraction took 55183.11ms. Allocated memory was 142.6MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 68.5MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2025-01-09 04:16:41,866 INFO L158 Benchmark]: Witness Printer took 136.24ms. Allocated memory is still 2.7GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:16:41,867 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.25ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.11ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 90.3MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.67ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 89.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.41ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 87.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 377.12ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 69.2MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 55183.11ms. Allocated memory was 142.6MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 68.5MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 136.24ms. Allocated memory is still 2.7GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 20]: 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 9 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.3s, OverallIterations: 20, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5258 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5188 mSDsluCounter, 8997 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6210 mSDsCounter, 1024 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4030 IncrementalHoareTripleChecker+Invalid, 5054 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1024 mSolverCounterUnsat, 2787 mSDtfsCounter, 4030 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1447 GetRequests, 1298 SyntacticMatches, 5 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14371occurred in iteration=13, InterpolantAutomatonStates: 159, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 5036 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2668 NumberOfCodeBlocks, 2668 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3098 ConstructedInterpolants, 0 QuantifiedInterpolants, 5173 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2434 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 28 InterpolantComputations, 17 PerfectInterpolantSequences, 1614/1675 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 1 specifications checked. All of them hold - InvariantResult [Line: 180]: Location Invariant Derived location invariant: ((((((((((((((q_req_up == 1) && (p_dw_st != 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (p_dw_pc != 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) || (((((((((((q_req_up == 1) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (p_num_write == 1))) || (((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_req_up <= 0)) && (p_dw_pc != 1)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((((q_req_up == 1) && (p_dw_st != 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) - InvariantResult [Line: 419]: Loop Invariant Derived loop invariant: ((((((((((((((((((((p_dw_st != 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (p_dw_pc != 1)) && (p_dw_i == 1)) && (p_num_write == 1)) || ((((((((((p_num_write == 0) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (p_dw_pc != 1)) && (c_last_read == p_last_write))) || (((((((((((p_dw_st != 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_write_ev != 0)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc != p_dw_pc)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (p_num_write == 1))) || ((((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (q_req_up <= 0)) && (p_dw_pc != 1)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || ((((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (q_write_ev != 0)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (p_dw_pc != 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((p_dw_st != 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_write_ev != 0)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (p_dw_pc != 1)) && (p_dw_i == 1)) && (p_num_write == 1))) || ((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((q_req_up == 1) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc != p_dw_pc)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (p_num_write == 1)) || ((((((((((((q_req_up == 1) && (p_dw_st != 0)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || ((((((((((p_dw_st != 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (p_dw_pc != 1)) && (p_dw_i == 1)) && (p_num_write == 1))) || ((((((((((p_num_write == 0) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (p_dw_pc != 1)) && (c_last_read == p_last_write))) || (((((((((((p_dw_st != 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_write_ev != 0)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc != p_dw_pc)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (p_num_write == 1))) || ((((((((((((q_req_up == 1) && (p_dw_st != 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (p_dw_pc != 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (q_req_up <= 0)) && (p_dw_pc != 1)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || ((((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (q_write_ev != 0)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (p_dw_pc != 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((p_dw_st != 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_write_ev != 0)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (p_dw_pc != 1)) && (p_dw_i == 1)) && (p_num_write == 1))) || ((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) - InvariantResult [Line: 139]: Location Invariant Derived location invariant: ((((((((((((((((q_req_up == 1) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == p_dw_pc)) && (p_dw_pc != 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (p_num_write == 1)) || ((((((((((((p_num_write == 0) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((((p_num_write == 0) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (q_req_up <= 0)) && (p_dw_pc != 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((((q_req_up == 1) && (p_dw_st != 0)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((((p_num_write == 0) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (p_dw_pc != 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) RESULT: Ultimate proved your program to be correct! [2025-01-09 04:16:41,893 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