./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.UNBOUNDED.pals.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/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.UNBOUNDED.pals.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 5d72e5e7abaa750c1c0009f2e3addca35915e1b949637f5a49ed633aadc3fe53 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:18:57,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:18:57,889 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:18:57,893 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:18:57,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:18:57,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:18:57,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:18:57,909 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:18:57,909 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:18:57,909 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:18:57,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:18:57,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:18:57,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:18:57,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:18:57,910 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:18:57,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:18:57,910 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:18:57,910 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:18:57,910 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:18:57,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:18:57,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:18:57,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:18:57,910 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:18:57,910 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:18:57,910 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:18:57,910 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:18:57,910 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:18:57,910 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:18:57,911 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:18:57,911 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:18:57,911 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:18:57,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:18:57,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:18:57,911 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:18:57,911 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:18:57,911 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:18:57,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:18:57,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:18:57,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:18:57,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:18:57,911 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:18:57,911 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:18:57,911 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:18:57,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:18:57,911 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:18:57,911 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:18:57,911 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:18:57,911 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:18:57,911 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 -> 5d72e5e7abaa750c1c0009f2e3addca35915e1b949637f5a49ed633aadc3fe53 [2025-01-09 04:18:58,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:18:58,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:18:58,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:18:58,159 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:18:58,159 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:18:58,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.UNBOUNDED.pals.c [2025-01-09 04:18:59,349 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e1136c54/c9d2e7139df84d8e8278db6d7a92f82f/FLAG271987af9 [2025-01-09 04:18:59,636 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:18:59,643 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.UNBOUNDED.pals.c [2025-01-09 04:18:59,657 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e1136c54/c9d2e7139df84d8e8278db6d7a92f82f/FLAG271987af9 [2025-01-09 04:18:59,915 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e1136c54/c9d2e7139df84d8e8278db6d7a92f82f [2025-01-09 04:18:59,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:18:59,923 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:18:59,923 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:18:59,924 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:18:59,931 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:18:59,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:18:59" (1/1) ... [2025-01-09 04:18:59,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f794e16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:59, skipping insertion in model container [2025-01-09 04:18:59,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:18:59" (1/1) ... [2025-01-09 04:18:59,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:19:00,187 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/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.UNBOUNDED.pals.c[14680,14693] [2025-01-09 04:19:00,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:19:00,201 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:19:00,245 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/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.UNBOUNDED.pals.c[14680,14693] [2025-01-09 04:19:00,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:19:00,257 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:19:00,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:00 WrapperNode [2025-01-09 04:19:00,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:19:00,258 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:19:00,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:19:00,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:19:00,266 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:19:00" (1/1) ... [2025-01-09 04:19:00,281 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:19:00" (1/1) ... [2025-01-09 04:19:00,316 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 504 [2025-01-09 04:19:00,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:19:00,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:19:00,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:19:00,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:19:00,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:00" (1/1) ... [2025-01-09 04:19:00,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:00" (1/1) ... [2025-01-09 04:19:00,333 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:00" (1/1) ... [2025-01-09 04:19:00,351 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:19:00,352 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:00" (1/1) ... [2025-01-09 04:19:00,352 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:00" (1/1) ... [2025-01-09 04:19:00,363 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:00" (1/1) ... [2025-01-09 04:19:00,373 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:00" (1/1) ... [2025-01-09 04:19:00,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:00" (1/1) ... [2025-01-09 04:19:00,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:00" (1/1) ... [2025-01-09 04:19:00,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:00" (1/1) ... [2025-01-09 04:19:00,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:19:00,393 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:19:00,394 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:19:00,394 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:19:00,394 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:00" (1/1) ... [2025-01-09 04:19:00,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:19:00,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:00,423 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:19:00,427 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:19:00,451 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2025-01-09 04:19:00,451 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2025-01-09 04:19:00,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:19:00,451 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2025-01-09 04:19:00,451 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2025-01-09 04:19:00,451 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-01-09 04:19:00,451 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-01-09 04:19:00,451 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2025-01-09 04:19:00,451 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2025-01-09 04:19:00,451 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 04:19:00,451 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 04:19:00,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:19:00,451 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2025-01-09 04:19:00,451 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2025-01-09 04:19:00,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:19:00,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:19:00,452 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2025-01-09 04:19:00,452 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2025-01-09 04:19:00,541 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:19:00,544 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:19:01,057 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2025-01-09 04:19:01,057 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:19:01,071 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:19:01,072 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 04:19:01,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:19:01 BoogieIcfgContainer [2025-01-09 04:19:01,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:19:01,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:19:01,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:19:01,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:19:01,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:18:59" (1/3) ... [2025-01-09 04:19:01,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbdad28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:19:01, skipping insertion in model container [2025-01-09 04:19:01,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:00" (2/3) ... [2025-01-09 04:19:01,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbdad28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:19:01, skipping insertion in model container [2025-01-09 04:19:01,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:19:01" (3/3) ... [2025-01-09 04:19:01,082 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.ufo.UNBOUNDED.pals.c [2025-01-09 04:19:01,092 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:19:01,093 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_STARTPALS_ActiveStandby.ufo.UNBOUNDED.pals.c that has 8 procedures, 179 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 04:19:01,158 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:19:01,170 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;@22e18c07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:19:01,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:19:01,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 139 states have (on average 1.5539568345323742) internal successors, (216), 141 states have internal predecessors, (216), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 04:19:01,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 04:19:01,179 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:01,179 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] [2025-01-09 04:19:01,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:01,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:01,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1097719498, now seen corresponding path program 1 times [2025-01-09 04:19:01,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:01,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292144362] [2025-01-09 04:19:01,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:01,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:01,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 04:19:01,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 04:19:01,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:01,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:01,410 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:19:01,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:01,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292144362] [2025-01-09 04:19:01,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292144362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:01,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:01,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:19:01,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259128218] [2025-01-09 04:19:01,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:01,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 04:19:01,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:01,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 04:19:01,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:19:01,436 INFO L87 Difference]: Start difference. First operand has 179 states, 139 states have (on average 1.5539568345323742) internal successors, (216), 141 states have internal predecessors, (216), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:19:01,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:01,466 INFO L93 Difference]: Finished difference Result 339 states and 554 transitions. [2025-01-09 04:19:01,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 04:19:01,467 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-01-09 04:19:01,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:01,473 INFO L225 Difference]: With dead ends: 339 [2025-01-09 04:19:01,473 INFO L226 Difference]: Without dead ends: 176 [2025-01-09 04:19:01,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:19:01,478 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:01,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:01,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-01-09 04:19:01,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-01-09 04:19:01,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 137 states have (on average 1.5401459854014599) internal successors, (211), 138 states have internal predecessors, (211), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 04:19:01,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 273 transitions. [2025-01-09 04:19:01,518 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 273 transitions. Word has length 28 [2025-01-09 04:19:01,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:01,519 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 273 transitions. [2025-01-09 04:19:01,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:19:01,519 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 273 transitions. [2025-01-09 04:19:01,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 04:19:01,520 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:01,520 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] [2025-01-09 04:19:01,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:19:01,520 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:01,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:01,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1316574216, now seen corresponding path program 1 times [2025-01-09 04:19:01,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:01,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288862869] [2025-01-09 04:19:01,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:01,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:01,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 04:19:01,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 04:19:01,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:01,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:01,757 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:19:01,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:01,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288862869] [2025-01-09 04:19:01,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288862869] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:01,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:01,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:19:01,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846273997] [2025-01-09 04:19:01,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:01,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:19:01,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:01,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:19:01,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:01,760 INFO L87 Difference]: Start difference. First operand 176 states and 273 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:19:01,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:01,844 INFO L93 Difference]: Finished difference Result 338 states and 520 transitions. [2025-01-09 04:19:01,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:19:01,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-01-09 04:19:01,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:01,850 INFO L225 Difference]: With dead ends: 338 [2025-01-09 04:19:01,850 INFO L226 Difference]: Without dead ends: 176 [2025-01-09 04:19:01,851 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:19:01,855 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:01,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1323 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:19:01,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-01-09 04:19:01,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-01-09 04:19:01,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 137 states have (on average 1.4525547445255473) internal successors, (199), 138 states have internal predecessors, (199), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 04:19:01,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 261 transitions. [2025-01-09 04:19:01,873 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 261 transitions. Word has length 28 [2025-01-09 04:19:01,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:01,873 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 261 transitions. [2025-01-09 04:19:01,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:19:01,873 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 261 transitions. [2025-01-09 04:19:01,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 04:19:01,874 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:01,874 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:01,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:19:01,874 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:01,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:01,875 INFO L85 PathProgramCache]: Analyzing trace with hash 753527981, now seen corresponding path program 1 times [2025-01-09 04:19:01,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:01,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927187444] [2025-01-09 04:19:01,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:01,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:01,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 04:19:01,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 04:19:01,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:01,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:02,145 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:19:02,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:02,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927187444] [2025-01-09 04:19:02,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927187444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:02,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:02,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:02,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817186856] [2025-01-09 04:19:02,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:02,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:02,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:02,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:02,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:02,148 INFO L87 Difference]: Start difference. First operand 176 states and 261 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:19:02,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:02,202 INFO L93 Difference]: Finished difference Result 339 states and 512 transitions. [2025-01-09 04:19:02,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:02,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2025-01-09 04:19:02,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:02,206 INFO L225 Difference]: With dead ends: 339 [2025-01-09 04:19:02,206 INFO L226 Difference]: Without dead ends: 180 [2025-01-09 04:19:02,209 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:19:02,210 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 3 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:02,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 755 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:02,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-01-09 04:19:02,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-01-09 04:19:02,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 140 states have (on average 1.4428571428571428) internal successors, (202), 141 states have internal predecessors, (202), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 04:19:02,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 264 transitions. [2025-01-09 04:19:02,226 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 264 transitions. Word has length 39 [2025-01-09 04:19:02,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:02,226 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 264 transitions. [2025-01-09 04:19:02,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:19:02,226 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 264 transitions. [2025-01-09 04:19:02,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 04:19:02,227 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:02,229 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:19:02,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:19:02,229 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:02,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:02,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2030763167, now seen corresponding path program 1 times [2025-01-09 04:19:02,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:02,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899919315] [2025-01-09 04:19:02,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:02,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:02,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 04:19:02,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 04:19:02,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:02,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:02,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:19:02,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:02,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899919315] [2025-01-09 04:19:02,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899919315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:02,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:02,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:19:02,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037486312] [2025-01-09 04:19:02,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:02,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:19:02,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:02,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:19:02,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:19:02,349 INFO L87 Difference]: Start difference. First operand 180 states and 264 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:19:02,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:02,389 INFO L93 Difference]: Finished difference Result 494 states and 735 transitions. [2025-01-09 04:19:02,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:19:02,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 55 [2025-01-09 04:19:02,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:02,391 INFO L225 Difference]: With dead ends: 494 [2025-01-09 04:19:02,391 INFO L226 Difference]: Without dead ends: 331 [2025-01-09 04:19:02,392 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:19:02,394 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 212 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:02,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 523 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:02,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-01-09 04:19:02,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 326. [2025-01-09 04:19:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 249 states have (on average 1.461847389558233) internal successors, (364), 251 states have internal predecessors, (364), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 04:19:02,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 484 transitions. [2025-01-09 04:19:02,417 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 484 transitions. Word has length 55 [2025-01-09 04:19:02,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:02,418 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 484 transitions. [2025-01-09 04:19:02,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:19:02,418 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 484 transitions. [2025-01-09 04:19:02,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 04:19:02,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:02,420 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:19:02,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:19:02,420 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:02,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:02,420 INFO L85 PathProgramCache]: Analyzing trace with hash -2065531622, now seen corresponding path program 1 times [2025-01-09 04:19:02,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:02,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562190602] [2025-01-09 04:19:02,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:02,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:02,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 04:19:02,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 04:19:02,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:02,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:19:02,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:02,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562190602] [2025-01-09 04:19:02,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562190602] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:02,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:02,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:19:02,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374362298] [2025-01-09 04:19:02,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:02,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:19:02,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:02,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:19:02,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:19:02,522 INFO L87 Difference]: Start difference. First operand 326 states and 484 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:19:02,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:02,578 INFO L93 Difference]: Finished difference Result 917 states and 1373 transitions. [2025-01-09 04:19:02,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:19:02,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2025-01-09 04:19:02,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:02,585 INFO L225 Difference]: With dead ends: 917 [2025-01-09 04:19:02,585 INFO L226 Difference]: Without dead ends: 608 [2025-01-09 04:19:02,587 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:19:02,587 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 214 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:02,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 545 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:02,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-01-09 04:19:02,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 602. [2025-01-09 04:19:02,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 453 states have (on average 1.4724061810154525) internal successors, (667), 457 states have internal predecessors, (667), 117 states have call successors, (117), 31 states have call predecessors, (117), 31 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2025-01-09 04:19:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 901 transitions. [2025-01-09 04:19:02,632 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 901 transitions. Word has length 56 [2025-01-09 04:19:02,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:02,633 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 901 transitions. [2025-01-09 04:19:02,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:19:02,633 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 901 transitions. [2025-01-09 04:19:02,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 04:19:02,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:02,637 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:19:02,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:19:02,638 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:02,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:02,638 INFO L85 PathProgramCache]: Analyzing trace with hash 949571996, now seen corresponding path program 1 times [2025-01-09 04:19:02,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:02,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438896924] [2025-01-09 04:19:02,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:02,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:02,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 04:19:02,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 04:19:02,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:02,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:02,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:19:02,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:02,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438896924] [2025-01-09 04:19:02,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438896924] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:02,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:02,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:19:02,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813566716] [2025-01-09 04:19:02,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:02,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:19:02,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:02,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:19:02,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:02,805 INFO L87 Difference]: Start difference. First operand 602 states and 901 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:19:03,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:03,032 INFO L93 Difference]: Finished difference Result 1291 states and 1928 transitions. [2025-01-09 04:19:03,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:03,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2025-01-09 04:19:03,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:03,040 INFO L225 Difference]: With dead ends: 1291 [2025-01-09 04:19:03,040 INFO L226 Difference]: Without dead ends: 706 [2025-01-09 04:19:03,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:19:03,044 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 368 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:03,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 669 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:19:03,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2025-01-09 04:19:03,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 690. [2025-01-09 04:19:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 528 states have (on average 1.456439393939394) internal successors, (769), 531 states have internal predecessors, (769), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 04:19:03,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1017 transitions. [2025-01-09 04:19:03,103 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1017 transitions. Word has length 56 [2025-01-09 04:19:03,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:03,104 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 1017 transitions. [2025-01-09 04:19:03,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:19:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1017 transitions. [2025-01-09 04:19:03,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 04:19:03,105 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:03,106 INFO L218 NwaCegarLoop]: trace histogram [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:19:03,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:19:03,106 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:03,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:03,107 INFO L85 PathProgramCache]: Analyzing trace with hash 858717278, now seen corresponding path program 1 times [2025-01-09 04:19:03,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:03,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407329644] [2025-01-09 04:19:03,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:03,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:03,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 04:19:03,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 04:19:03,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:03,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:03,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:19:03,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:03,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407329644] [2025-01-09 04:19:03,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407329644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:03,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:03,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:19:03,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049019671] [2025-01-09 04:19:03,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:03,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:19:03,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:03,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:19:03,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:03,259 INFO L87 Difference]: Start difference. First operand 690 states and 1017 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:19:03,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:03,454 INFO L93 Difference]: Finished difference Result 1295 states and 1928 transitions. [2025-01-09 04:19:03,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:03,456 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 57 [2025-01-09 04:19:03,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:03,462 INFO L225 Difference]: With dead ends: 1295 [2025-01-09 04:19:03,463 INFO L226 Difference]: Without dead ends: 710 [2025-01-09 04:19:03,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:19:03,466 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 368 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:03,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 669 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:19:03,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2025-01-09 04:19:03,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 698. [2025-01-09 04:19:03,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 536 states have (on average 1.4496268656716418) internal successors, (777), 539 states have internal predecessors, (777), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 04:19:03,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1025 transitions. [2025-01-09 04:19:03,528 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1025 transitions. Word has length 57 [2025-01-09 04:19:03,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:03,529 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1025 transitions. [2025-01-09 04:19:03,529 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:19:03,529 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1025 transitions. [2025-01-09 04:19:03,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 04:19:03,530 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:03,530 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:03,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:19:03,530 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:03,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:03,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1619339248, now seen corresponding path program 1 times [2025-01-09 04:19:03,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:03,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76144345] [2025-01-09 04:19:03,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:03,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:03,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 04:19:03,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 04:19:03,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:03,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:03,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:19:03,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:03,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76144345] [2025-01-09 04:19:03,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76144345] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:03,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:03,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:03,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107782558] [2025-01-09 04:19:03,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:03,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:03,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:03,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:03,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:03,658 INFO L87 Difference]: Start difference. First operand 698 states and 1025 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:19:03,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:03,808 INFO L93 Difference]: Finished difference Result 1283 states and 1908 transitions. [2025-01-09 04:19:03,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:03,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 59 [2025-01-09 04:19:03,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:03,813 INFO L225 Difference]: With dead ends: 1283 [2025-01-09 04:19:03,813 INFO L226 Difference]: Without dead ends: 698 [2025-01-09 04:19:03,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:19:03,816 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 61 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:03,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 663 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:19:03,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-01-09 04:19:03,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2025-01-09 04:19:03,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 536 states have (on average 1.4421641791044777) internal successors, (773), 539 states have internal predecessors, (773), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 04:19:03,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1021 transitions. [2025-01-09 04:19:03,858 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1021 transitions. Word has length 59 [2025-01-09 04:19:03,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:03,858 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1021 transitions. [2025-01-09 04:19:03,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:19:03,858 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1021 transitions. [2025-01-09 04:19:03,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 04:19:03,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:03,859 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:19:03,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:19:03,860 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:03,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:03,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1923925418, now seen corresponding path program 1 times [2025-01-09 04:19:03,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:03,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556987629] [2025-01-09 04:19:03,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:03,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:03,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 04:19:03,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 04:19:03,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:03,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:19:04,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:04,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556987629] [2025-01-09 04:19:04,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556987629] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:04,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:04,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:04,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296920487] [2025-01-09 04:19:04,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:04,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:04,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:04,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:04,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:04,019 INFO L87 Difference]: Start difference. First operand 698 states and 1021 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 04:19:04,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:04,077 INFO L93 Difference]: Finished difference Result 1303 states and 1932 transitions. [2025-01-09 04:19:04,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:04,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2025-01-09 04:19:04,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:04,085 INFO L225 Difference]: With dead ends: 1303 [2025-01-09 04:19:04,085 INFO L226 Difference]: Without dead ends: 718 [2025-01-09 04:19:04,087 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:19:04,087 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 4 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:04,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 767 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:04,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2025-01-09 04:19:04,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2025-01-09 04:19:04,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 552 states have (on average 1.4293478260869565) internal successors, (789), 555 states have internal predecessors, (789), 124 states have call successors, (124), 41 states have call predecessors, (124), 41 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 04:19:04,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1037 transitions. [2025-01-09 04:19:04,130 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1037 transitions. Word has length 60 [2025-01-09 04:19:04,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:04,131 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1037 transitions. [2025-01-09 04:19:04,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 04:19:04,131 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1037 transitions. [2025-01-09 04:19:04,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:19:04,132 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:04,132 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:19:04,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:19:04,132 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:04,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:04,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2052820272, now seen corresponding path program 1 times [2025-01-09 04:19:04,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:04,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705277192] [2025-01-09 04:19:04,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:04,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:04,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:19:04,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:19:04,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:04,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:04,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:19:04,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:04,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705277192] [2025-01-09 04:19:04,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705277192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:04,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:04,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:04,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846787893] [2025-01-09 04:19:04,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:04,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:04,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:04,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:04,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:04,306 INFO L87 Difference]: Start difference. First operand 718 states and 1037 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 04:19:04,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:04,367 INFO L93 Difference]: Finished difference Result 1343 states and 1976 transitions. [2025-01-09 04:19:04,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:04,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 68 [2025-01-09 04:19:04,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:04,372 INFO L225 Difference]: With dead ends: 1343 [2025-01-09 04:19:04,373 INFO L226 Difference]: Without dead ends: 738 [2025-01-09 04:19:04,374 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:19:04,375 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 4 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:04,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 753 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:04,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-01-09 04:19:04,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2025-01-09 04:19:04,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 568 states have (on average 1.4172535211267605) internal successors, (805), 571 states have internal predecessors, (805), 124 states have call successors, (124), 45 states have call predecessors, (124), 45 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 04:19:04,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1053 transitions. [2025-01-09 04:19:04,414 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1053 transitions. Word has length 68 [2025-01-09 04:19:04,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:04,414 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 1053 transitions. [2025-01-09 04:19:04,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 04:19:04,415 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1053 transitions. [2025-01-09 04:19:04,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 04:19:04,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:04,417 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:19:04,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:19:04,417 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:04,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:04,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1177296742, now seen corresponding path program 1 times [2025-01-09 04:19:04,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:04,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120270114] [2025-01-09 04:19:04,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:04,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:04,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 04:19:04,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 04:19:04,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:04,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:04,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:19:04,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:04,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120270114] [2025-01-09 04:19:04,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120270114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:04,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:04,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:04,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598185457] [2025-01-09 04:19:04,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:04,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:04,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:04,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:04,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:04,543 INFO L87 Difference]: Start difference. First operand 738 states and 1053 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 04:19:04,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:04,601 INFO L93 Difference]: Finished difference Result 1379 states and 1992 transitions. [2025-01-09 04:19:04,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:04,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 76 [2025-01-09 04:19:04,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:04,606 INFO L225 Difference]: With dead ends: 1379 [2025-01-09 04:19:04,607 INFO L226 Difference]: Without dead ends: 754 [2025-01-09 04:19:04,608 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:19:04,609 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 3 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:04,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 763 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:04,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-01-09 04:19:04,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2025-01-09 04:19:04,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 580 states have (on average 1.4086206896551725) internal successors, (817), 583 states have internal predecessors, (817), 124 states have call successors, (124), 49 states have call predecessors, (124), 49 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 04:19:04,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1065 transitions. [2025-01-09 04:19:04,648 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1065 transitions. Word has length 76 [2025-01-09 04:19:04,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:04,648 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1065 transitions. [2025-01-09 04:19:04,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 04:19:04,649 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1065 transitions. [2025-01-09 04:19:04,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 04:19:04,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:04,652 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:19:04,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:19:04,652 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:04,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:04,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1219162561, now seen corresponding path program 1 times [2025-01-09 04:19:04,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:04,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339805491] [2025-01-09 04:19:04,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:04,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:04,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 04:19:04,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 04:19:04,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:04,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:04,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:19:04,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:04,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339805491] [2025-01-09 04:19:04,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339805491] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:04,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:04,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:04,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469532325] [2025-01-09 04:19:04,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:04,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:04,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:04,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:04,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:04,808 INFO L87 Difference]: Start difference. First operand 754 states and 1065 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 04:19:04,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:04,881 INFO L93 Difference]: Finished difference Result 1415 states and 2032 transitions. [2025-01-09 04:19:04,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:04,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 76 [2025-01-09 04:19:04,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:04,887 INFO L225 Difference]: With dead ends: 1415 [2025-01-09 04:19:04,888 INFO L226 Difference]: Without dead ends: 774 [2025-01-09 04:19:04,890 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:19:04,891 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 4 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:04,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 753 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:04,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2025-01-09 04:19:04,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 774. [2025-01-09 04:19:04,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 596 states have (on average 1.3976510067114094) internal successors, (833), 599 states have internal predecessors, (833), 124 states have call successors, (124), 53 states have call predecessors, (124), 53 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 04:19:04,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1081 transitions. [2025-01-09 04:19:04,930 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1081 transitions. Word has length 76 [2025-01-09 04:19:04,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:04,930 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1081 transitions. [2025-01-09 04:19:04,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 04:19:04,930 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1081 transitions. [2025-01-09 04:19:04,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 04:19:04,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:04,932 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:19:04,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:19:04,932 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:04,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:04,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1073283999, now seen corresponding path program 1 times [2025-01-09 04:19:04,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:04,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071205074] [2025-01-09 04:19:04,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:04,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:04,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 04:19:04,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 04:19:04,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:04,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:05,089 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:19:05,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:05,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071205074] [2025-01-09 04:19:05,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071205074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:05,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:05,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:05,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515587782] [2025-01-09 04:19:05,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:05,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:05,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:05,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:05,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:05,091 INFO L87 Difference]: Start difference. First operand 774 states and 1081 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 04:19:05,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:05,159 INFO L93 Difference]: Finished difference Result 1459 states and 2060 transitions. [2025-01-09 04:19:05,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:05,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 84 [2025-01-09 04:19:05,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:05,164 INFO L225 Difference]: With dead ends: 1459 [2025-01-09 04:19:05,164 INFO L226 Difference]: Without dead ends: 798 [2025-01-09 04:19:05,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:19:05,167 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 5 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:05,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 765 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:05,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-01-09 04:19:05,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 798. [2025-01-09 04:19:05,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 616 states have (on average 1.3847402597402598) internal successors, (853), 619 states have internal predecessors, (853), 124 states have call successors, (124), 57 states have call predecessors, (124), 57 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 04:19:05,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1101 transitions. [2025-01-09 04:19:05,206 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1101 transitions. Word has length 84 [2025-01-09 04:19:05,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:05,207 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1101 transitions. [2025-01-09 04:19:05,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 04:19:05,207 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1101 transitions. [2025-01-09 04:19:05,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 04:19:05,210 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:05,210 INFO L218 NwaCegarLoop]: trace histogram [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:19:05,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:19:05,210 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:05,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:05,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1428808975, now seen corresponding path program 1 times [2025-01-09 04:19:05,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:05,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6878427] [2025-01-09 04:19:05,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:05,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:05,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 04:19:05,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 04:19:05,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:05,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:05,771 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:19:05,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:05,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6878427] [2025-01-09 04:19:05,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6878427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:05,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:05,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:19:05,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082451493] [2025-01-09 04:19:05,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:05,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:19:05,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:05,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:19:05,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:19:05,772 INFO L87 Difference]: Start difference. First operand 798 states and 1101 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 04:19:06,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:06,060 INFO L93 Difference]: Finished difference Result 2053 states and 2823 transitions. [2025-01-09 04:19:06,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:19:06,061 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 87 [2025-01-09 04:19:06,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:06,069 INFO L225 Difference]: With dead ends: 2053 [2025-01-09 04:19:06,069 INFO L226 Difference]: Without dead ends: 1368 [2025-01-09 04:19:06,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:19:06,073 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 209 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:06,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1443 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:19:06,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2025-01-09 04:19:06,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1082. [2025-01-09 04:19:06,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 827 states have (on average 1.3724304715840387) internal successors, (1135), 832 states have internal predecessors, (1135), 172 states have call successors, (172), 82 states have call predecessors, (172), 82 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2025-01-09 04:19:06,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1479 transitions. [2025-01-09 04:19:06,156 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1479 transitions. Word has length 87 [2025-01-09 04:19:06,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:06,156 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1479 transitions. [2025-01-09 04:19:06,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 04:19:06,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1479 transitions. [2025-01-09 04:19:06,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 04:19:06,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:06,158 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:19:06,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:19:06,158 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:06,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:06,158 INFO L85 PathProgramCache]: Analyzing trace with hash 256918892, now seen corresponding path program 1 times [2025-01-09 04:19:06,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:06,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126312233] [2025-01-09 04:19:06,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:06,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:06,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 04:19:06,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 04:19:06,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:06,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:06,296 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:19:06,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:06,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126312233] [2025-01-09 04:19:06,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126312233] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:06,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:06,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:06,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560080828] [2025-01-09 04:19:06,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:06,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:06,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:06,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:06,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:06,297 INFO L87 Difference]: Start difference. First operand 1082 states and 1479 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 04:19:06,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:06,362 INFO L93 Difference]: Finished difference Result 2007 states and 2768 transitions. [2025-01-09 04:19:06,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:06,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 91 [2025-01-09 04:19:06,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:06,369 INFO L225 Difference]: With dead ends: 2007 [2025-01-09 04:19:06,369 INFO L226 Difference]: Without dead ends: 1106 [2025-01-09 04:19:06,371 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:19:06,372 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 3 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:06,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 763 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:06,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2025-01-09 04:19:06,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1106. [2025-01-09 04:19:06,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 845 states have (on average 1.3644970414201183) internal successors, (1153), 850 states have internal predecessors, (1153), 172 states have call successors, (172), 88 states have call predecessors, (172), 88 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2025-01-09 04:19:06,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1497 transitions. [2025-01-09 04:19:06,430 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1497 transitions. Word has length 91 [2025-01-09 04:19:06,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:06,431 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1497 transitions. [2025-01-09 04:19:06,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 04:19:06,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1497 transitions. [2025-01-09 04:19:06,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 04:19:06,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:06,432 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:19:06,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:19:06,433 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:06,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:06,433 INFO L85 PathProgramCache]: Analyzing trace with hash -263166726, now seen corresponding path program 1 times [2025-01-09 04:19:06,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:06,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189784613] [2025-01-09 04:19:06,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:06,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:06,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 04:19:06,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 04:19:06,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:06,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:06,703 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 04:19:06,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:06,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189784613] [2025-01-09 04:19:06,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189784613] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:06,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756849830] [2025-01-09 04:19:06,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:06,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:06,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:06,707 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:19:06,709 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:19:06,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 04:19:06,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 04:19:06,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:06,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:06,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 04:19:06,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:06,967 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 04:19:06,967 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:06,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756849830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:06,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:06,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2025-01-09 04:19:06,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933440709] [2025-01-09 04:19:06,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:06,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:19:06,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:06,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:19:06,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:19:06,968 INFO L87 Difference]: Start difference. First operand 1106 states and 1497 transitions. Second operand has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 04:19:07,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:07,150 INFO L93 Difference]: Finished difference Result 2371 states and 3335 transitions. [2025-01-09 04:19:07,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 04:19:07,150 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2025-01-09 04:19:07,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:07,158 INFO L225 Difference]: With dead ends: 2371 [2025-01-09 04:19:07,158 INFO L226 Difference]: Without dead ends: 1534 [2025-01-09 04:19:07,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:19:07,161 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 139 mSDsluCounter, 2428 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 2866 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:07,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 2866 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:19:07,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2025-01-09 04:19:07,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1114. [2025-01-09 04:19:07,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 849 states have (on average 1.3557126030624265) internal successors, (1151), 856 states have internal predecessors, (1151), 174 states have call successors, (174), 90 states have call predecessors, (174), 90 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2025-01-09 04:19:07,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1499 transitions. [2025-01-09 04:19:07,238 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1499 transitions. Word has length 90 [2025-01-09 04:19:07,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:07,238 INFO L471 AbstractCegarLoop]: Abstraction has 1114 states and 1499 transitions. [2025-01-09 04:19:07,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 04:19:07,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1499 transitions. [2025-01-09 04:19:07,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:19:07,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:07,239 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:19:07,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 04:19:07,444 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,SelfDestructingSolverStorable15 [2025-01-09 04:19:07,445 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:07,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:07,445 INFO L85 PathProgramCache]: Analyzing trace with hash 64633758, now seen corresponding path program 1 times [2025-01-09 04:19:07,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:07,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966305117] [2025-01-09 04:19:07,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:07,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:07,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:19:07,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:19:07,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:07,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:07,570 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 04:19:07,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:07,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966305117] [2025-01-09 04:19:07,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966305117] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:07,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:07,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:19:07,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695956305] [2025-01-09 04:19:07,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:07,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:19:07,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:07,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:19:07,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:19:07,571 INFO L87 Difference]: Start difference. First operand 1114 states and 1499 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 04:19:07,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:07,750 INFO L93 Difference]: Finished difference Result 2010 states and 2716 transitions. [2025-01-09 04:19:07,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:19:07,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 93 [2025-01-09 04:19:07,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:07,757 INFO L225 Difference]: With dead ends: 2010 [2025-01-09 04:19:07,757 INFO L226 Difference]: Without dead ends: 1159 [2025-01-09 04:19:07,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:19:07,760 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 255 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:07,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1485 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:19:07,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-01-09 04:19:07,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1117. [2025-01-09 04:19:07,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 863 states have (on average 1.3487833140208574) internal successors, (1164), 875 states have internal predecessors, (1164), 162 states have call successors, (162), 91 states have call predecessors, (162), 91 states have return successors, (162), 150 states have call predecessors, (162), 162 states have call successors, (162) [2025-01-09 04:19:07,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1488 transitions. [2025-01-09 04:19:07,822 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1488 transitions. Word has length 93 [2025-01-09 04:19:07,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:07,824 INFO L471 AbstractCegarLoop]: Abstraction has 1117 states and 1488 transitions. [2025-01-09 04:19:07,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 04:19:07,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1488 transitions. [2025-01-09 04:19:07,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:19:07,825 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:07,826 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:07,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:19:07,826 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:07,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:07,826 INFO L85 PathProgramCache]: Analyzing trace with hash -945309641, now seen corresponding path program 1 times [2025-01-09 04:19:07,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:07,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105817552] [2025-01-09 04:19:07,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:07,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:07,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:19:07,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:19:07,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:07,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:08,238 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 04:19:08,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:08,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105817552] [2025-01-09 04:19:08,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105817552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:08,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:08,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:19:08,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779923462] [2025-01-09 04:19:08,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:08,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:19:08,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:08,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:19:08,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:19:08,239 INFO L87 Difference]: Start difference. First operand 1117 states and 1488 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:19:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:08,465 INFO L93 Difference]: Finished difference Result 1989 states and 2661 transitions. [2025-01-09 04:19:08,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:19:08,465 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 95 [2025-01-09 04:19:08,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:08,472 INFO L225 Difference]: With dead ends: 1989 [2025-01-09 04:19:08,472 INFO L226 Difference]: Without dead ends: 1115 [2025-01-09 04:19:08,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:19:08,475 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 150 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:08,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1601 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:19:08,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-01-09 04:19:08,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1008. [2025-01-09 04:19:08,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 781 states have (on average 1.3508322663252241) internal successors, (1055), 791 states have internal predecessors, (1055), 145 states have call successors, (145), 81 states have call predecessors, (145), 81 states have return successors, (145), 135 states have call predecessors, (145), 145 states have call successors, (145) [2025-01-09 04:19:08,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1345 transitions. [2025-01-09 04:19:08,528 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1345 transitions. Word has length 95 [2025-01-09 04:19:08,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:08,529 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1345 transitions. [2025-01-09 04:19:08,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:19:08,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1345 transitions. [2025-01-09 04:19:08,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:19:08,530 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:08,530 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:08,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:19:08,530 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:08,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:08,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1864254117, now seen corresponding path program 1 times [2025-01-09 04:19:08,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:08,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354838278] [2025-01-09 04:19:08,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:08,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:08,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:19:08,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:19:08,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:08,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:08,957 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 04:19:08,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:08,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354838278] [2025-01-09 04:19:08,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354838278] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:08,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:08,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:19:08,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867603876] [2025-01-09 04:19:08,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:08,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:19:08,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:08,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:19:08,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:19:08,959 INFO L87 Difference]: Start difference. First operand 1008 states and 1345 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:19:09,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:09,306 INFO L93 Difference]: Finished difference Result 1934 states and 2578 transitions. [2025-01-09 04:19:09,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:19:09,307 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 96 [2025-01-09 04:19:09,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:09,312 INFO L225 Difference]: With dead ends: 1934 [2025-01-09 04:19:09,313 INFO L226 Difference]: Without dead ends: 1099 [2025-01-09 04:19:09,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:19:09,315 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 519 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:09,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1427 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:19:09,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-01-09 04:19:09,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1046. [2025-01-09 04:19:09,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 804 states have (on average 1.3296019900497513) internal successors, (1069), 815 states have internal predecessors, (1069), 154 states have call successors, (154), 87 states have call predecessors, (154), 87 states have return successors, (154), 143 states have call predecessors, (154), 154 states have call successors, (154) [2025-01-09 04:19:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1377 transitions. [2025-01-09 04:19:09,376 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1377 transitions. Word has length 96 [2025-01-09 04:19:09,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:09,377 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1377 transitions. [2025-01-09 04:19:09,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:19:09,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1377 transitions. [2025-01-09 04:19:09,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:19:09,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:09,378 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:09,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:19:09,378 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:09,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:09,379 INFO L85 PathProgramCache]: Analyzing trace with hash -762764108, now seen corresponding path program 1 times [2025-01-09 04:19:09,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:09,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477962618] [2025-01-09 04:19:09,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:09,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:09,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:19:09,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:19:09,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:09,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:09,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 04:19:09,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:09,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477962618] [2025-01-09 04:19:09,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477962618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:09,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:09,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:19:09,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077643977] [2025-01-09 04:19:09,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:09,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:19:09,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:09,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:19:09,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:19:09,793 INFO L87 Difference]: Start difference. First operand 1046 states and 1377 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:19:10,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:10,210 INFO L93 Difference]: Finished difference Result 2019 states and 2644 transitions. [2025-01-09 04:19:10,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:19:10,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 98 [2025-01-09 04:19:10,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:10,217 INFO L225 Difference]: With dead ends: 2019 [2025-01-09 04:19:10,217 INFO L226 Difference]: Without dead ends: 1159 [2025-01-09 04:19:10,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:19:10,221 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 514 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:10,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1242 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:19:10,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-01-09 04:19:10,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1068. [2025-01-09 04:19:10,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 818 states have (on average 1.3141809290953546) internal successors, (1075), 830 states have internal predecessors, (1075), 157 states have call successors, (157), 92 states have call predecessors, (157), 92 states have return successors, (157), 145 states have call predecessors, (157), 157 states have call successors, (157) [2025-01-09 04:19:10,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1389 transitions. [2025-01-09 04:19:10,300 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1389 transitions. Word has length 98 [2025-01-09 04:19:10,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:10,300 INFO L471 AbstractCegarLoop]: Abstraction has 1068 states and 1389 transitions. [2025-01-09 04:19:10,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:19:10,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1389 transitions. [2025-01-09 04:19:10,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:19:10,301 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:10,301 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:10,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:19:10,302 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:10,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:10,302 INFO L85 PathProgramCache]: Analyzing trace with hash -462507774, now seen corresponding path program 1 times [2025-01-09 04:19:10,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:10,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659497859] [2025-01-09 04:19:10,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:10,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:10,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:19:10,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:19:10,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:10,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 04:19:10,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:10,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659497859] [2025-01-09 04:19:10,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659497859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:10,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:10,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:10,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825151667] [2025-01-09 04:19:10,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:10,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:10,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:10,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:10,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:10,375 INFO L87 Difference]: Start difference. First operand 1068 states and 1389 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:19:10,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:10,562 INFO L93 Difference]: Finished difference Result 2778 states and 3641 transitions. [2025-01-09 04:19:10,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:10,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2025-01-09 04:19:10,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:10,571 INFO L225 Difference]: With dead ends: 2778 [2025-01-09 04:19:10,571 INFO L226 Difference]: Without dead ends: 1974 [2025-01-09 04:19:10,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:19:10,574 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 199 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:10,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1151 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:10,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2025-01-09 04:19:10,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1793. [2025-01-09 04:19:10,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1355 states have (on average 1.3151291512915129) internal successors, (1782), 1375 states have internal predecessors, (1782), 280 states have call successors, (280), 157 states have call predecessors, (280), 157 states have return successors, (280), 260 states have call predecessors, (280), 280 states have call successors, (280) [2025-01-09 04:19:10,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2342 transitions. [2025-01-09 04:19:10,693 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2342 transitions. Word has length 99 [2025-01-09 04:19:10,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:10,694 INFO L471 AbstractCegarLoop]: Abstraction has 1793 states and 2342 transitions. [2025-01-09 04:19:10,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:19:10,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2342 transitions. [2025-01-09 04:19:10,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:19:10,695 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:10,695 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:10,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:19:10,696 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:10,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:10,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1385413993, now seen corresponding path program 1 times [2025-01-09 04:19:10,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:10,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017083612] [2025-01-09 04:19:10,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:10,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:10,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:19:10,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:19:10,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:10,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:10,768 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 04:19:10,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:10,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017083612] [2025-01-09 04:19:10,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017083612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:10,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:10,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:10,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548306293] [2025-01-09 04:19:10,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:10,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:10,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:10,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:10,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:10,770 INFO L87 Difference]: Start difference. First operand 1793 states and 2342 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:19:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:11,002 INFO L93 Difference]: Finished difference Result 4547 states and 5974 transitions. [2025-01-09 04:19:11,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:11,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 101 [2025-01-09 04:19:11,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:11,017 INFO L225 Difference]: With dead ends: 4547 [2025-01-09 04:19:11,017 INFO L226 Difference]: Without dead ends: 3091 [2025-01-09 04:19:11,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:19:11,022 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 207 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:11,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1189 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:11,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3091 states. [2025-01-09 04:19:11,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3091 to 2814. [2025-01-09 04:19:11,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2814 states, 2101 states have (on average 1.3055687767729653) internal successors, (2743), 2132 states have internal predecessors, (2743), 460 states have call successors, (460), 252 states have call predecessors, (460), 252 states have return successors, (460), 429 states have call predecessors, (460), 460 states have call successors, (460) [2025-01-09 04:19:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2814 states to 2814 states and 3663 transitions. [2025-01-09 04:19:11,242 INFO L78 Accepts]: Start accepts. Automaton has 2814 states and 3663 transitions. Word has length 101 [2025-01-09 04:19:11,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:11,244 INFO L471 AbstractCegarLoop]: Abstraction has 2814 states and 3663 transitions. [2025-01-09 04:19:11,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:19:11,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 3663 transitions. [2025-01-09 04:19:11,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:19:11,246 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:11,246 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:11,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:19:11,247 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:11,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:11,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1106711591, now seen corresponding path program 1 times [2025-01-09 04:19:11,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:11,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816338615] [2025-01-09 04:19:11,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:11,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:11,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:19:11,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:19:11,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:11,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:11,316 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 04:19:11,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:11,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816338615] [2025-01-09 04:19:11,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816338615] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:11,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:11,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:11,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838277933] [2025-01-09 04:19:11,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:11,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:11,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:11,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:11,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:11,318 INFO L87 Difference]: Start difference. First operand 2814 states and 3663 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:19:11,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:11,650 INFO L93 Difference]: Finished difference Result 6570 states and 8593 transitions. [2025-01-09 04:19:11,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:11,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 101 [2025-01-09 04:19:11,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:11,674 INFO L225 Difference]: With dead ends: 6570 [2025-01-09 04:19:11,675 INFO L226 Difference]: Without dead ends: 4213 [2025-01-09 04:19:11,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:19:11,682 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 200 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:11,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1201 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:11,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4213 states. [2025-01-09 04:19:12,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4213 to 4030. [2025-01-09 04:19:12,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4030 states, 2993 states have (on average 1.301703975943869) internal successors, (3896), 3037 states have internal predecessors, (3896), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2025-01-09 04:19:12,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4030 states to 4030 states and 5240 transitions. [2025-01-09 04:19:12,043 INFO L78 Accepts]: Start accepts. Automaton has 4030 states and 5240 transitions. Word has length 101 [2025-01-09 04:19:12,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:12,043 INFO L471 AbstractCegarLoop]: Abstraction has 4030 states and 5240 transitions. [2025-01-09 04:19:12,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:19:12,044 INFO L276 IsEmpty]: Start isEmpty. Operand 4030 states and 5240 transitions. [2025-01-09 04:19:12,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 04:19:12,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:12,047 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:12,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:19:12,047 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:12,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:12,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1858463115, now seen corresponding path program 1 times [2025-01-09 04:19:12,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:12,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636105789] [2025-01-09 04:19:12,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:12,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:12,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 04:19:12,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 04:19:12,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:12,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:12,087 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 04:19:12,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:12,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636105789] [2025-01-09 04:19:12,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636105789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:12,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:12,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:19:12,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126327143] [2025-01-09 04:19:12,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:12,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:19:12,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:12,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:19:12,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:19:12,088 INFO L87 Difference]: Start difference. First operand 4030 states and 5240 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:19:12,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:12,375 INFO L93 Difference]: Finished difference Result 7739 states and 10111 transitions. [2025-01-09 04:19:12,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:19:12,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 102 [2025-01-09 04:19:12,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:12,404 INFO L225 Difference]: With dead ends: 7739 [2025-01-09 04:19:12,404 INFO L226 Difference]: Without dead ends: 4063 [2025-01-09 04:19:12,413 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:19:12,414 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 6 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:12,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 481 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:12,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4063 states. [2025-01-09 04:19:12,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4063 to 4036. [2025-01-09 04:19:12,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4036 states, 2999 states have (on average 1.3011003667889296) internal successors, (3902), 3043 states have internal predecessors, (3902), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2025-01-09 04:19:12,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4036 states to 4036 states and 5246 transitions. [2025-01-09 04:19:12,703 INFO L78 Accepts]: Start accepts. Automaton has 4036 states and 5246 transitions. Word has length 102 [2025-01-09 04:19:12,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:12,703 INFO L471 AbstractCegarLoop]: Abstraction has 4036 states and 5246 transitions. [2025-01-09 04:19:12,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:19:12,703 INFO L276 IsEmpty]: Start isEmpty. Operand 4036 states and 5246 transitions. [2025-01-09 04:19:12,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 04:19:12,705 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:12,705 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:12,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:19:12,706 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:12,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:12,706 INFO L85 PathProgramCache]: Analyzing trace with hash 186249843, now seen corresponding path program 1 times [2025-01-09 04:19:12,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:12,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082740884] [2025-01-09 04:19:12,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:12,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:12,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 04:19:12,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 04:19:12,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:12,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:12,800 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 04:19:12,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:12,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082740884] [2025-01-09 04:19:12,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082740884] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:12,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:12,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:12,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822562361] [2025-01-09 04:19:12,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:12,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:12,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:12,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:12,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:12,803 INFO L87 Difference]: Start difference. First operand 4036 states and 5246 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:19:13,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:13,025 INFO L93 Difference]: Finished difference Result 7704 states and 10038 transitions. [2025-01-09 04:19:13,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:13,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 103 [2025-01-09 04:19:13,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:13,043 INFO L225 Difference]: With dead ends: 7704 [2025-01-09 04:19:13,043 INFO L226 Difference]: Without dead ends: 3744 [2025-01-09 04:19:13,053 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:19:13,053 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 83 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:13,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 746 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:13,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states. [2025-01-09 04:19:13,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 3681. [2025-01-09 04:19:13,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 2727 states have (on average 1.3105977264393105) internal successors, (3574), 2761 states have internal predecessors, (3574), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2025-01-09 04:19:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 4814 transitions. [2025-01-09 04:19:13,311 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 4814 transitions. Word has length 103 [2025-01-09 04:19:13,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:13,312 INFO L471 AbstractCegarLoop]: Abstraction has 3681 states and 4814 transitions. [2025-01-09 04:19:13,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:19:13,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 4814 transitions. [2025-01-09 04:19:13,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 04:19:13,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:13,314 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:13,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:19:13,314 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:13,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:13,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1538853851, now seen corresponding path program 1 times [2025-01-09 04:19:13,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:13,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741255493] [2025-01-09 04:19:13,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:13,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:13,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 04:19:13,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 04:19:13,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:13,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:13,376 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 04:19:13,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:13,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741255493] [2025-01-09 04:19:13,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741255493] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:13,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:13,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:19:13,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076505116] [2025-01-09 04:19:13,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:13,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:19:13,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:13,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:19:13,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:19:13,378 INFO L87 Difference]: Start difference. First operand 3681 states and 4814 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:19:13,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:13,675 INFO L93 Difference]: Finished difference Result 7232 states and 9498 transitions. [2025-01-09 04:19:13,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:19:13,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 104 [2025-01-09 04:19:13,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:13,692 INFO L225 Difference]: With dead ends: 7232 [2025-01-09 04:19:13,693 INFO L226 Difference]: Without dead ends: 3732 [2025-01-09 04:19:13,701 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:19:13,702 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 6 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:13,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 481 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3732 states. [2025-01-09 04:19:14,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3732 to 3691. [2025-01-09 04:19:14,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3691 states, 2737 states have (on average 1.3094629156010231) internal successors, (3584), 2771 states have internal predecessors, (3584), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2025-01-09 04:19:14,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3691 states to 3691 states and 4824 transitions. [2025-01-09 04:19:14,073 INFO L78 Accepts]: Start accepts. Automaton has 3691 states and 4824 transitions. Word has length 104 [2025-01-09 04:19:14,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:14,074 INFO L471 AbstractCegarLoop]: Abstraction has 3691 states and 4824 transitions. [2025-01-09 04:19:14,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:19:14,074 INFO L276 IsEmpty]: Start isEmpty. Operand 3691 states and 4824 transitions. [2025-01-09 04:19:14,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 04:19:14,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:14,076 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:14,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 04:19:14,076 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:14,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:14,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1484492278, now seen corresponding path program 1 times [2025-01-09 04:19:14,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:14,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195769735] [2025-01-09 04:19:14,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:14,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:14,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 04:19:14,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 04:19:14,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:14,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:14,166 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 04:19:14,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:14,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195769735] [2025-01-09 04:19:14,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195769735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:14,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:14,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:14,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848724156] [2025-01-09 04:19:14,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:14,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:14,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:14,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:14,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:14,169 INFO L87 Difference]: Start difference. First operand 3691 states and 4824 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:19:14,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:14,381 INFO L93 Difference]: Finished difference Result 7183 states and 9409 transitions. [2025-01-09 04:19:14,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:14,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 104 [2025-01-09 04:19:14,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:14,396 INFO L225 Difference]: With dead ends: 7183 [2025-01-09 04:19:14,396 INFO L226 Difference]: Without dead ends: 3611 [2025-01-09 04:19:14,404 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:19:14,404 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 64 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:14,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 756 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:14,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3611 states. [2025-01-09 04:19:14,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3611 to 2783. [2025-01-09 04:19:14,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2783 states, 2063 states have (on average 1.303926320891905) internal successors, (2690), 2082 states have internal predecessors, (2690), 469 states have call successors, (469), 250 states have call predecessors, (469), 250 states have return successors, (469), 450 states have call predecessors, (469), 469 states have call successors, (469) [2025-01-09 04:19:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2783 states and 3628 transitions. [2025-01-09 04:19:14,565 INFO L78 Accepts]: Start accepts. Automaton has 2783 states and 3628 transitions. Word has length 104 [2025-01-09 04:19:14,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:14,566 INFO L471 AbstractCegarLoop]: Abstraction has 2783 states and 3628 transitions. [2025-01-09 04:19:14,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:19:14,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2783 states and 3628 transitions. [2025-01-09 04:19:14,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 04:19:14,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:14,570 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:14,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 04:19:14,570 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:14,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:14,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1637370852, now seen corresponding path program 1 times [2025-01-09 04:19:14,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:14,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096434268] [2025-01-09 04:19:14,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:14,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:14,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 04:19:14,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 04:19:14,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:14,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:14,776 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-09 04:19:14,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:14,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096434268] [2025-01-09 04:19:14,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096434268] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:14,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040540602] [2025-01-09 04:19:14,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:14,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:14,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:14,778 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:19:14,781 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:19:14,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 04:19:14,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 04:19:14,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:14,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:14,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 04:19:14,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 38 proven. 4 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-09 04:19:15,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:19:15,365 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 04:19:15,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040540602] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:19:15,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:19:15,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 19 [2025-01-09 04:19:15,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379933789] [2025-01-09 04:19:15,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:19:15,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 04:19:15,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:15,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 04:19:15,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:19:15,367 INFO L87 Difference]: Start difference. First operand 2783 states and 3628 transitions. Second operand has 19 states, 17 states have (on average 13.294117647058824) internal successors, (226), 18 states have internal predecessors, (226), 10 states have call successors, (35), 4 states have call predecessors, (35), 7 states have return successors, (35), 9 states have call predecessors, (35), 10 states have call successors, (35) [2025-01-09 04:19:17,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:17,433 INFO L93 Difference]: Finished difference Result 7237 states and 9414 transitions. [2025-01-09 04:19:17,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-01-09 04:19:17,434 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 13.294117647058824) internal successors, (226), 18 states have internal predecessors, (226), 10 states have call successors, (35), 4 states have call predecessors, (35), 7 states have return successors, (35), 9 states have call predecessors, (35), 10 states have call successors, (35) Word has length 153 [2025-01-09 04:19:17,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:17,451 INFO L225 Difference]: With dead ends: 7237 [2025-01-09 04:19:17,451 INFO L226 Difference]: Without dead ends: 4647 [2025-01-09 04:19:17,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=555, Invalid=2525, Unknown=0, NotChecked=0, Total=3080 [2025-01-09 04:19:17,460 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 2055 mSDsluCounter, 3365 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2055 SdHoareTripleChecker+Valid, 3716 SdHoareTripleChecker+Invalid, 2047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:17,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2055 Valid, 3716 Invalid, 2047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 04:19:17,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4647 states. [2025-01-09 04:19:17,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4647 to 4248. [2025-01-09 04:19:17,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4248 states, 3125 states have (on average 1.29696) internal successors, (4053), 3153 states have internal predecessors, (4053), 730 states have call successors, (730), 392 states have call predecessors, (730), 392 states have return successors, (730), 702 states have call predecessors, (730), 730 states have call successors, (730) [2025-01-09 04:19:17,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4248 states to 4248 states and 5513 transitions. [2025-01-09 04:19:17,792 INFO L78 Accepts]: Start accepts. Automaton has 4248 states and 5513 transitions. Word has length 153 [2025-01-09 04:19:17,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:17,792 INFO L471 AbstractCegarLoop]: Abstraction has 4248 states and 5513 transitions. [2025-01-09 04:19:17,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 13.294117647058824) internal successors, (226), 18 states have internal predecessors, (226), 10 states have call successors, (35), 4 states have call predecessors, (35), 7 states have return successors, (35), 9 states have call predecessors, (35), 10 states have call successors, (35) [2025-01-09 04:19:17,793 INFO L276 IsEmpty]: Start isEmpty. Operand 4248 states and 5513 transitions. [2025-01-09 04:19:17,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 04:19:17,797 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:17,798 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:17,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 04:19:17,998 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,SelfDestructingSolverStorable27 [2025-01-09 04:19:17,998 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:17,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:17,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1372497338, now seen corresponding path program 1 times [2025-01-09 04:19:17,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:17,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412602606] [2025-01-09 04:19:17,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:17,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:18,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 04:19:18,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 04:19:18,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:18,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:18,509 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-09 04:19:18,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:18,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412602606] [2025-01-09 04:19:18,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412602606] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:18,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376420729] [2025-01-09 04:19:18,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:18,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:18,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:18,512 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:19:18,514 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:19:18,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 04:19:18,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 04:19:18,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:18,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:18,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 04:19:18,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:18,916 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 37 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:19:18,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:19:18,987 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-09 04:19:18,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376420729] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:18,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 04:19:18,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 13] total 20 [2025-01-09 04:19:18,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262613876] [2025-01-09 04:19:18,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:18,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:19:18,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:18,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:19:18,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:19:18,989 INFO L87 Difference]: Start difference. First operand 4248 states and 5513 transitions. Second operand has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 04:19:19,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:19,182 INFO L93 Difference]: Finished difference Result 7186 states and 9374 transitions. [2025-01-09 04:19:19,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:19,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 154 [2025-01-09 04:19:19,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:19,200 INFO L225 Difference]: With dead ends: 7186 [2025-01-09 04:19:19,200 INFO L226 Difference]: Without dead ends: 3187 [2025-01-09 04:19:19,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:19:19,209 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 0 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:19,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1021 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:19,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3187 states. [2025-01-09 04:19:19,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3187 to 3187. [2025-01-09 04:19:19,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3187 states, 2366 states have (on average 1.2928994082840237) internal successors, (3059), 2386 states have internal predecessors, (3059), 528 states have call successors, (528), 292 states have call predecessors, (528), 292 states have return successors, (528), 508 states have call predecessors, (528), 528 states have call successors, (528) [2025-01-09 04:19:19,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3187 states to 3187 states and 4115 transitions. [2025-01-09 04:19:19,410 INFO L78 Accepts]: Start accepts. Automaton has 3187 states and 4115 transitions. Word has length 154 [2025-01-09 04:19:19,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:19,411 INFO L471 AbstractCegarLoop]: Abstraction has 3187 states and 4115 transitions. [2025-01-09 04:19:19,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 04:19:19,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3187 states and 4115 transitions. [2025-01-09 04:19:19,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 04:19:19,415 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:19,415 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:19,422 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:19:19,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:19,619 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:19,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:19,620 INFO L85 PathProgramCache]: Analyzing trace with hash 803555686, now seen corresponding path program 1 times [2025-01-09 04:19:19,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:19,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454966546] [2025-01-09 04:19:19,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:19,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:19,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 04:19:19,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 04:19:19,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:19,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-09 04:19:20,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:20,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454966546] [2025-01-09 04:19:20,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454966546] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:20,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138826769] [2025-01-09 04:19:20,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:20,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:20,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:20,293 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:19:20,294 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:19:20,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 04:19:20,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 04:19:20,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:20,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:20,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 04:19:20,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 32 proven. 44 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:19:20,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:19:20,983 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-09 04:19:20,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138826769] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:19:20,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:19:20,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 8] total 23 [2025-01-09 04:19:20,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737752506] [2025-01-09 04:19:20,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:19:20,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 04:19:20,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:20,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 04:19:20,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:19:20,985 INFO L87 Difference]: Start difference. First operand 3187 states and 4115 transitions. Second operand has 23 states, 23 states have (on average 10.304347826086957) internal successors, (237), 20 states have internal predecessors, (237), 8 states have call successors, (40), 4 states have call predecessors, (40), 8 states have return successors, (39), 11 states have call predecessors, (39), 8 states have call successors, (39) [2025-01-09 04:19:22,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:22,271 INFO L93 Difference]: Finished difference Result 8821 states and 11458 transitions. [2025-01-09 04:19:22,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 04:19:22,272 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 10.304347826086957) internal successors, (237), 20 states have internal predecessors, (237), 8 states have call successors, (40), 4 states have call predecessors, (40), 8 states have return successors, (39), 11 states have call predecessors, (39), 8 states have call successors, (39) Word has length 155 [2025-01-09 04:19:22,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:22,297 INFO L225 Difference]: With dead ends: 8821 [2025-01-09 04:19:22,297 INFO L226 Difference]: Without dead ends: 5928 [2025-01-09 04:19:22,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=360, Invalid=1532, Unknown=0, NotChecked=0, Total=1892 [2025-01-09 04:19:22,309 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 1255 mSDsluCounter, 4001 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 4436 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:22,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1260 Valid, 4436 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:19:22,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5928 states. [2025-01-09 04:19:22,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5928 to 5160. [2025-01-09 04:19:22,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5160 states, 3823 states have (on average 1.299503008108815) internal successors, (4968), 3855 states have internal predecessors, (4968), 862 states have call successors, (862), 474 states have call predecessors, (862), 474 states have return successors, (862), 830 states have call predecessors, (862), 862 states have call successors, (862) [2025-01-09 04:19:22,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5160 states to 5160 states and 6692 transitions. [2025-01-09 04:19:22,704 INFO L78 Accepts]: Start accepts. Automaton has 5160 states and 6692 transitions. Word has length 155 [2025-01-09 04:19:22,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:22,706 INFO L471 AbstractCegarLoop]: Abstraction has 5160 states and 6692 transitions. [2025-01-09 04:19:22,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.304347826086957) internal successors, (237), 20 states have internal predecessors, (237), 8 states have call successors, (40), 4 states have call predecessors, (40), 8 states have return successors, (39), 11 states have call predecessors, (39), 8 states have call successors, (39) [2025-01-09 04:19:22,706 INFO L276 IsEmpty]: Start isEmpty. Operand 5160 states and 6692 transitions. [2025-01-09 04:19:22,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 04:19:22,713 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:22,713 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:22,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 04:19:22,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:22,914 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:22,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:22,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1722987709, now seen corresponding path program 1 times [2025-01-09 04:19:22,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:22,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123964606] [2025-01-09 04:19:22,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:22,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:22,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 04:19:22,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 04:19:22,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:22,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:23,081 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-01-09 04:19:23,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:23,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123964606] [2025-01-09 04:19:23,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123964606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:23,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:23,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:19:23,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407023277] [2025-01-09 04:19:23,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:23,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:19:23,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:23,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:19:23,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:19:23,083 INFO L87 Difference]: Start difference. First operand 5160 states and 6692 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 6 states have internal predecessors, (95), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 04:19:23,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:23,809 INFO L93 Difference]: Finished difference Result 15036 states and 19572 transitions. [2025-01-09 04:19:23,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:19:23,810 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 6 states have internal predecessors, (95), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 157 [2025-01-09 04:19:23,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:23,853 INFO L225 Difference]: With dead ends: 15036 [2025-01-09 04:19:23,853 INFO L226 Difference]: Without dead ends: 10181 [2025-01-09 04:19:23,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:19:23,865 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 224 mSDsluCounter, 2088 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 2573 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:23,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 2573 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:19:23,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10181 states. [2025-01-09 04:19:24,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10181 to 7531. [2025-01-09 04:19:24,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7531 states, 5530 states have (on average 1.2965641952983724) internal successors, (7170), 5579 states have internal predecessors, (7170), 1305 states have call successors, (1305), 695 states have call predecessors, (1305), 695 states have return successors, (1305), 1256 states have call predecessors, (1305), 1305 states have call successors, (1305) [2025-01-09 04:19:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7531 states to 7531 states and 9780 transitions. [2025-01-09 04:19:24,490 INFO L78 Accepts]: Start accepts. Automaton has 7531 states and 9780 transitions. Word has length 157 [2025-01-09 04:19:24,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:24,491 INFO L471 AbstractCegarLoop]: Abstraction has 7531 states and 9780 transitions. [2025-01-09 04:19:24,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 6 states have internal predecessors, (95), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 04:19:24,491 INFO L276 IsEmpty]: Start isEmpty. Operand 7531 states and 9780 transitions. [2025-01-09 04:19:24,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 04:19:24,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:24,504 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:24,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 04:19:24,504 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:24,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:24,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2062404651, now seen corresponding path program 1 times [2025-01-09 04:19:24,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:24,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023030723] [2025-01-09 04:19:24,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:24,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:24,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 04:19:24,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 04:19:24,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:24,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:25,105 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-09 04:19:25,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:25,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023030723] [2025-01-09 04:19:25,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023030723] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:25,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60128516] [2025-01-09 04:19:25,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:25,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:25,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:25,108 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:19:25,110 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:19:25,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 04:19:25,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 04:19:25,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:25,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:25,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-09 04:19:25,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:25,704 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 62 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:19:25,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:19:26,488 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-09 04:19:26,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60128516] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:19:26,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:19:26,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 9] total 26 [2025-01-09 04:19:26,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320133451] [2025-01-09 04:19:26,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:19:26,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 04:19:26,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:26,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 04:19:26,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2025-01-09 04:19:26,490 INFO L87 Difference]: Start difference. First operand 7531 states and 9780 transitions. Second operand has 26 states, 26 states have (on average 8.76923076923077) internal successors, (228), 26 states have internal predecessors, (228), 8 states have call successors, (30), 5 states have call predecessors, (30), 6 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) [2025-01-09 04:19:28,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:28,798 INFO L93 Difference]: Finished difference Result 15464 states and 20137 transitions. [2025-01-09 04:19:28,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 04:19:28,799 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.76923076923077) internal successors, (228), 26 states have internal predecessors, (228), 8 states have call successors, (30), 5 states have call predecessors, (30), 6 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) Word has length 157 [2025-01-09 04:19:28,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:28,829 INFO L225 Difference]: With dead ends: 15464 [2025-01-09 04:19:28,829 INFO L226 Difference]: Without dead ends: 8238 [2025-01-09 04:19:28,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=281, Invalid=1279, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 04:19:28,841 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 926 mSDsluCounter, 4223 mSDsCounter, 0 mSdLazyCounter, 2211 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 4665 SdHoareTripleChecker+Invalid, 2513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 2211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:28,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 4665 Invalid, 2513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 2211 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 04:19:28,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8238 states. [2025-01-09 04:19:29,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8238 to 8085. [2025-01-09 04:19:29,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8085 states, 5932 states have (on average 1.295515846257586) internal successors, (7685), 5986 states have internal predecessors, (7685), 1403 states have call successors, (1403), 749 states have call predecessors, (1403), 749 states have return successors, (1403), 1349 states have call predecessors, (1403), 1403 states have call successors, (1403) [2025-01-09 04:19:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8085 states to 8085 states and 10491 transitions. [2025-01-09 04:19:29,507 INFO L78 Accepts]: Start accepts. Automaton has 8085 states and 10491 transitions. Word has length 157 [2025-01-09 04:19:29,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:29,508 INFO L471 AbstractCegarLoop]: Abstraction has 8085 states and 10491 transitions. [2025-01-09 04:19:29,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.76923076923077) internal successors, (228), 26 states have internal predecessors, (228), 8 states have call successors, (30), 5 states have call predecessors, (30), 6 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) [2025-01-09 04:19:29,508 INFO L276 IsEmpty]: Start isEmpty. Operand 8085 states and 10491 transitions. [2025-01-09 04:19:29,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 04:19:29,518 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:29,518 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:29,525 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:19:29,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:29,719 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:29,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:29,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1594862628, now seen corresponding path program 1 times [2025-01-09 04:19:29,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:29,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889335963] [2025-01-09 04:19:29,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:29,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:29,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 04:19:29,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 04:19:29,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:29,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:30,242 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-01-09 04:19:30,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:30,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889335963] [2025-01-09 04:19:30,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889335963] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:30,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623860400] [2025-01-09 04:19:30,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:30,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:30,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:30,247 INFO L229 MonitoredProcess]: Starting monitored process 7 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:19:30,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 04:19:30,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 04:19:30,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 04:19:30,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:30,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:30,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 04:19:30,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:30,779 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 59 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:19:30,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:19:32,690 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-09 04:19:32,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623860400] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:19:32,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:19:32,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 10] total 27 [2025-01-09 04:19:32,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411269950] [2025-01-09 04:19:32,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:19:32,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 04:19:32,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:32,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 04:19:32,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:19:32,693 INFO L87 Difference]: Start difference. First operand 8085 states and 10491 transitions. Second operand has 27 states, 26 states have (on average 9.538461538461538) internal successors, (248), 25 states have internal predecessors, (248), 8 states have call successors, (36), 5 states have call predecessors, (36), 7 states have return successors, (35), 9 states have call predecessors, (35), 8 states have call successors, (35) [2025-01-09 04:19:35,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:35,975 INFO L93 Difference]: Finished difference Result 21278 states and 27557 transitions. [2025-01-09 04:19:35,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-09 04:19:35,976 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 9.538461538461538) internal successors, (248), 25 states have internal predecessors, (248), 8 states have call successors, (36), 5 states have call predecessors, (36), 7 states have return successors, (35), 9 states have call predecessors, (35), 8 states have call successors, (35) Word has length 158 [2025-01-09 04:19:35,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:36,029 INFO L225 Difference]: With dead ends: 21278 [2025-01-09 04:19:36,029 INFO L226 Difference]: Without dead ends: 13471 [2025-01-09 04:19:36,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=406, Invalid=2674, Unknown=0, NotChecked=0, Total=3080 [2025-01-09 04:19:36,043 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 953 mSDsluCounter, 6430 mSDsCounter, 0 mSdLazyCounter, 2783 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 6913 SdHoareTripleChecker+Invalid, 3055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 2783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:36,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 6913 Invalid, 3055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 2783 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:19:36,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13471 states. [2025-01-09 04:19:37,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13471 to 8988. [2025-01-09 04:19:37,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8988 states, 6588 states have (on average 1.2941712204007285) internal successors, (8526), 6651 states have internal predecessors, (8526), 1555 states have call successors, (1555), 844 states have call predecessors, (1555), 844 states have return successors, (1555), 1492 states have call predecessors, (1555), 1555 states have call successors, (1555) [2025-01-09 04:19:37,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8988 states to 8988 states and 11636 transitions. [2025-01-09 04:19:37,267 INFO L78 Accepts]: Start accepts. Automaton has 8988 states and 11636 transitions. Word has length 158 [2025-01-09 04:19:37,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:37,267 INFO L471 AbstractCegarLoop]: Abstraction has 8988 states and 11636 transitions. [2025-01-09 04:19:37,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 9.538461538461538) internal successors, (248), 25 states have internal predecessors, (248), 8 states have call successors, (36), 5 states have call predecessors, (36), 7 states have return successors, (35), 9 states have call predecessors, (35), 8 states have call successors, (35) [2025-01-09 04:19:37,268 INFO L276 IsEmpty]: Start isEmpty. Operand 8988 states and 11636 transitions. [2025-01-09 04:19:37,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 04:19:37,276 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:37,276 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:37,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 04:19:37,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-01-09 04:19:37,477 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:37,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:37,477 INFO L85 PathProgramCache]: Analyzing trace with hash -491649825, now seen corresponding path program 1 times [2025-01-09 04:19:37,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:37,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350511552] [2025-01-09 04:19:37,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:37,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:37,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 04:19:37,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 04:19:37,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:37,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:37,998 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-09 04:19:37,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:37,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350511552] [2025-01-09 04:19:37,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350511552] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:37,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220155404] [2025-01-09 04:19:37,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:37,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:37,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:38,001 INFO L229 MonitoredProcess]: Starting monitored process 8 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:19:38,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 04:19:38,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 04:19:38,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 04:19:38,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:38,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:38,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 04:19:38,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:38,277 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 48 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-09 04:19:38,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:19:38,364 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 04:19:38,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220155404] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:19:38,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:19:38,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2025-01-09 04:19:38,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118486689] [2025-01-09 04:19:38,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:19:38,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 04:19:38,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:38,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 04:19:38,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:19:38,367 INFO L87 Difference]: Start difference. First operand 8988 states and 11636 transitions. Second operand has 15 states, 15 states have (on average 13.2) internal successors, (198), 14 states have internal predecessors, (198), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2025-01-09 04:19:40,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:40,589 INFO L93 Difference]: Finished difference Result 18318 states and 23709 transitions. [2025-01-09 04:19:40,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 04:19:40,589 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 13.2) internal successors, (198), 14 states have internal predecessors, (198), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 167 [2025-01-09 04:19:40,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:40,626 INFO L225 Difference]: With dead ends: 18318 [2025-01-09 04:19:40,626 INFO L226 Difference]: Without dead ends: 9544 [2025-01-09 04:19:40,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=277, Invalid=1529, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 04:19:40,638 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 1108 mSDsluCounter, 3085 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1108 SdHoareTripleChecker+Valid, 3479 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:40,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1108 Valid, 3479 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:19:40,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9544 states. [2025-01-09 04:19:41,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9544 to 9316. [2025-01-09 04:19:41,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9316 states, 6828 states have (on average 1.2934973637961336) internal successors, (8832), 6894 states have internal predecessors, (8832), 1610 states have call successors, (1610), 877 states have call predecessors, (1610), 877 states have return successors, (1610), 1544 states have call predecessors, (1610), 1610 states have call successors, (1610) [2025-01-09 04:19:41,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9316 states to 9316 states and 12052 transitions. [2025-01-09 04:19:41,644 INFO L78 Accepts]: Start accepts. Automaton has 9316 states and 12052 transitions. Word has length 167 [2025-01-09 04:19:41,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:41,645 INFO L471 AbstractCegarLoop]: Abstraction has 9316 states and 12052 transitions. [2025-01-09 04:19:41,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 13.2) internal successors, (198), 14 states have internal predecessors, (198), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2025-01-09 04:19:41,645 INFO L276 IsEmpty]: Start isEmpty. Operand 9316 states and 12052 transitions. [2025-01-09 04:19:41,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 04:19:41,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:41,653 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 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] [2025-01-09 04:19:41,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 04:19:41,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:41,854 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:41,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:41,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1752497244, now seen corresponding path program 1 times [2025-01-09 04:19:41,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:41,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633203151] [2025-01-09 04:19:41,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:41,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:41,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 04:19:41,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 04:19:41,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:41,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:42,361 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-01-09 04:19:42,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:42,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633203151] [2025-01-09 04:19:42,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633203151] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:42,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138178036] [2025-01-09 04:19:42,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:42,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:42,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:42,364 INFO L229 MonitoredProcess]: Starting monitored process 9 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:19:42,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 04:19:42,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 04:19:42,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 04:19:42,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:42,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:42,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 04:19:42,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:42,752 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 79 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 04:19:42,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:19:42,928 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 33 proven. 8 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-01-09 04:19:42,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138178036] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:19:42,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:19:42,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 9] total 26 [2025-01-09 04:19:42,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715446912] [2025-01-09 04:19:42,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:19:42,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 04:19:42,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:42,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 04:19:42,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2025-01-09 04:19:42,930 INFO L87 Difference]: Start difference. First operand 9316 states and 12052 transitions. Second operand has 26 states, 26 states have (on average 8.884615384615385) internal successors, (231), 22 states have internal predecessors, (231), 7 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (40), 11 states have call predecessors, (40), 7 states have call successors, (40) [2025-01-09 04:19:47,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:47,514 INFO L93 Difference]: Finished difference Result 26571 states and 35341 transitions. [2025-01-09 04:19:47,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-01-09 04:19:47,515 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.884615384615385) internal successors, (231), 22 states have internal predecessors, (231), 7 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (40), 11 states have call predecessors, (40), 7 states have call successors, (40) Word has length 176 [2025-01-09 04:19:47,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:47,580 INFO L225 Difference]: With dead ends: 26571 [2025-01-09 04:19:47,580 INFO L226 Difference]: Without dead ends: 17389 [2025-01-09 04:19:47,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=571, Invalid=3211, Unknown=0, NotChecked=0, Total=3782 [2025-01-09 04:19:47,597 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 1455 mSDsluCounter, 8001 mSDsCounter, 0 mSdLazyCounter, 3036 mSolverCounterSat, 583 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1455 SdHoareTripleChecker+Valid, 8671 SdHoareTripleChecker+Invalid, 3619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 583 IncrementalHoareTripleChecker+Valid, 3036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:47,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1455 Valid, 8671 Invalid, 3619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [583 Valid, 3036 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 04:19:47,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17389 states. [2025-01-09 04:19:49,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17389 to 10976. [2025-01-09 04:19:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10976 states, 8025 states have (on average 1.290841121495327) internal successors, (10359), 8108 states have internal predecessors, (10359), 1907 states have call successors, (1907), 1043 states have call predecessors, (1907), 1043 states have return successors, (1907), 1824 states have call predecessors, (1907), 1907 states have call successors, (1907) [2025-01-09 04:19:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10976 states to 10976 states and 14173 transitions. [2025-01-09 04:19:49,182 INFO L78 Accepts]: Start accepts. Automaton has 10976 states and 14173 transitions. Word has length 176 [2025-01-09 04:19:49,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:49,182 INFO L471 AbstractCegarLoop]: Abstraction has 10976 states and 14173 transitions. [2025-01-09 04:19:49,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.884615384615385) internal successors, (231), 22 states have internal predecessors, (231), 7 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (40), 11 states have call predecessors, (40), 7 states have call successors, (40) [2025-01-09 04:19:49,183 INFO L276 IsEmpty]: Start isEmpty. Operand 10976 states and 14173 transitions. [2025-01-09 04:19:49,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 04:19:49,190 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:49,190 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 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, 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] [2025-01-09 04:19:49,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 04:19:49,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:49,395 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:49,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:49,395 INFO L85 PathProgramCache]: Analyzing trace with hash 920107097, now seen corresponding path program 1 times [2025-01-09 04:19:49,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:49,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638844655] [2025-01-09 04:19:49,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:49,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:49,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 04:19:49,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 04:19:49,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:49,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:49,818 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-01-09 04:19:49,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:49,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638844655] [2025-01-09 04:19:49,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638844655] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:49,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256725227] [2025-01-09 04:19:49,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:49,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:49,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:49,820 INFO L229 MonitoredProcess]: Starting monitored process 10 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:19:49,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 04:19:49,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 04:19:49,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 04:19:49,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:49,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:50,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-09 04:19:50,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 77 proven. 13 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 04:19:50,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:19:50,684 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-01-09 04:19:50,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256725227] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:19:50,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:19:50,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 21 [2025-01-09 04:19:50,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015150575] [2025-01-09 04:19:50,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:19:50,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 04:19:50,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:50,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 04:19:50,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:19:50,686 INFO L87 Difference]: Start difference. First operand 10976 states and 14173 transitions. Second operand has 21 states, 21 states have (on average 12.095238095238095) internal successors, (254), 20 states have internal predecessors, (254), 8 states have call successors, (36), 5 states have call predecessors, (36), 6 states have return successors, (36), 9 states have call predecessors, (36), 8 states have call successors, (36) [2025-01-09 04:19:54,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:54,604 INFO L93 Difference]: Finished difference Result 30126 states and 39065 transitions. [2025-01-09 04:19:54,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 04:19:54,605 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 12.095238095238095) internal successors, (254), 20 states have internal predecessors, (254), 8 states have call successors, (36), 5 states have call predecessors, (36), 6 states have return successors, (36), 9 states have call predecessors, (36), 8 states have call successors, (36) Word has length 183 [2025-01-09 04:19:54,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:54,680 INFO L225 Difference]: With dead ends: 30126 [2025-01-09 04:19:54,680 INFO L226 Difference]: Without dead ends: 19469 [2025-01-09 04:19:54,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 361 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1498, Unknown=0, NotChecked=0, Total=1892 [2025-01-09 04:19:54,704 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 1675 mSDsluCounter, 2897 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1675 SdHoareTripleChecker+Valid, 3314 SdHoareTripleChecker+Invalid, 2210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:54,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1675 Valid, 3314 Invalid, 2210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 1741 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:19:54,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19469 states. [2025-01-09 04:19:57,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19469 to 19116. [2025-01-09 04:19:57,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19116 states, 13952 states have (on average 1.295083142201835) internal successors, (18069), 14099 states have internal predecessors, (18069), 3348 states have call successors, (3348), 1815 states have call predecessors, (3348), 1815 states have return successors, (3348), 3201 states have call predecessors, (3348), 3348 states have call successors, (3348) [2025-01-09 04:19:57,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19116 states to 19116 states and 24765 transitions. [2025-01-09 04:19:57,473 INFO L78 Accepts]: Start accepts. Automaton has 19116 states and 24765 transitions. Word has length 183 [2025-01-09 04:19:57,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:57,473 INFO L471 AbstractCegarLoop]: Abstraction has 19116 states and 24765 transitions. [2025-01-09 04:19:57,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 12.095238095238095) internal successors, (254), 20 states have internal predecessors, (254), 8 states have call successors, (36), 5 states have call predecessors, (36), 6 states have return successors, (36), 9 states have call predecessors, (36), 8 states have call successors, (36) [2025-01-09 04:19:57,473 INFO L276 IsEmpty]: Start isEmpty. Operand 19116 states and 24765 transitions. [2025-01-09 04:19:57,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-09 04:19:57,483 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:57,483 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 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, 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] [2025-01-09 04:19:57,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 04:19:57,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:57,683 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:57,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:57,684 INFO L85 PathProgramCache]: Analyzing trace with hash 633730106, now seen corresponding path program 1 times [2025-01-09 04:19:57,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:57,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269972145] [2025-01-09 04:19:57,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:57,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:57,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 04:19:57,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 04:19:57,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:57,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-01-09 04:19:58,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:58,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269972145] [2025-01-09 04:19:58,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269972145] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:58,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168580330] [2025-01-09 04:19:58,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:58,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:58,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:58,065 INFO L229 MonitoredProcess]: Starting monitored process 11 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:19:58,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 04:19:58,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 04:19:58,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 04:19:58,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:58,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:58,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 04:19:58,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:58,671 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 68 proven. 27 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 04:19:58,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:19:59,088 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-01-09 04:19:59,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168580330] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:19:59,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:19:59,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 10] total 20 [2025-01-09 04:19:59,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229210232] [2025-01-09 04:19:59,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:19:59,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 04:19:59,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:59,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 04:19:59,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:19:59,089 INFO L87 Difference]: Start difference. First operand 19116 states and 24765 transitions. Second operand has 20 states, 20 states have (on average 14.6) internal successors, (292), 20 states have internal predecessors, (292), 11 states have call successors, (47), 6 states have call predecessors, (47), 6 states have return successors, (46), 11 states have call predecessors, (46), 11 states have call successors, (46) [2025-01-09 04:20:03,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:03,492 INFO L93 Difference]: Finished difference Result 38706 states and 50224 transitions. [2025-01-09 04:20:03,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 04:20:03,493 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 14.6) internal successors, (292), 20 states have internal predecessors, (292), 11 states have call successors, (47), 6 states have call predecessors, (47), 6 states have return successors, (46), 11 states have call predecessors, (46), 11 states have call successors, (46) Word has length 184 [2025-01-09 04:20:03,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:03,575 INFO L225 Difference]: With dead ends: 38706 [2025-01-09 04:20:03,575 INFO L226 Difference]: Without dead ends: 19909 [2025-01-09 04:20:03,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=461, Invalid=1179, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 04:20:03,615 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 1032 mSDsluCounter, 1649 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:03,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 2038 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:20:03,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19909 states. [2025-01-09 04:20:06,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19909 to 19504. [2025-01-09 04:20:06,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19504 states, 14288 states have (on average 1.2962625979843225) internal successors, (18521), 14435 states have internal predecessors, (18521), 3374 states have call successors, (3374), 1841 states have call predecessors, (3374), 1841 states have return successors, (3374), 3227 states have call predecessors, (3374), 3374 states have call successors, (3374) [2025-01-09 04:20:06,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19504 states to 19504 states and 25269 transitions. [2025-01-09 04:20:06,695 INFO L78 Accepts]: Start accepts. Automaton has 19504 states and 25269 transitions. Word has length 184 [2025-01-09 04:20:06,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:06,696 INFO L471 AbstractCegarLoop]: Abstraction has 19504 states and 25269 transitions. [2025-01-09 04:20:06,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 14.6) internal successors, (292), 20 states have internal predecessors, (292), 11 states have call successors, (47), 6 states have call predecessors, (47), 6 states have return successors, (46), 11 states have call predecessors, (46), 11 states have call successors, (46) [2025-01-09 04:20:06,696 INFO L276 IsEmpty]: Start isEmpty. Operand 19504 states and 25269 transitions. [2025-01-09 04:20:06,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-09 04:20:06,705 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:06,705 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 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, 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] [2025-01-09 04:20:06,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 04:20:06,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-01-09 04:20:06,906 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:06,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:06,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1091852600, now seen corresponding path program 1 times [2025-01-09 04:20:06,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:06,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005897828] [2025-01-09 04:20:06,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:06,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:06,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 04:20:06,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 04:20:06,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:06,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:07,474 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-01-09 04:20:07,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:07,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005897828] [2025-01-09 04:20:07,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005897828] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:20:07,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758727630] [2025-01-09 04:20:07,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:07,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:20:07,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:20:07,478 INFO L229 MonitoredProcess]: Starting monitored process 12 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:20:07,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 04:20:07,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 04:20:07,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 04:20:07,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:07,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:07,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 04:20:07,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:20:07,879 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 76 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 04:20:07,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:20:08,025 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-01-09 04:20:08,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758727630] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:20:08,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:20:08,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 7] total 21 [2025-01-09 04:20:08,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819409719] [2025-01-09 04:20:08,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:20:08,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 04:20:08,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:08,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 04:20:08,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:20:08,027 INFO L87 Difference]: Start difference. First operand 19504 states and 25269 transitions. Second operand has 21 states, 21 states have (on average 10.761904761904763) internal successors, (226), 18 states have internal predecessors, (226), 6 states have call successors, (37), 4 states have call predecessors, (37), 8 states have return successors, (37), 9 states have call predecessors, (37), 6 states have call successors, (37) [2025-01-09 04:20:11,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:11,466 INFO L93 Difference]: Finished difference Result 34574 states and 44774 transitions. [2025-01-09 04:20:11,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:20:11,467 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.761904761904763) internal successors, (226), 18 states have internal predecessors, (226), 6 states have call successors, (37), 4 states have call predecessors, (37), 8 states have return successors, (37), 9 states have call predecessors, (37), 6 states have call successors, (37) Word has length 184 [2025-01-09 04:20:11,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:11,528 INFO L225 Difference]: With dead ends: 34574 [2025-01-09 04:20:11,528 INFO L226 Difference]: Without dead ends: 15293 [2025-01-09 04:20:11,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=775, Unknown=0, NotChecked=0, Total=992 [2025-01-09 04:20:11,559 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 1291 mSDsluCounter, 2186 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 474 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1291 SdHoareTripleChecker+Valid, 2525 SdHoareTripleChecker+Invalid, 1552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 474 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:11,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1291 Valid, 2525 Invalid, 1552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [474 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:20:11,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15293 states. [2025-01-09 04:20:13,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15293 to 15009. [2025-01-09 04:20:13,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15009 states, 11078 states have (on average 1.2921104892579889) internal successors, (14314), 11189 states have internal predecessors, (14314), 2532 states have call successors, (2532), 1398 states have call predecessors, (2532), 1398 states have return successors, (2532), 2421 states have call predecessors, (2532), 2532 states have call successors, (2532) [2025-01-09 04:20:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15009 states to 15009 states and 19378 transitions. [2025-01-09 04:20:14,042 INFO L78 Accepts]: Start accepts. Automaton has 15009 states and 19378 transitions. Word has length 184 [2025-01-09 04:20:14,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:14,042 INFO L471 AbstractCegarLoop]: Abstraction has 15009 states and 19378 transitions. [2025-01-09 04:20:14,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.761904761904763) internal successors, (226), 18 states have internal predecessors, (226), 6 states have call successors, (37), 4 states have call predecessors, (37), 8 states have return successors, (37), 9 states have call predecessors, (37), 6 states have call successors, (37) [2025-01-09 04:20:14,042 INFO L276 IsEmpty]: Start isEmpty. Operand 15009 states and 19378 transitions. [2025-01-09 04:20:14,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-01-09 04:20:14,049 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:14,050 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 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, 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] [2025-01-09 04:20:14,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 04:20:14,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-01-09 04:20:14,250 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:14,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:14,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1816451424, now seen corresponding path program 1 times [2025-01-09 04:20:14,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:14,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13895068] [2025-01-09 04:20:14,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:14,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:14,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-09 04:20:14,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-09 04:20:14,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:14,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:14,576 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-01-09 04:20:14,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:14,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13895068] [2025-01-09 04:20:14,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13895068] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:20:14,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184180988] [2025-01-09 04:20:14,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:14,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:20:14,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:20:14,578 INFO L229 MonitoredProcess]: Starting monitored process 13 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:20:14,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 04:20:14,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-09 04:20:14,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-09 04:20:14,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:14,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:14,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 04:20:14,764 INFO L279 TraceCheckSpWp]: Computing forward predicates...