./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.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_Triplicated.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 6ff1cedc7411bab7c4dff496b498f1be2a7af9e572a1448d390780005c75fec3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:19:46,728 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:19:46,785 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:19:46,789 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:19:46,789 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:19:46,818 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:19:46,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:19:46,819 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:19:46,819 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:19:46,819 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:19:46,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:19:46,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:19:46,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:19:46,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:19:46,819 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:19:46,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:19:46,819 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:19:46,819 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:19:46,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:19:46,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:19:46,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:19:46,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:19:46,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:19:46,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:19:46,820 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:19:46,820 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:19:46,820 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:19:46,820 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:19:46,820 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:19:46,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:19:46,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:19:46,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:19:46,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:19:46,820 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:19:46,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:19:46,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:19:46,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:19:46,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:19:46,820 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:19:46,820 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:19:46,820 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:19:46,821 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:19:46,821 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:19:46,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:19:46,821 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:19:46,821 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:19:46,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:19:46,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:19:46,821 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 -> 6ff1cedc7411bab7c4dff496b498f1be2a7af9e572a1448d390780005c75fec3 [2025-01-09 04:19:47,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:19:47,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:19:47,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:19:47,082 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:19:47,082 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:19:47,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2025-01-09 04:19:48,250 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59ebf265e/f102a743f1e941c694d91891d685ad85/FLAGbada2b602 [2025-01-09 04:19:48,580 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:19:48,581 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2025-01-09 04:19:48,588 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59ebf265e/f102a743f1e941c694d91891d685ad85/FLAGbada2b602 [2025-01-09 04:19:48,839 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59ebf265e/f102a743f1e941c694d91891d685ad85 [2025-01-09 04:19:48,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:19:48,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:19:48,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:19:48,844 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:19:48,847 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:19:48,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:19:48" (1/1) ... [2025-01-09 04:19:48,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52c1901a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:48, skipping insertion in model container [2025-01-09 04:19:48,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:19:48" (1/1) ... [2025-01-09 04:19:48,871 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:19:49,045 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_Triplicated.ufo.UNBOUNDED.pals.c[12106,12119] [2025-01-09 04:19:49,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:19:49,061 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:19:49,095 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_Triplicated.ufo.UNBOUNDED.pals.c[12106,12119] [2025-01-09 04:19:49,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:19:49,105 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:19:49,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:49 WrapperNode [2025-01-09 04:19:49,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:19:49,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:19:49,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:19:49,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:19:49,110 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:49" (1/1) ... [2025-01-09 04:19:49,117 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:49" (1/1) ... [2025-01-09 04:19:49,143 INFO L138 Inliner]: procedures = 28, calls = 51, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 418 [2025-01-09 04:19:49,143 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:19:49,144 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:19:49,144 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:19:49,144 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:19:49,150 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:49" (1/1) ... [2025-01-09 04:19:49,150 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:49" (1/1) ... [2025-01-09 04:19:49,153 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:49" (1/1) ... [2025-01-09 04:19:49,176 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:49,176 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:49" (1/1) ... [2025-01-09 04:19:49,176 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:49" (1/1) ... [2025-01-09 04:19:49,183 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:49" (1/1) ... [2025-01-09 04:19:49,187 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:49" (1/1) ... [2025-01-09 04:19:49,191 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:49" (1/1) ... [2025-01-09 04:19:49,195 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:49" (1/1) ... [2025-01-09 04:19:49,196 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:49" (1/1) ... [2025-01-09 04:19:49,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:19:49,201 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:19:49,201 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:19:49,201 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:19:49,202 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:49" (1/1) ... [2025-01-09 04:19:49,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:19:49,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:49,224 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:49,233 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:49,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:19:49,246 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2025-01-09 04:19:49,246 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2025-01-09 04:19:49,247 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-01-09 04:19:49,247 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-01-09 04:19:49,247 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2025-01-09 04:19:49,247 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2025-01-09 04:19:49,247 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2025-01-09 04:19:49,247 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2025-01-09 04:19:49,247 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2025-01-09 04:19:49,247 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2025-01-09 04:19:49,247 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 04:19:49,248 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 04:19:49,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:19:49,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:19:49,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:19:49,342 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:19:49,344 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:19:49,815 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2025-01-09 04:19:49,815 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:19:49,829 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:19:49,830 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 04:19:49,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:19:49 BoogieIcfgContainer [2025-01-09 04:19:49,832 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:19:49,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:19:49,834 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:19:49,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:19:49,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:19:48" (1/3) ... [2025-01-09 04:19:49,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455b50e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:19:49, skipping insertion in model container [2025-01-09 04:19:49,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:49" (2/3) ... [2025-01-09 04:19:49,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455b50e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:19:49, skipping insertion in model container [2025-01-09 04:19:49,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:19:49" (3/3) ... [2025-01-09 04:19:49,840 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2025-01-09 04:19:49,851 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:19:49,853 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c that has 7 procedures, 177 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 04:19:49,904 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:19:49,914 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;@641e8752, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:19:49,914 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:19:49,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 177 states, 132 states have (on average 1.5833333333333333) internal successors, (209), 137 states have internal predecessors, (209), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-09 04:19:49,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 04:19:49,927 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:49,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:49,928 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:49,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:49,931 INFO L85 PathProgramCache]: Analyzing trace with hash 782211551, now seen corresponding path program 1 times [2025-01-09 04:19:49,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:49,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302199102] [2025-01-09 04:19:49,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:49,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:50,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 04:19:50,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 04:19:50,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:50,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:50,172 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:50,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:50,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302199102] [2025-01-09 04:19:50,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302199102] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:50,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:50,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:50,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145152133] [2025-01-09 04:19:50,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:50,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:50,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:50,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:50,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:50,195 INFO L87 Difference]: Start difference. First operand has 177 states, 132 states have (on average 1.5833333333333333) internal successors, (209), 137 states have internal predecessors, (209), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:19:50,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:50,263 INFO L93 Difference]: Finished difference Result 354 states and 605 transitions. [2025-01-09 04:19:50,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:50,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-09 04:19:50,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:50,271 INFO L225 Difference]: With dead ends: 354 [2025-01-09 04:19:50,271 INFO L226 Difference]: Without dead ends: 180 [2025-01-09 04:19:50,277 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:50,281 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 7 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:50,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 806 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:50,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-01-09 04:19:50,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-01-09 04:19:50,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 135 states have (on average 1.5629629629629629) internal successors, (211), 139 states have internal predecessors, (211), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-09 04:19:50,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 285 transitions. [2025-01-09 04:19:50,320 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 285 transitions. Word has length 15 [2025-01-09 04:19:50,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:50,321 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 285 transitions. [2025-01-09 04:19:50,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:19:50,321 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 285 transitions. [2025-01-09 04:19:50,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 04:19:50,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:50,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:50,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:19:50,323 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:50,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:50,324 INFO L85 PathProgramCache]: Analyzing trace with hash 558034518, now seen corresponding path program 1 times [2025-01-09 04:19:50,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:50,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40671582] [2025-01-09 04:19:50,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:50,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:50,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 04:19:50,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 04:19:50,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:50,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:50,406 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:50,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:50,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40671582] [2025-01-09 04:19:50,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40671582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:50,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:50,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:50,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999409822] [2025-01-09 04:19:50,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:50,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:50,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:50,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:50,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:50,409 INFO L87 Difference]: Start difference. First operand 180 states and 285 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:19:50,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:50,475 INFO L93 Difference]: Finished difference Result 371 states and 591 transitions. [2025-01-09 04:19:50,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:50,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-09 04:19:50,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:50,480 INFO L225 Difference]: With dead ends: 371 [2025-01-09 04:19:50,480 INFO L226 Difference]: Without dead ends: 194 [2025-01-09 04:19:50,481 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:50,486 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 22 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:50,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 824 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:50,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-01-09 04:19:50,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2025-01-09 04:19:50,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 145 states have (on average 1.5448275862068965) internal successors, (224), 149 states have internal predecessors, (224), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 04:19:50,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 300 transitions. [2025-01-09 04:19:50,504 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 300 transitions. Word has length 16 [2025-01-09 04:19:50,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:50,504 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 300 transitions. [2025-01-09 04:19:50,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:19:50,504 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 300 transitions. [2025-01-09 04:19:50,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 04:19:50,505 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:50,505 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:50,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:19:50,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:50,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:50,506 INFO L85 PathProgramCache]: Analyzing trace with hash 338878784, now seen corresponding path program 1 times [2025-01-09 04:19:50,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:50,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070112480] [2025-01-09 04:19:50,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:50,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:50,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 04:19:50,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 04:19:50,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:50,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:19:50,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:50,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070112480] [2025-01-09 04:19:50,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070112480] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:50,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:50,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:19:50,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127115432] [2025-01-09 04:19:50,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:50,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:19:50,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:50,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:19:50,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:19:50,620 INFO L87 Difference]: Start difference. First operand 192 states and 300 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:19:50,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:50,647 INFO L93 Difference]: Finished difference Result 403 states and 637 transitions. [2025-01-09 04:19:50,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:19:50,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-01-09 04:19:50,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:50,649 INFO L225 Difference]: With dead ends: 403 [2025-01-09 04:19:50,649 INFO L226 Difference]: Without dead ends: 221 [2025-01-09 04:19:50,650 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:50,653 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 22 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:50,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 556 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:50,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-01-09 04:19:50,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 194. [2025-01-09 04:19:50,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 147 states have (on average 1.5374149659863945) internal successors, (226), 151 states have internal predecessors, (226), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 04:19:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 302 transitions. [2025-01-09 04:19:50,694 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 302 transitions. Word has length 23 [2025-01-09 04:19:50,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:50,696 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 302 transitions. [2025-01-09 04:19:50,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:19:50,696 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 302 transitions. [2025-01-09 04:19:50,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 04:19:50,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:50,697 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] [2025-01-09 04:19:50,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:19:50,697 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:50,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:50,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1076963512, now seen corresponding path program 1 times [2025-01-09 04:19:50,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:50,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002912086] [2025-01-09 04:19:50,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:50,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:50,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 04:19:50,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 04:19:50,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:50,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:50,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:19:50,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:50,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002912086] [2025-01-09 04:19:50,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002912086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:50,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:50,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:19:50,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244652778] [2025-01-09 04:19:50,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:50,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:19:50,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:50,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:19:50,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:50,809 INFO L87 Difference]: Start difference. First operand 194 states and 302 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:19:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:50,844 INFO L93 Difference]: Finished difference Result 379 states and 594 transitions. [2025-01-09 04:19:50,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:50,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-01-09 04:19:50,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:50,848 INFO L225 Difference]: With dead ends: 379 [2025-01-09 04:19:50,848 INFO L226 Difference]: Without dead ends: 200 [2025-01-09 04:19:50,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:50,850 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 0 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:50,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1098 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:50,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-01-09 04:19:50,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2025-01-09 04:19:50,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 150 states have (on average 1.5266666666666666) internal successors, (229), 154 states have internal predecessors, (229), 38 states have call successors, (38), 8 states have call predecessors, (38), 9 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2025-01-09 04:19:50,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 306 transitions. [2025-01-09 04:19:50,867 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 306 transitions. Word has length 32 [2025-01-09 04:19:50,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:50,867 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 306 transitions. [2025-01-09 04:19:50,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:19:50,868 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 306 transitions. [2025-01-09 04:19:50,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 04:19:50,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:50,870 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] [2025-01-09 04:19:50,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:19:50,870 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:50,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:50,870 INFO L85 PathProgramCache]: Analyzing trace with hash 260952747, now seen corresponding path program 1 times [2025-01-09 04:19:50,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:50,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175682624] [2025-01-09 04:19:50,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:50,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:50,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 04:19:50,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 04:19:50,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:50,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:50,957 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:19:50,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:50,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175682624] [2025-01-09 04:19:50,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175682624] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:50,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977065216] [2025-01-09 04:19:50,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:50,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:50,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:50,961 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:50,962 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:51,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 04:19:51,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 04:19:51,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:51,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:51,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 04:19:51,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:19:51,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:19:51,116 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:19:51,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977065216] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:19:51,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:19:51,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-09 04:19:51,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011784431] [2025-01-09 04:19:51,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:19:51,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:19:51,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:51,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:19:51,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:51,118 INFO L87 Difference]: Start difference. First operand 198 states and 306 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 04:19:51,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:51,180 INFO L93 Difference]: Finished difference Result 444 states and 700 transitions. [2025-01-09 04:19:51,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:51,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2025-01-09 04:19:51,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:51,185 INFO L225 Difference]: With dead ends: 444 [2025-01-09 04:19:51,185 INFO L226 Difference]: Without dead ends: 261 [2025-01-09 04:19:51,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:51,186 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 70 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:51,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1107 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:51,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-01-09 04:19:51,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 251. [2025-01-09 04:19:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 193 states have (on average 1.5025906735751295) internal successors, (290), 197 states have internal predecessors, (290), 48 states have call successors, (48), 8 states have call predecessors, (48), 9 states have return successors, (49), 49 states have call predecessors, (49), 48 states have call successors, (49) [2025-01-09 04:19:51,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 387 transitions. [2025-01-09 04:19:51,202 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 387 transitions. Word has length 34 [2025-01-09 04:19:51,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:51,203 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 387 transitions. [2025-01-09 04:19:51,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 04:19:51,203 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 387 transitions. [2025-01-09 04:19:51,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 04:19:51,204 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:51,204 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] [2025-01-09 04:19:51,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:19:51,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:51,405 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:51,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:51,406 INFO L85 PathProgramCache]: Analyzing trace with hash 524314478, now seen corresponding path program 1 times [2025-01-09 04:19:51,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:51,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990481321] [2025-01-09 04:19:51,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:51,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:51,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 04:19:51,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 04:19:51,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:51,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:51,524 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:51,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:51,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990481321] [2025-01-09 04:19:51,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990481321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:51,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:51,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:19:51,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10206722] [2025-01-09 04:19:51,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:51,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:19:51,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:51,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:19:51,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:51,526 INFO L87 Difference]: Start difference. First operand 251 states and 387 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:19:51,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:51,583 INFO L93 Difference]: Finished difference Result 396 states and 617 transitions. [2025-01-09 04:19:51,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:19:51,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2025-01-09 04:19:51,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:51,585 INFO L225 Difference]: With dead ends: 396 [2025-01-09 04:19:51,585 INFO L226 Difference]: Without dead ends: 247 [2025-01-09 04:19:51,585 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:51,586 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 0 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:51,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1335 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:51,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-01-09 04:19:51,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2025-01-09 04:19:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 190 states have (on average 1.4736842105263157) internal successors, (280), 194 states have internal predecessors, (280), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 04:19:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 376 transitions. [2025-01-09 04:19:51,599 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 376 transitions. Word has length 35 [2025-01-09 04:19:51,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:51,599 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 376 transitions. [2025-01-09 04:19:51,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:19:51,599 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 376 transitions. [2025-01-09 04:19:51,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 04:19:51,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:51,600 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:51,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:19:51,600 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:51,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:51,601 INFO L85 PathProgramCache]: Analyzing trace with hash 465411979, now seen corresponding path program 2 times [2025-01-09 04:19:51,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:51,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533699790] [2025-01-09 04:19:51,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:19:51,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:51,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-01-09 04:19:51,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 56 statements. [2025-01-09 04:19:51,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 04:19:51,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:51,633 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 04:19:51,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:51,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533699790] [2025-01-09 04:19:51,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533699790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:51,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:51,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:51,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246338539] [2025-01-09 04:19:51,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:51,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:51,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:51,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:51,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:51,635 INFO L87 Difference]: Start difference. First operand 247 states and 376 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:19:51,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:51,670 INFO L93 Difference]: Finished difference Result 473 states and 737 transitions. [2025-01-09 04:19:51,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:51,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2025-01-09 04:19:51,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:51,672 INFO L225 Difference]: With dead ends: 473 [2025-01-09 04:19:51,674 INFO L226 Difference]: Without dead ends: 254 [2025-01-09 04:19:51,675 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:51,676 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 8 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:51,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 796 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:51,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-01-09 04:19:51,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2025-01-09 04:19:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 196 states have (on average 1.469387755102041) internal successors, (288), 200 states have internal predecessors, (288), 48 states have call successors, (48), 9 states have call predecessors, (48), 9 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 04:19:51,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2025-01-09 04:19:51,688 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 56 [2025-01-09 04:19:51,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:51,689 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2025-01-09 04:19:51,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:19:51,689 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2025-01-09 04:19:51,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 04:19:51,689 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:51,690 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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:51,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:19:51,690 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:51,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:51,690 INFO L85 PathProgramCache]: Analyzing trace with hash -2075844134, now seen corresponding path program 1 times [2025-01-09 04:19:51,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:51,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452346508] [2025-01-09 04:19:51,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:51,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:51,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 04:19:51,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 04:19:51,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:51,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:51,739 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 04:19:51,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:51,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452346508] [2025-01-09 04:19:51,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452346508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:51,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:51,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:51,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618492951] [2025-01-09 04:19:51,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:51,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:51,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:51,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:51,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:51,740 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:19:51,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:51,786 INFO L93 Difference]: Finished difference Result 517 states and 793 transitions. [2025-01-09 04:19:51,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:51,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2025-01-09 04:19:51,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:51,792 INFO L225 Difference]: With dead ends: 517 [2025-01-09 04:19:51,792 INFO L226 Difference]: Without dead ends: 291 [2025-01-09 04:19:51,793 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:51,793 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 22 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:51,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 811 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:51,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-01-09 04:19:51,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2025-01-09 04:19:51,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 227 states have (on average 1.4273127753303965) internal successors, (324), 231 states have internal predecessors, (324), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 04:19:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 426 transitions. [2025-01-09 04:19:51,808 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 426 transitions. Word has length 56 [2025-01-09 04:19:51,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:51,808 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 426 transitions. [2025-01-09 04:19:51,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:19:51,808 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 426 transitions. [2025-01-09 04:19:51,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 04:19:51,813 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:51,813 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 04:19:51,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:19:51,813 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:51,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:51,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1492472089, now seen corresponding path program 1 times [2025-01-09 04:19:51,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:51,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63184586] [2025-01-09 04:19:51,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:51,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:51,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 04:19:51,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 04:19:51,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:51,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:51,934 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-09 04:19:51,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:51,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63184586] [2025-01-09 04:19:51,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63184586] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:51,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:51,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:19:51,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783044697] [2025-01-09 04:19:51,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:51,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:19:51,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:51,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:19:51,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:51,935 INFO L87 Difference]: Start difference. First operand 289 states and 426 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 04:19:51,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:51,962 INFO L93 Difference]: Finished difference Result 529 states and 793 transitions. [2025-01-09 04:19:51,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:51,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 74 [2025-01-09 04:19:51,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:51,966 INFO L225 Difference]: With dead ends: 529 [2025-01-09 04:19:51,966 INFO L226 Difference]: Without dead ends: 291 [2025-01-09 04:19:51,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:51,968 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 0 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:51,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1085 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:51,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-01-09 04:19:51,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2025-01-09 04:19:51,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 227 states have (on average 1.4140969162995596) internal successors, (321), 231 states have internal predecessors, (321), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 04:19:51,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 423 transitions. [2025-01-09 04:19:51,986 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 423 transitions. Word has length 74 [2025-01-09 04:19:51,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:51,986 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 423 transitions. [2025-01-09 04:19:51,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 04:19:51,986 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 423 transitions. [2025-01-09 04:19:51,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 04:19:51,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:51,987 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:51,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:19:51,987 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:51,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:51,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1229064266, now seen corresponding path program 1 times [2025-01-09 04:19:51,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:51,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487500757] [2025-01-09 04:19:51,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:51,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:51,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 04:19:52,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 04:19:52,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:52,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:52,120 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-01-09 04:19:52,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:52,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487500757] [2025-01-09 04:19:52,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487500757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:52,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:52,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:52,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338519524] [2025-01-09 04:19:52,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:52,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:52,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:52,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:52,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:52,122 INFO L87 Difference]: Start difference. First operand 289 states and 423 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 04:19:52,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:52,163 INFO L93 Difference]: Finished difference Result 564 states and 847 transitions. [2025-01-09 04:19:52,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:52,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 102 [2025-01-09 04:19:52,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:52,166 INFO L225 Difference]: With dead ends: 564 [2025-01-09 04:19:52,166 INFO L226 Difference]: Without dead ends: 331 [2025-01-09 04:19:52,167 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:52,167 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 23 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:52,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 811 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:52,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-01-09 04:19:52,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2025-01-09 04:19:52,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 263 states have (on average 1.376425855513308) internal successors, (362), 267 states have internal predecessors, (362), 54 states have call successors, (54), 11 states have call predecessors, (54), 11 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 04:19:52,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 470 transitions. [2025-01-09 04:19:52,187 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 470 transitions. Word has length 102 [2025-01-09 04:19:52,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:52,187 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 470 transitions. [2025-01-09 04:19:52,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 04:19:52,187 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 470 transitions. [2025-01-09 04:19:52,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 04:19:52,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:52,191 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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:52,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:19:52,191 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:52,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:52,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1906531795, now seen corresponding path program 1 times [2025-01-09 04:19:52,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:52,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87052563] [2025-01-09 04:19:52,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:52,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:52,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 04:19:52,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 04:19:52,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:52,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:52,276 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-01-09 04:19:52,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:52,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87052563] [2025-01-09 04:19:52,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87052563] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:52,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:52,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:52,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089918908] [2025-01-09 04:19:52,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:52,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:52,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:52,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:52,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:52,277 INFO L87 Difference]: Start difference. First operand 329 states and 470 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 04:19:52,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:52,320 INFO L93 Difference]: Finished difference Result 590 states and 867 transitions. [2025-01-09 04:19:52,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:52,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 103 [2025-01-09 04:19:52,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:52,322 INFO L225 Difference]: With dead ends: 590 [2025-01-09 04:19:52,322 INFO L226 Difference]: Without dead ends: 323 [2025-01-09 04:19:52,323 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:52,324 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 9 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:52,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 779 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:52,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-01-09 04:19:52,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2025-01-09 04:19:52,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 258 states have (on average 1.3565891472868217) internal successors, (350), 262 states have internal predecessors, (350), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-01-09 04:19:52,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 456 transitions. [2025-01-09 04:19:52,339 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 456 transitions. Word has length 103 [2025-01-09 04:19:52,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:52,340 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 456 transitions. [2025-01-09 04:19:52,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 04:19:52,340 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 456 transitions. [2025-01-09 04:19:52,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 04:19:52,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:52,341 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 04:19:52,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:19:52,341 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:52,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:52,341 INFO L85 PathProgramCache]: Analyzing trace with hash 641938803, now seen corresponding path program 1 times [2025-01-09 04:19:52,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:52,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994582351] [2025-01-09 04:19:52,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:52,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:52,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 04:19:52,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 04:19:52,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:52,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:52,438 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2025-01-09 04:19:52,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:52,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994582351] [2025-01-09 04:19:52,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994582351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:52,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:52,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:19:52,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663985832] [2025-01-09 04:19:52,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:52,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:19:52,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:52,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:19:52,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:52,440 INFO L87 Difference]: Start difference. First operand 323 states and 456 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 04:19:52,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:52,470 INFO L93 Difference]: Finished difference Result 566 states and 817 transitions. [2025-01-09 04:19:52,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:52,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 122 [2025-01-09 04:19:52,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:52,472 INFO L225 Difference]: With dead ends: 566 [2025-01-09 04:19:52,472 INFO L226 Difference]: Without dead ends: 325 [2025-01-09 04:19:52,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:52,474 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 0 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:52,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1069 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:52,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-01-09 04:19:52,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2025-01-09 04:19:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 258 states have (on average 1.3449612403100775) internal successors, (347), 262 states have internal predecessors, (347), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-01-09 04:19:52,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 453 transitions. [2025-01-09 04:19:52,488 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 453 transitions. Word has length 122 [2025-01-09 04:19:52,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:52,489 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 453 transitions. [2025-01-09 04:19:52,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 04:19:52,489 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 453 transitions. [2025-01-09 04:19:52,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 04:19:52,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:52,490 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:52,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:19:52,490 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:52,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:52,491 INFO L85 PathProgramCache]: Analyzing trace with hash 504834902, now seen corresponding path program 1 times [2025-01-09 04:19:52,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:52,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544581055] [2025-01-09 04:19:52,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:52,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:52,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 04:19:52,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 04:19:52,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:52,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-01-09 04:19:52,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:52,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544581055] [2025-01-09 04:19:52,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544581055] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:52,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:52,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:52,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314364760] [2025-01-09 04:19:52,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:52,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:52,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:52,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:52,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:52,588 INFO L87 Difference]: Start difference. First operand 323 states and 453 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 04:19:52,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:52,642 INFO L93 Difference]: Finished difference Result 529 states and 777 transitions. [2025-01-09 04:19:52,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:52,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 154 [2025-01-09 04:19:52,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:52,645 INFO L225 Difference]: With dead ends: 529 [2025-01-09 04:19:52,645 INFO L226 Difference]: Without dead ends: 321 [2025-01-09 04:19:52,646 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:52,647 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 7 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:52,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 747 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:52,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-01-09 04:19:52,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2025-01-09 04:19:52,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 257 states have (on average 1.3424124513618676) internal successors, (345), 261 states have internal predecessors, (345), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 04:19:52,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 449 transitions. [2025-01-09 04:19:52,691 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 449 transitions. Word has length 154 [2025-01-09 04:19:52,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:52,691 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 449 transitions. [2025-01-09 04:19:52,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 04:19:52,691 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 449 transitions. [2025-01-09 04:19:52,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 04:19:52,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:52,693 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:19:52,693 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:52,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:52,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1643839733, now seen corresponding path program 1 times [2025-01-09 04:19:52,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:52,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517864114] [2025-01-09 04:19:52,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:52,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:52,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 04:19:52,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 04:19:52,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:52,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:52,803 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2025-01-09 04:19:52,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:52,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517864114] [2025-01-09 04:19:52,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517864114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:52,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:52,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:52,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352736490] [2025-01-09 04:19:52,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:52,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:52,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:52,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:52,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:52,805 INFO L87 Difference]: Start difference. First operand 321 states and 449 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:19:52,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:52,859 INFO L93 Difference]: Finished difference Result 469 states and 673 transitions. [2025-01-09 04:19:52,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:52,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 173 [2025-01-09 04:19:52,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:52,864 INFO L225 Difference]: With dead ends: 469 [2025-01-09 04:19:52,864 INFO L226 Difference]: Without dead ends: 304 [2025-01-09 04:19:52,865 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:52,865 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 32 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:52,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 724 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:52,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-01-09 04:19:52,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2025-01-09 04:19:52,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 243 states have (on average 1.3333333333333333) internal successors, (324), 247 states have internal predecessors, (324), 49 states have call successors, (49), 11 states have call predecessors, (49), 11 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 04:19:52,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2025-01-09 04:19:52,877 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 173 [2025-01-09 04:19:52,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:52,877 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2025-01-09 04:19:52,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:19:52,877 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2025-01-09 04:19:52,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 04:19:52,879 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:52,879 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:19:52,880 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:52,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:52,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1513841690, now seen corresponding path program 1 times [2025-01-09 04:19:52,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:52,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286063632] [2025-01-09 04:19:52,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:52,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:52,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 04:19:52,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 04:19:52,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:52,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:52,980 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2025-01-09 04:19:52,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:52,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286063632] [2025-01-09 04:19:52,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286063632] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:52,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:52,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:52,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348701662] [2025-01-09 04:19:52,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:52,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:52,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:52,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:52,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:52,981 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:19:53,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:53,029 INFO L93 Difference]: Finished difference Result 452 states and 646 transitions. [2025-01-09 04:19:53,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:53,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 175 [2025-01-09 04:19:53,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:53,031 INFO L225 Difference]: With dead ends: 452 [2025-01-09 04:19:53,031 INFO L226 Difference]: Without dead ends: 285 [2025-01-09 04:19:53,031 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:53,032 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 28 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:53,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 727 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:53,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-01-09 04:19:53,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2025-01-09 04:19:53,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 227 states have (on average 1.3259911894273129) internal successors, (301), 231 states have internal predecessors, (301), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 04:19:53,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 393 transitions. [2025-01-09 04:19:53,041 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 393 transitions. Word has length 175 [2025-01-09 04:19:53,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:53,042 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 393 transitions. [2025-01-09 04:19:53,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:19:53,042 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 393 transitions. [2025-01-09 04:19:53,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 04:19:53,043 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:53,043 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:19:53,043 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:53,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:53,044 INFO L85 PathProgramCache]: Analyzing trace with hash -124889847, now seen corresponding path program 1 times [2025-01-09 04:19:53,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:53,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044222181] [2025-01-09 04:19:53,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:53,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:53,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 04:19:53,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 04:19:53,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:53,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-01-09 04:19:53,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:53,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044222181] [2025-01-09 04:19:53,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044222181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:53,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:53,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:19:53,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174467537] [2025-01-09 04:19:53,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:53,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:19:53,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:53,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:19:53,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:53,174 INFO L87 Difference]: Start difference. First operand 285 states and 393 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 04:19:53,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:53,195 INFO L93 Difference]: Finished difference Result 433 states and 617 transitions. [2025-01-09 04:19:53,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:53,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 176 [2025-01-09 04:19:53,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:53,198 INFO L225 Difference]: With dead ends: 433 [2025-01-09 04:19:53,198 INFO L226 Difference]: Without dead ends: 285 [2025-01-09 04:19:53,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:53,198 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 0 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:53,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1047 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:53,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-01-09 04:19:53,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2025-01-09 04:19:53,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 227 states have (on average 1.2995594713656389) internal successors, (295), 231 states have internal predecessors, (295), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 04:19:53,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 387 transitions. [2025-01-09 04:19:53,208 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 387 transitions. Word has length 176 [2025-01-09 04:19:53,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:53,209 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 387 transitions. [2025-01-09 04:19:53,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 04:19:53,209 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 387 transitions. [2025-01-09 04:19:53,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 04:19:53,210 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:53,210 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:19:53,210 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:53,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:53,211 INFO L85 PathProgramCache]: Analyzing trace with hash -51893721, now seen corresponding path program 1 times [2025-01-09 04:19:53,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:53,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374476763] [2025-01-09 04:19:53,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:53,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:53,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 04:19:53,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 04:19:53,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:53,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:53,290 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 135 proven. 11 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-01-09 04:19:53,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:53,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374476763] [2025-01-09 04:19:53,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374476763] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:53,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895024830] [2025-01-09 04:19:53,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:53,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:53,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:53,293 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:53,294 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:53,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 04:19:53,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 04:19:53,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:53,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:53,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:19:53,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:53,463 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 135 proven. 11 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-01-09 04:19:53,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:19:53,590 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-01-09 04:19:53,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895024830] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:53,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 04:19:53,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2025-01-09 04:19:53,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715952748] [2025-01-09 04:19:53,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:53,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:53,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:53,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:53,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:53,593 INFO L87 Difference]: Start difference. First operand 285 states and 387 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:19:53,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:53,628 INFO L93 Difference]: Finished difference Result 453 states and 638 transitions. [2025-01-09 04:19:53,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:53,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 182 [2025-01-09 04:19:53,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:53,630 INFO L225 Difference]: With dead ends: 453 [2025-01-09 04:19:53,630 INFO L226 Difference]: Without dead ends: 264 [2025-01-09 04:19:53,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 363 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:53,631 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 19 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:53,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 727 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:53,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-01-09 04:19:53,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2025-01-09 04:19:53,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 209 states have (on average 1.291866028708134) internal successors, (270), 213 states have internal predecessors, (270), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-01-09 04:19:53,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 356 transitions. [2025-01-09 04:19:53,643 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 356 transitions. Word has length 182 [2025-01-09 04:19:53,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:53,644 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 356 transitions. [2025-01-09 04:19:53,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:19:53,644 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 356 transitions. [2025-01-09 04:19:53,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 04:19:53,645 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:53,645 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,652 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:53,846 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,SelfDestructingSolverStorable16 [2025-01-09 04:19:53,846 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:53,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:53,847 INFO L85 PathProgramCache]: Analyzing trace with hash -228374060, now seen corresponding path program 1 times [2025-01-09 04:19:53,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:53,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647744160] [2025-01-09 04:19:53,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:53,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:53,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 04:19:53,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 04:19:53,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:53,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:53,960 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2025-01-09 04:19:53,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:53,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647744160] [2025-01-09 04:19:53,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647744160] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:53,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:53,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:53,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752872864] [2025-01-09 04:19:53,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:53,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:53,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:53,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:53,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:53,962 INFO L87 Difference]: Start difference. First operand 264 states and 356 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 04:19:53,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:53,993 INFO L93 Difference]: Finished difference Result 409 states and 577 transitions. [2025-01-09 04:19:53,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:53,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 206 [2025-01-09 04:19:53,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:53,996 INFO L225 Difference]: With dead ends: 409 [2025-01-09 04:19:53,996 INFO L226 Difference]: Without dead ends: 268 [2025-01-09 04:19:53,996 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:53,997 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 3 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:53,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 767 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:53,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-01-09 04:19:54,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-01-09 04:19:54,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 212 states have (on average 1.2877358490566038) internal successors, (273), 216 states have internal predecessors, (273), 43 states have call successors, (43), 12 states have call predecessors, (43), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-01-09 04:19:54,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 359 transitions. [2025-01-09 04:19:54,008 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 359 transitions. Word has length 206 [2025-01-09 04:19:54,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:54,010 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 359 transitions. [2025-01-09 04:19:54,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 04:19:54,011 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 359 transitions. [2025-01-09 04:19:54,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-09 04:19:54,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:54,012 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 04:19:54,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:19:54,013 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:54,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:54,013 INFO L85 PathProgramCache]: Analyzing trace with hash 39158361, now seen corresponding path program 1 times [2025-01-09 04:19:54,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:54,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853244279] [2025-01-09 04:19:54,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:54,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:54,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 04:19:54,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 04:19:54,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:54,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:54,112 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2025-01-09 04:19:54,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:54,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853244279] [2025-01-09 04:19:54,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853244279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:54,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:54,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:54,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925897985] [2025-01-09 04:19:54,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:54,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:54,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:54,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:54,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:54,115 INFO L87 Difference]: Start difference. First operand 268 states and 359 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 04:19:54,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:54,146 INFO L93 Difference]: Finished difference Result 418 states and 585 transitions. [2025-01-09 04:19:54,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:54,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 213 [2025-01-09 04:19:54,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:54,149 INFO L225 Difference]: With dead ends: 418 [2025-01-09 04:19:54,149 INFO L226 Difference]: Without dead ends: 273 [2025-01-09 04:19:54,149 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:54,150 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 4 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:54,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 769 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:54,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-01-09 04:19:54,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2025-01-09 04:19:54,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 216 states have (on average 1.2824074074074074) internal successors, (277), 220 states have internal predecessors, (277), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-01-09 04:19:54,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 363 transitions. [2025-01-09 04:19:54,160 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 363 transitions. Word has length 213 [2025-01-09 04:19:54,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:54,161 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 363 transitions. [2025-01-09 04:19:54,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 04:19:54,162 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 363 transitions. [2025-01-09 04:19:54,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-01-09 04:19:54,164 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:54,165 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:54,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:19:54,165 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:54,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:54,166 INFO L85 PathProgramCache]: Analyzing trace with hash 214459989, now seen corresponding path program 1 times [2025-01-09 04:19:54,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:54,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461147526] [2025-01-09 04:19:54,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:54,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:54,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 04:19:54,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 04:19:54,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:54,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:54,273 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-01-09 04:19:54,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:54,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461147526] [2025-01-09 04:19:54,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461147526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:54,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:54,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:54,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190260447] [2025-01-09 04:19:54,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:54,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:54,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:54,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:54,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:54,274 INFO L87 Difference]: Start difference. First operand 273 states and 363 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 04:19:54,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:54,304 INFO L93 Difference]: Finished difference Result 422 states and 585 transitions. [2025-01-09 04:19:54,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:54,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 221 [2025-01-09 04:19:54,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:54,307 INFO L225 Difference]: With dead ends: 422 [2025-01-09 04:19:54,307 INFO L226 Difference]: Without dead ends: 272 [2025-01-09 04:19:54,307 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:54,309 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 5 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:54,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 759 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:54,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-01-09 04:19:54,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2025-01-09 04:19:54,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 216 states have (on average 1.2685185185185186) internal successors, (274), 219 states have internal predecessors, (274), 42 states have call successors, (42), 13 states have call predecessors, (42), 13 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 04:19:54,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 358 transitions. [2025-01-09 04:19:54,335 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 358 transitions. Word has length 221 [2025-01-09 04:19:54,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:54,335 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 358 transitions. [2025-01-09 04:19:54,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 04:19:54,335 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 358 transitions. [2025-01-09 04:19:54,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 04:19:54,338 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:54,338 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:54,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:19:54,338 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:54,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:54,338 INFO L85 PathProgramCache]: Analyzing trace with hash -182827915, now seen corresponding path program 1 times [2025-01-09 04:19:54,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:54,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117966704] [2025-01-09 04:19:54,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:54,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:54,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 04:19:54,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 04:19:54,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:54,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:54,457 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2025-01-09 04:19:54,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:54,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117966704] [2025-01-09 04:19:54,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117966704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:54,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:54,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:19:54,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600122685] [2025-01-09 04:19:54,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:54,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:19:54,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:54,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:19:54,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:19:54,462 INFO L87 Difference]: Start difference. First operand 272 states and 358 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 04:19:54,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:54,476 INFO L93 Difference]: Finished difference Result 420 states and 574 transitions. [2025-01-09 04:19:54,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:19:54,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 229 [2025-01-09 04:19:54,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:54,479 INFO L225 Difference]: With dead ends: 420 [2025-01-09 04:19:54,479 INFO L226 Difference]: Without dead ends: 271 [2025-01-09 04:19:54,480 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:54,480 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 0 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:54,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 506 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:54,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-01-09 04:19:54,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-01-09 04:19:54,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 216 states have (on average 1.2638888888888888) internal successors, (273), 218 states have internal predecessors, (273), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 04:19:54,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 355 transitions. [2025-01-09 04:19:54,493 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 355 transitions. Word has length 229 [2025-01-09 04:19:54,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:54,494 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 355 transitions. [2025-01-09 04:19:54,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 04:19:54,494 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 355 transitions. [2025-01-09 04:19:54,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-01-09 04:19:54,496 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:54,496 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:54,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:19:54,496 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:54,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:54,497 INFO L85 PathProgramCache]: Analyzing trace with hash -12130940, now seen corresponding path program 1 times [2025-01-09 04:19:54,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:54,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215981291] [2025-01-09 04:19:54,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:54,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:54,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-01-09 04:19:54,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-01-09 04:19:54,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:54,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:54,739 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2025-01-09 04:19:54,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:54,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215981291] [2025-01-09 04:19:54,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215981291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:54,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:54,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:54,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776427682] [2025-01-09 04:19:54,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:54,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:54,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:54,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:54,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:54,741 INFO L87 Difference]: Start difference. First operand 271 states and 355 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 04:19:54,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:54,810 INFO L93 Difference]: Finished difference Result 632 states and 855 transitions. [2025-01-09 04:19:54,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:54,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 231 [2025-01-09 04:19:54,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:54,813 INFO L225 Difference]: With dead ends: 632 [2025-01-09 04:19:54,813 INFO L226 Difference]: Without dead ends: 484 [2025-01-09 04:19:54,813 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:54,814 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 329 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:54,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 719 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:54,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-01-09 04:19:54,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 478. [2025-01-09 04:19:54,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 376 states have (on average 1.3138297872340425) internal successors, (494), 378 states have internal predecessors, (494), 70 states have call successors, (70), 31 states have call predecessors, (70), 31 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 04:19:54,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 634 transitions. [2025-01-09 04:19:54,832 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 634 transitions. Word has length 231 [2025-01-09 04:19:54,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:54,832 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 634 transitions. [2025-01-09 04:19:54,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 04:19:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 634 transitions. [2025-01-09 04:19:54,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-01-09 04:19:54,834 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:54,834 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:54,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:19:54,835 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:54,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:54,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1509693784, now seen corresponding path program 1 times [2025-01-09 04:19:54,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:54,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085286150] [2025-01-09 04:19:54,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:54,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:54,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-01-09 04:19:54,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-01-09 04:19:54,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:54,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:54,989 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-01-09 04:19:54,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:54,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085286150] [2025-01-09 04:19:54,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085286150] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:54,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:54,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:19:54,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838184456] [2025-01-09 04:19:54,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:54,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:19:54,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:54,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:19:54,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:19:54,990 INFO L87 Difference]: Start difference. First operand 478 states and 634 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 04:19:55,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:55,030 INFO L93 Difference]: Finished difference Result 1051 states and 1444 transitions. [2025-01-09 04:19:55,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:19:55,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 263 [2025-01-09 04:19:55,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:55,035 INFO L225 Difference]: With dead ends: 1051 [2025-01-09 04:19:55,035 INFO L226 Difference]: Without dead ends: 768 [2025-01-09 04:19:55,036 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:55,036 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 176 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:55,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 529 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:55,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-01-09 04:19:55,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 599. [2025-01-09 04:19:55,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 472 states have (on average 1.3220338983050848) internal successors, (624), 478 states have internal predecessors, (624), 85 states have call successors, (85), 41 states have call predecessors, (85), 41 states have return successors, (85), 81 states have call predecessors, (85), 85 states have call successors, (85) [2025-01-09 04:19:55,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 794 transitions. [2025-01-09 04:19:55,063 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 794 transitions. Word has length 263 [2025-01-09 04:19:55,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:55,063 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 794 transitions. [2025-01-09 04:19:55,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 04:19:55,064 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 794 transitions. [2025-01-09 04:19:55,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-01-09 04:19:55,065 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:55,065 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:55,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:19:55,066 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:55,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:55,066 INFO L85 PathProgramCache]: Analyzing trace with hash 2118318711, now seen corresponding path program 1 times [2025-01-09 04:19:55,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:55,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961039933] [2025-01-09 04:19:55,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:55,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:55,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-01-09 04:19:55,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-01-09 04:19:55,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:55,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-01-09 04:19:55,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:55,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961039933] [2025-01-09 04:19:55,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961039933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:55,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:55,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:19:55,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233953961] [2025-01-09 04:19:55,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:55,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:19:55,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:55,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:19:55,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:19:55,155 INFO L87 Difference]: Start difference. First operand 599 states and 794 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 04:19:55,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:55,199 INFO L93 Difference]: Finished difference Result 1331 states and 1814 transitions. [2025-01-09 04:19:55,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:19:55,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 264 [2025-01-09 04:19:55,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:55,204 INFO L225 Difference]: With dead ends: 1331 [2025-01-09 04:19:55,204 INFO L226 Difference]: Without dead ends: 960 [2025-01-09 04:19:55,205 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:55,205 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 178 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:55,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 547 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:55,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2025-01-09 04:19:55,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 952. [2025-01-09 04:19:55,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 745 states have (on average 1.348993288590604) internal successors, (1005), 759 states have internal predecessors, (1005), 139 states have call successors, (139), 67 states have call predecessors, (139), 67 states have return successors, (139), 129 states have call predecessors, (139), 139 states have call successors, (139) [2025-01-09 04:19:55,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1283 transitions. [2025-01-09 04:19:55,250 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1283 transitions. Word has length 264 [2025-01-09 04:19:55,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:55,250 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1283 transitions. [2025-01-09 04:19:55,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 04:19:55,250 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1283 transitions. [2025-01-09 04:19:55,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-01-09 04:19:55,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:55,252 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:55,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:19:55,253 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:55,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:55,253 INFO L85 PathProgramCache]: Analyzing trace with hash 672421651, now seen corresponding path program 1 times [2025-01-09 04:19:55,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:55,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914609348] [2025-01-09 04:19:55,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:55,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:55,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-01-09 04:19:55,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-01-09 04:19:55,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:55,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:55,336 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-01-09 04:19:55,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:55,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914609348] [2025-01-09 04:19:55,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914609348] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:55,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:55,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:19:55,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530617555] [2025-01-09 04:19:55,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:55,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:19:55,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:55,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:19:55,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:19:55,337 INFO L87 Difference]: Start difference. First operand 952 states and 1283 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 04:19:55,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:55,410 INFO L93 Difference]: Finished difference Result 2228 states and 3077 transitions. [2025-01-09 04:19:55,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:19:55,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 265 [2025-01-09 04:19:55,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:55,422 INFO L225 Difference]: With dead ends: 2228 [2025-01-09 04:19:55,423 INFO L226 Difference]: Without dead ends: 1544 [2025-01-09 04:19:55,424 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:55,425 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 179 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:55,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 564 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:55,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2025-01-09 04:19:55,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1530. [2025-01-09 04:19:55,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 1191 states have (on average 1.3744752308984047) internal successors, (1637), 1219 states have internal predecessors, (1637), 231 states have call successors, (231), 107 states have call predecessors, (231), 107 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2025-01-09 04:19:55,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 2099 transitions. [2025-01-09 04:19:55,530 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 2099 transitions. Word has length 265 [2025-01-09 04:19:55,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:55,530 INFO L471 AbstractCegarLoop]: Abstraction has 1530 states and 2099 transitions. [2025-01-09 04:19:55,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 04:19:55,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 2099 transitions. [2025-01-09 04:19:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-01-09 04:19:55,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:55,533 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:55,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:19:55,534 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:55,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:55,534 INFO L85 PathProgramCache]: Analyzing trace with hash 278054865, now seen corresponding path program 1 times [2025-01-09 04:19:55,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:55,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112621687] [2025-01-09 04:19:55,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:55,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:55,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-01-09 04:19:55,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-01-09 04:19:55,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:55,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:55,710 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2025-01-09 04:19:55,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:55,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112621687] [2025-01-09 04:19:55,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112621687] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:55,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465111394] [2025-01-09 04:19:55,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:55,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:55,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:55,713 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:55,714 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:55,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-01-09 04:19:55,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-01-09 04:19:55,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:55,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:55,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 04:19:55,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:55,926 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2025-01-09 04:19:55,927 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:55,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465111394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:55,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:55,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-01-09 04:19:55,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157534546] [2025-01-09 04:19:55,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:55,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:55,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:55,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:55,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:19:55,928 INFO L87 Difference]: Start difference. First operand 1530 states and 2099 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 04:19:56,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:56,037 INFO L93 Difference]: Finished difference Result 2832 states and 3942 transitions. [2025-01-09 04:19:56,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:56,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 265 [2025-01-09 04:19:56,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:56,046 INFO L225 Difference]: With dead ends: 2832 [2025-01-09 04:19:56,046 INFO L226 Difference]: Without dead ends: 1530 [2025-01-09 04:19:56,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:19:56,050 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 31 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:56,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 694 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:56,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2025-01-09 04:19:56,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1530. [2025-01-09 04:19:56,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 1191 states have (on average 1.3543240973971453) internal successors, (1613), 1219 states have internal predecessors, (1613), 231 states have call successors, (231), 107 states have call predecessors, (231), 107 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2025-01-09 04:19:56,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 2075 transitions. [2025-01-09 04:19:56,154 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 2075 transitions. Word has length 265 [2025-01-09 04:19:56,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:56,154 INFO L471 AbstractCegarLoop]: Abstraction has 1530 states and 2075 transitions. [2025-01-09 04:19:56,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 04:19:56,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 2075 transitions. [2025-01-09 04:19:56,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-01-09 04:19:56,157 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:56,157 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:56,164 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:56,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:56,358 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:56,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:56,359 INFO L85 PathProgramCache]: Analyzing trace with hash -2120634176, now seen corresponding path program 1 times [2025-01-09 04:19:56,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:56,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730189023] [2025-01-09 04:19:56,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:56,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:56,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-01-09 04:19:56,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-01-09 04:19:56,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:56,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:56,532 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-01-09 04:19:56,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:56,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730189023] [2025-01-09 04:19:56,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730189023] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:56,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149951424] [2025-01-09 04:19:56,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:56,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:56,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:56,534 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:56,535 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:56,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-01-09 04:19:56,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-01-09 04:19:56,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:56,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:56,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 950 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 04:19:56,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:56,744 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2025-01-09 04:19:56,744 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:56,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149951424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:56,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:56,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-01-09 04:19:56,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196076445] [2025-01-09 04:19:56,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:56,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:56,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:56,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:56,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:19:56,746 INFO L87 Difference]: Start difference. First operand 1530 states and 2075 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 04:19:56,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:56,846 INFO L93 Difference]: Finished difference Result 2832 states and 3886 transitions. [2025-01-09 04:19:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:56,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 266 [2025-01-09 04:19:56,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:56,854 INFO L225 Difference]: With dead ends: 2832 [2025-01-09 04:19:56,854 INFO L226 Difference]: Without dead ends: 1578 [2025-01-09 04:19:56,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:19:56,857 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 7 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:56,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 702 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:56,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2025-01-09 04:19:56,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1578. [2025-01-09 04:19:56,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1231 states have (on average 1.3558082859463851) internal successors, (1669), 1259 states have internal predecessors, (1669), 231 states have call successors, (231), 115 states have call predecessors, (231), 115 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2025-01-09 04:19:56,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2131 transitions. [2025-01-09 04:19:56,953 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2131 transitions. Word has length 266 [2025-01-09 04:19:56,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:56,954 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2131 transitions. [2025-01-09 04:19:56,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 04:19:56,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2131 transitions. [2025-01-09 04:19:56,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-01-09 04:19:56,957 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:56,957 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:56,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 04:19:57,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-01-09 04:19:57,161 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:57,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:57,162 INFO L85 PathProgramCache]: Analyzing trace with hash -150873109, now seen corresponding path program 1 times [2025-01-09 04:19:57,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:57,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939177371] [2025-01-09 04:19:57,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:57,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:57,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-01-09 04:19:57,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-01-09 04:19:57,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:57,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:57,789 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-01-09 04:19:57,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:57,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939177371] [2025-01-09 04:19:57,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939177371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:57,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:57,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:19:57,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124148134] [2025-01-09 04:19:57,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:57,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:19:57,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:57,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:19:57,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:57,791 INFO L87 Difference]: Start difference. First operand 1578 states and 2131 transitions. Second operand has 6 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 04:19:57,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:57,957 INFO L93 Difference]: Finished difference Result 2416 states and 3494 transitions. [2025-01-09 04:19:57,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:19:57,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 267 [2025-01-09 04:19:57,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:57,970 INFO L225 Difference]: With dead ends: 2416 [2025-01-09 04:19:57,971 INFO L226 Difference]: Without dead ends: 2414 [2025-01-09 04:19:57,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:19:57,974 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 118 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:57,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1797 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:57,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2025-01-09 04:19:58,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 1626. [2025-01-09 04:19:58,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1263 states have (on average 1.3467933491686461) internal successors, (1701), 1299 states have internal predecessors, (1701), 239 states have call successors, (239), 123 states have call predecessors, (239), 123 states have return successors, (239), 211 states have call predecessors, (239), 239 states have call successors, (239) [2025-01-09 04:19:58,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 2179 transitions. [2025-01-09 04:19:58,072 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 2179 transitions. Word has length 267 [2025-01-09 04:19:58,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:58,073 INFO L471 AbstractCegarLoop]: Abstraction has 1626 states and 2179 transitions. [2025-01-09 04:19:58,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 04:19:58,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 2179 transitions. [2025-01-09 04:19:58,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-01-09 04:19:58,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:58,076 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:19:58,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 04:19:58,076 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:58,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:58,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1238398015, now seen corresponding path program 1 times [2025-01-09 04:19:58,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:58,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026161445] [2025-01-09 04:19:58,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:58,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:58,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-01-09 04:19:58,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-01-09 04:19:58,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:58,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:58,362 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2025-01-09 04:19:58,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:58,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026161445] [2025-01-09 04:19:58,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026161445] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:58,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975177987] [2025-01-09 04:19:58,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:58,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:58,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:58,365 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:58,367 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:58,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-01-09 04:19:58,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-01-09 04:19:58,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:58,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:58,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 04:19:58,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:58,736 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 248 proven. 37 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2025-01-09 04:19:58,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:19:59,064 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 143 proven. 23 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2025-01-09 04:19:59,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975177987] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:19:59,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:19:59,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2025-01-09 04:19:59,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722293794] [2025-01-09 04:19:59,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:19:59,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 04:19:59,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:59,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 04:19:59,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:19:59,067 INFO L87 Difference]: Start difference. First operand 1626 states and 2179 transitions. Second operand has 18 states, 18 states have (on average 8.277777777777779) internal successors, (149), 14 states have internal predecessors, (149), 5 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2025-01-09 04:19:59,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:59,526 INFO L93 Difference]: Finished difference Result 4005 states and 5563 transitions. [2025-01-09 04:19:59,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 04:19:59,527 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.277777777777779) internal successors, (149), 14 states have internal predecessors, (149), 5 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) Word has length 275 [2025-01-09 04:19:59,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:59,539 INFO L225 Difference]: With dead ends: 4005 [2025-01-09 04:19:59,539 INFO L226 Difference]: Without dead ends: 2655 [2025-01-09 04:19:59,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 541 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2025-01-09 04:19:59,543 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 250 mSDsluCounter, 3191 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 3548 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:59,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 3548 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:19:59,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2025-01-09 04:19:59,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 2419. [2025-01-09 04:19:59,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2419 states, 1873 states have (on average 1.3352909770421784) internal successors, (2501), 1925 states have internal predecessors, (2501), 356 states have call successors, (356), 183 states have call predecessors, (356), 189 states have return successors, (364), 318 states have call predecessors, (364), 356 states have call successors, (364) [2025-01-09 04:19:59,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 3221 transitions. [2025-01-09 04:19:59,693 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 3221 transitions. Word has length 275 [2025-01-09 04:19:59,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:59,693 INFO L471 AbstractCegarLoop]: Abstraction has 2419 states and 3221 transitions. [2025-01-09 04:19:59,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.277777777777779) internal successors, (149), 14 states have internal predecessors, (149), 5 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2025-01-09 04:19:59,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 3221 transitions. [2025-01-09 04:19:59,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-01-09 04:19:59,698 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:59,698 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:19:59,706 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:59,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-09 04:19:59,899 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:59,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:59,901 INFO L85 PathProgramCache]: Analyzing trace with hash -2094955264, now seen corresponding path program 1 times [2025-01-09 04:19:59,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:59,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929380483] [2025-01-09 04:19:59,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:59,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:59,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-01-09 04:19:59,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-01-09 04:19:59,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:59,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:00,088 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2025-01-09 04:20:00,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:00,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929380483] [2025-01-09 04:20:00,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929380483] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:20:00,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133881520] [2025-01-09 04:20:00,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:00,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:20:00,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:20:00,094 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:20:00,096 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:20:00,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-01-09 04:20:00,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-01-09 04:20:00,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:00,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:00,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:20:00,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:20:00,302 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2025-01-09 04:20:00,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:20:00,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133881520] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:00,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:20:00,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-01-09 04:20:00,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553097454] [2025-01-09 04:20:00,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:00,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:20:00,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:00,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:20:00,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:20:00,304 INFO L87 Difference]: Start difference. First operand 2419 states and 3221 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 04:20:00,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:00,437 INFO L93 Difference]: Finished difference Result 4674 states and 6321 transitions. [2025-01-09 04:20:00,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:20:00,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 275 [2025-01-09 04:20:00,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:00,447 INFO L225 Difference]: With dead ends: 4674 [2025-01-09 04:20:00,447 INFO L226 Difference]: Without dead ends: 2355 [2025-01-09 04:20:00,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 277 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:20:00,452 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 4 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:00,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 702 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:20:00,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2355 states. [2025-01-09 04:20:00,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2355 to 2355. [2025-01-09 04:20:00,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2355 states, 1829 states have (on average 1.3182066703116457) internal successors, (2411), 1881 states have internal predecessors, (2411), 340 states have call successors, (340), 183 states have call predecessors, (340), 185 states have return successors, (344), 298 states have call predecessors, (344), 340 states have call successors, (344) [2025-01-09 04:20:00,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2355 states and 3095 transitions. [2025-01-09 04:20:00,538 INFO L78 Accepts]: Start accepts. Automaton has 2355 states and 3095 transitions. Word has length 275 [2025-01-09 04:20:00,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:00,538 INFO L471 AbstractCegarLoop]: Abstraction has 2355 states and 3095 transitions. [2025-01-09 04:20:00,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 04:20:00,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 3095 transitions. [2025-01-09 04:20:00,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-01-09 04:20:00,542 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:00,542 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:00,552 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:20:00,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:20:00,743 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:00,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:00,743 INFO L85 PathProgramCache]: Analyzing trace with hash 748148857, now seen corresponding path program 1 times [2025-01-09 04:20:00,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:00,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845371121] [2025-01-09 04:20:00,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:00,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:00,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-01-09 04:20:00,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-01-09 04:20:00,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:00,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 118 proven. 19 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2025-01-09 04:20:00,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:00,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845371121] [2025-01-09 04:20:00,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845371121] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:20:00,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915591596] [2025-01-09 04:20:00,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:00,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:20:00,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:20:00,881 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:20:00,884 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:20:00,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-01-09 04:20:01,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-01-09 04:20:01,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:01,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:01,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:20:01,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:20:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-01-09 04:20:01,089 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:20:01,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915591596] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:01,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:20:01,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-01-09 04:20:01,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254303866] [2025-01-09 04:20:01,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:01,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:20:01,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:01,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:20:01,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:20:01,090 INFO L87 Difference]: Start difference. First operand 2355 states and 3095 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 04:20:01,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:01,203 INFO L93 Difference]: Finished difference Result 4457 states and 5963 transitions. [2025-01-09 04:20:01,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:20:01,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 278 [2025-01-09 04:20:01,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:01,213 INFO L225 Difference]: With dead ends: 4457 [2025-01-09 04:20:01,213 INFO L226 Difference]: Without dead ends: 2184 [2025-01-09 04:20:01,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 279 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:20:01,219 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 4 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:01,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 730 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:20:01,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2025-01-09 04:20:01,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2184. [2025-01-09 04:20:01,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2184 states, 1688 states have (on average 1.3122037914691944) internal successors, (2215), 1740 states have internal predecessors, (2215), 323 states have call successors, (323), 172 states have call predecessors, (323), 172 states have return successors, (323), 279 states have call predecessors, (323), 323 states have call successors, (323) [2025-01-09 04:20:01,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 2861 transitions. [2025-01-09 04:20:01,311 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 2861 transitions. Word has length 278 [2025-01-09 04:20:01,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:01,312 INFO L471 AbstractCegarLoop]: Abstraction has 2184 states and 2861 transitions. [2025-01-09 04:20:01,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 04:20:01,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 2861 transitions. [2025-01-09 04:20:01,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-01-09 04:20:01,315 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:01,315 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:20:01,323 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:20:01,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:20:01,519 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:01,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:01,519 INFO L85 PathProgramCache]: Analyzing trace with hash 451956340, now seen corresponding path program 1 times [2025-01-09 04:20:01,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:01,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496165627] [2025-01-09 04:20:01,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:01,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:01,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-01-09 04:20:01,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-01-09 04:20:01,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:01,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:01,802 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 713 trivial. 0 not checked. [2025-01-09 04:20:01,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:01,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496165627] [2025-01-09 04:20:01,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496165627] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:20:01,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305069029] [2025-01-09 04:20:01,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:01,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:20:01,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:20:01,808 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:20:01,809 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:20:01,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-01-09 04:20:02,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-01-09 04:20:02,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:02,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:02,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 04:20:02,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:20:02,194 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-01-09 04:20:02,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:20:02,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305069029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:02,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:20:02,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-01-09 04:20:02,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54720759] [2025-01-09 04:20:02,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:02,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:20:02,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:02,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:20:02,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:20:02,197 INFO L87 Difference]: Start difference. First operand 2184 states and 2861 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 9 states have internal predecessors, (108), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 04:20:02,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:02,885 INFO L93 Difference]: Finished difference Result 7086 states and 9247 transitions. [2025-01-09 04:20:02,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 04:20:02,886 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 9 states have internal predecessors, (108), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 290 [2025-01-09 04:20:02,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:02,909 INFO L225 Difference]: With dead ends: 7086 [2025-01-09 04:20:02,911 INFO L226 Difference]: Without dead ends: 5472 [2025-01-09 04:20:02,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2025-01-09 04:20:02,919 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 629 mSDsluCounter, 2481 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 2869 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:02,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 2869 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:20:02,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5472 states. [2025-01-09 04:20:03,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5472 to 5200. [2025-01-09 04:20:03,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5200 states, 3981 states have (on average 1.2981662898769153) internal successors, (5168), 4109 states have internal predecessors, (5168), 787 states have call successors, (787), 431 states have call predecessors, (787), 431 states have return successors, (787), 667 states have call predecessors, (787), 787 states have call successors, (787) [2025-01-09 04:20:03,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5200 states to 5200 states and 6742 transitions. [2025-01-09 04:20:03,187 INFO L78 Accepts]: Start accepts. Automaton has 5200 states and 6742 transitions. Word has length 290 [2025-01-09 04:20:03,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:03,187 INFO L471 AbstractCegarLoop]: Abstraction has 5200 states and 6742 transitions. [2025-01-09 04:20:03,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 9 states have internal predecessors, (108), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 04:20:03,188 INFO L276 IsEmpty]: Start isEmpty. Operand 5200 states and 6742 transitions. [2025-01-09 04:20:03,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-01-09 04:20:03,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:03,191 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:20:03,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 04:20:03,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:20:03,395 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:03,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:03,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1822326257, now seen corresponding path program 1 times [2025-01-09 04:20:03,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:03,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137481007] [2025-01-09 04:20:03,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:03,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:03,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-01-09 04:20:03,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-01-09 04:20:03,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:03,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:03,535 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2025-01-09 04:20:03,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:03,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137481007] [2025-01-09 04:20:03,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137481007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:03,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:03,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:20:03,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839890925] [2025-01-09 04:20:03,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:03,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:20:03,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:03,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:20:03,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:20:03,537 INFO L87 Difference]: Start difference. First operand 5200 states and 6742 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 04:20:03,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:03,727 INFO L93 Difference]: Finished difference Result 10430 states and 13787 transitions. [2025-01-09 04:20:03,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:20:03,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 296 [2025-01-09 04:20:03,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:03,759 INFO L225 Difference]: With dead ends: 10430 [2025-01-09 04:20:03,759 INFO L226 Difference]: Without dead ends: 5740 [2025-01-09 04:20:03,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:20:03,773 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 35 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:03,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1025 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:20:03,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5740 states. [2025-01-09 04:20:04,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5740 to 5632. [2025-01-09 04:20:04,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5632 states, 4329 states have (on average 1.3083853083853083) internal successors, (5664), 4457 states have internal predecessors, (5664), 871 states have call successors, (871), 431 states have call predecessors, (871), 431 states have return successors, (871), 751 states have call predecessors, (871), 871 states have call successors, (871) [2025-01-09 04:20:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5632 states to 5632 states and 7406 transitions. [2025-01-09 04:20:04,039 INFO L78 Accepts]: Start accepts. Automaton has 5632 states and 7406 transitions. Word has length 296 [2025-01-09 04:20:04,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:04,040 INFO L471 AbstractCegarLoop]: Abstraction has 5632 states and 7406 transitions. [2025-01-09 04:20:04,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 04:20:04,040 INFO L276 IsEmpty]: Start isEmpty. Operand 5632 states and 7406 transitions. [2025-01-09 04:20:04,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-01-09 04:20:04,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:04,043 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:20:04,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 04:20:04,043 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:04,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:04,044 INFO L85 PathProgramCache]: Analyzing trace with hash -8088723, now seen corresponding path program 1 times [2025-01-09 04:20:04,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:04,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734462106] [2025-01-09 04:20:04,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:04,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:04,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-01-09 04:20:04,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-01-09 04:20:04,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:04,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:04,327 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2025-01-09 04:20:04,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:04,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734462106] [2025-01-09 04:20:04,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734462106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:04,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:04,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:20:04,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886872025] [2025-01-09 04:20:04,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:04,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:20:04,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:04,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:20:04,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:20:04,328 INFO L87 Difference]: Start difference. First operand 5632 states and 7406 transitions. Second operand has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 04:20:04,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:04,536 INFO L93 Difference]: Finished difference Result 10599 states and 13985 transitions. [2025-01-09 04:20:04,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:20:04,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 296 [2025-01-09 04:20:04,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:04,559 INFO L225 Difference]: With dead ends: 10599 [2025-01-09 04:20:04,559 INFO L226 Difference]: Without dead ends: 5540 [2025-01-09 04:20:04,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:20:04,571 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 0 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:04,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 973 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:20:04,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5540 states. [2025-01-09 04:20:04,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5540 to 5540. [2025-01-09 04:20:04,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5540 states, 4252 states have (on average 1.30620884289746) internal successors, (5554), 4372 states have internal predecessors, (5554), 864 states have call successors, (864), 424 states have call predecessors, (864), 423 states have return successors, (863), 750 states have call predecessors, (863), 863 states have call successors, (863) [2025-01-09 04:20:04,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5540 states to 5540 states and 7281 transitions. [2025-01-09 04:20:04,791 INFO L78 Accepts]: Start accepts. Automaton has 5540 states and 7281 transitions. Word has length 296 [2025-01-09 04:20:04,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:04,792 INFO L471 AbstractCegarLoop]: Abstraction has 5540 states and 7281 transitions. [2025-01-09 04:20:04,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 04:20:04,792 INFO L276 IsEmpty]: Start isEmpty. Operand 5540 states and 7281 transitions. [2025-01-09 04:20:04,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-01-09 04:20:04,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:04,795 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:20:04,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 04:20:04,795 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:04,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:04,796 INFO L85 PathProgramCache]: Analyzing trace with hash -369446113, now seen corresponding path program 1 times [2025-01-09 04:20:04,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:04,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495896938] [2025-01-09 04:20:04,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:04,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:04,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-01-09 04:20:04,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-01-09 04:20:04,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:04,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:05,228 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2025-01-09 04:20:05,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:05,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495896938] [2025-01-09 04:20:05,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495896938] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:20:05,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521379997] [2025-01-09 04:20:05,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:05,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:20:05,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:20:05,231 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:20:05,233 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:20:05,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-01-09 04:20:05,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-01-09 04:20:05,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:05,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:05,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 04:20:05,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:20:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2025-01-09 04:20:05,599 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:20:05,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521379997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:05,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:20:05,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2025-01-09 04:20:05,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638182009] [2025-01-09 04:20:05,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:05,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:20:05,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:05,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:20:05,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-01-09 04:20:05,601 INFO L87 Difference]: Start difference. First operand 5540 states and 7281 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 04:20:06,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:06,098 INFO L93 Difference]: Finished difference Result 12731 states and 16712 transitions. [2025-01-09 04:20:06,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:20:06,099 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 301 [2025-01-09 04:20:06,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:06,127 INFO L225 Difference]: With dead ends: 12731 [2025-01-09 04:20:06,127 INFO L226 Difference]: Without dead ends: 7714 [2025-01-09 04:20:06,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:20:06,141 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 124 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:06,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1869 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:20:06,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7714 states. [2025-01-09 04:20:06,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7714 to 6716. [2025-01-09 04:20:06,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6716 states, 5148 states have (on average 1.301087801087801) internal successors, (6698), 5298 states have internal predecessors, (6698), 1050 states have call successors, (1050), 518 states have call predecessors, (1050), 517 states have return successors, (1049), 906 states have call predecessors, (1049), 1049 states have call successors, (1049) [2025-01-09 04:20:06,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6716 states to 6716 states and 8797 transitions. [2025-01-09 04:20:06,447 INFO L78 Accepts]: Start accepts. Automaton has 6716 states and 8797 transitions. Word has length 301 [2025-01-09 04:20:06,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:06,448 INFO L471 AbstractCegarLoop]: Abstraction has 6716 states and 8797 transitions. [2025-01-09 04:20:06,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 04:20:06,448 INFO L276 IsEmpty]: Start isEmpty. Operand 6716 states and 8797 transitions. [2025-01-09 04:20:06,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-01-09 04:20:06,452 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:06,452 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:20:06,459 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:20:06,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:20:06,656 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:06,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:06,657 INFO L85 PathProgramCache]: Analyzing trace with hash 305887007, now seen corresponding path program 1 times [2025-01-09 04:20:06,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:06,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536236235] [2025-01-09 04:20:06,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:06,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:06,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-01-09 04:20:06,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-01-09 04:20:06,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:06,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:06,914 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2025-01-09 04:20:06,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:06,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536236235] [2025-01-09 04:20:06,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536236235] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:20:06,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661818514] [2025-01-09 04:20:06,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:06,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:20:06,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:20:06,919 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:20:06,922 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:20:07,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-01-09 04:20:07,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-01-09 04:20:07,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:07,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:07,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 04:20:07,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:20:07,195 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 195 proven. 4 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2025-01-09 04:20:07,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:20:07,359 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2025-01-09 04:20:07,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661818514] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:20:07,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:20:07,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 12 [2025-01-09 04:20:07,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905740657] [2025-01-09 04:20:07,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:20:07,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:20:07,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:07,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:20:07,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:20:07,361 INFO L87 Difference]: Start difference. First operand 6716 states and 8797 transitions. Second operand has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 11 states have internal predecessors, (134), 4 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (32), 5 states have call predecessors, (32), 4 states have call successors, (32) [2025-01-09 04:20:08,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:08,087 INFO L93 Difference]: Finished difference Result 13307 states and 17382 transitions. [2025-01-09 04:20:08,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 04:20:08,087 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 11 states have internal predecessors, (134), 4 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (32), 5 states have call predecessors, (32), 4 states have call successors, (32) Word has length 301 [2025-01-09 04:20:08,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:08,107 INFO L225 Difference]: With dead ends: 13307 [2025-01-09 04:20:08,107 INFO L226 Difference]: Without dead ends: 7268 [2025-01-09 04:20:08,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:20:08,116 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 600 mSDsluCounter, 2457 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 2845 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:08,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 2845 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:20:08,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7268 states. [2025-01-09 04:20:08,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7268 to 6520. [2025-01-09 04:20:08,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6520 states, 5000 states have (on average 1.294) internal successors, (6470), 5146 states have internal predecessors, (6470), 1006 states have call successors, (1006), 514 states have call predecessors, (1006), 513 states have return successors, (1005), 866 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-01-09 04:20:08,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6520 states to 6520 states and 8481 transitions. [2025-01-09 04:20:08,346 INFO L78 Accepts]: Start accepts. Automaton has 6520 states and 8481 transitions. Word has length 301 [2025-01-09 04:20:08,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:08,346 INFO L471 AbstractCegarLoop]: Abstraction has 6520 states and 8481 transitions. [2025-01-09 04:20:08,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 11 states have internal predecessors, (134), 4 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (32), 5 states have call predecessors, (32), 4 states have call successors, (32) [2025-01-09 04:20:08,347 INFO L276 IsEmpty]: Start isEmpty. Operand 6520 states and 8481 transitions. [2025-01-09 04:20:08,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-01-09 04:20:08,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:08,349 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:20:08,360 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:08,550 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,SelfDestructingSolverStorable35 [2025-01-09 04:20:08,550 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:08,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:08,551 INFO L85 PathProgramCache]: Analyzing trace with hash -292545315, now seen corresponding path program 1 times [2025-01-09 04:20:08,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:08,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54381535] [2025-01-09 04:20:08,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:08,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:08,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-01-09 04:20:08,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-01-09 04:20:08,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:08,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:08,664 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2025-01-09 04:20:08,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:08,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54381535] [2025-01-09 04:20:08,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54381535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:08,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:08,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:20:08,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603905677] [2025-01-09 04:20:08,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:08,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:20:08,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:08,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:20:08,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:20:08,666 INFO L87 Difference]: Start difference. First operand 6520 states and 8481 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 04:20:08,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:08,994 INFO L93 Difference]: Finished difference Result 13369 states and 17487 transitions. [2025-01-09 04:20:08,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:20:08,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 301 [2025-01-09 04:20:08,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:09,020 INFO L225 Difference]: With dead ends: 13369 [2025-01-09 04:20:09,020 INFO L226 Difference]: Without dead ends: 7628 [2025-01-09 04:20:09,030 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:20:09,030 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 257 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:09,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 704 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:20:09,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7628 states. [2025-01-09 04:20:09,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7628 to 6660. [2025-01-09 04:20:09,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6660 states, 5107 states have (on average 1.302917564127668) internal successors, (6654), 5253 states have internal predecessors, (6654), 1038 states have call successors, (1038), 515 states have call predecessors, (1038), 514 states have return successors, (1037), 898 states have call predecessors, (1037), 1037 states have call successors, (1037) [2025-01-09 04:20:09,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 8729 transitions. [2025-01-09 04:20:09,247 INFO L78 Accepts]: Start accepts. Automaton has 6660 states and 8729 transitions. Word has length 301 [2025-01-09 04:20:09,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:09,247 INFO L471 AbstractCegarLoop]: Abstraction has 6660 states and 8729 transitions. [2025-01-09 04:20:09,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 04:20:09,247 INFO L276 IsEmpty]: Start isEmpty. Operand 6660 states and 8729 transitions. [2025-01-09 04:20:09,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-09 04:20:09,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:09,251 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 04:20:09,253 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:09,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:09,253 INFO L85 PathProgramCache]: Analyzing trace with hash -651397859, now seen corresponding path program 1 times [2025-01-09 04:20:09,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:09,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351908919] [2025-01-09 04:20:09,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:09,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:09,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-09 04:20:09,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-09 04:20:09,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:09,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:09,341 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2025-01-09 04:20:09,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:09,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351908919] [2025-01-09 04:20:09,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351908919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:09,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:09,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:20:09,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954461013] [2025-01-09 04:20:09,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:09,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:20:09,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:09,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:20:09,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:20:09,344 INFO L87 Difference]: Start difference. First operand 6660 states and 8729 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 04:20:09,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:09,700 INFO L93 Difference]: Finished difference Result 11653 states and 15348 transitions. [2025-01-09 04:20:09,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:20:09,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 308 [2025-01-09 04:20:09,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:09,719 INFO L225 Difference]: With dead ends: 11653 [2025-01-09 04:20:09,719 INFO L226 Difference]: Without dead ends: 5768 [2025-01-09 04:20:09,726 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:20:09,728 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 435 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:09,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 915 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:20:09,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5768 states. [2025-01-09 04:20:10,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5768 to 5742. [2025-01-09 04:20:10,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5742 states, 4406 states have (on average 1.2871084884248751) internal successors, (5671), 4530 states have internal predecessors, (5671), 895 states have call successors, (895), 440 states have call predecessors, (895), 440 states have return successors, (895), 771 states have call predecessors, (895), 895 states have call successors, (895) [2025-01-09 04:20:10,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5742 states to 5742 states and 7461 transitions. [2025-01-09 04:20:10,068 INFO L78 Accepts]: Start accepts. Automaton has 5742 states and 7461 transitions. Word has length 308 [2025-01-09 04:20:10,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:10,069 INFO L471 AbstractCegarLoop]: Abstraction has 5742 states and 7461 transitions. [2025-01-09 04:20:10,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 04:20:10,069 INFO L276 IsEmpty]: Start isEmpty. Operand 5742 states and 7461 transitions. [2025-01-09 04:20:10,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-01-09 04:20:10,078 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:10,078 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 04:20:10,078 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:10,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:10,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1901609684, now seen corresponding path program 1 times [2025-01-09 04:20:10,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:10,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702290392] [2025-01-09 04:20:10,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:10,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:10,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-01-09 04:20:10,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-01-09 04:20:10,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:10,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:10,904 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-01-09 04:20:10,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:10,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702290392] [2025-01-09 04:20:10,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702290392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:10,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:10,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:20:10,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523910415] [2025-01-09 04:20:10,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:10,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:20:10,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:10,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:20:10,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:20:10,906 INFO L87 Difference]: Start difference. First operand 5742 states and 7461 transitions. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 6 states have internal predecessors, (101), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 04:20:11,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:11,272 INFO L93 Difference]: Finished difference Result 13133 states and 16958 transitions. [2025-01-09 04:20:11,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:20:11,273 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 6 states have internal predecessors, (101), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) Word has length 357 [2025-01-09 04:20:11,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:11,295 INFO L225 Difference]: With dead ends: 13133 [2025-01-09 04:20:11,295 INFO L226 Difference]: Without dead ends: 8174 [2025-01-09 04:20:11,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:20:11,303 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 76 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1747 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:11,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1747 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:20:11,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8174 states. [2025-01-09 04:20:11,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8174 to 7578. [2025-01-09 04:20:11,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7578 states, 5794 states have (on average 1.273558853986883) internal successors, (7379), 5950 states have internal predecessors, (7379), 1135 states have call successors, (1135), 588 states have call predecessors, (1135), 648 states have return successors, (1223), 1039 states have call predecessors, (1223), 1135 states have call successors, (1223) [2025-01-09 04:20:11,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 9737 transitions. [2025-01-09 04:20:11,570 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 9737 transitions. Word has length 357 [2025-01-09 04:20:11,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:11,571 INFO L471 AbstractCegarLoop]: Abstraction has 7578 states and 9737 transitions. [2025-01-09 04:20:11,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 6 states have internal predecessors, (101), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 04:20:11,571 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 9737 transitions. [2025-01-09 04:20:11,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-01-09 04:20:11,580 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:11,580 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 04:20:11,580 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:11,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:11,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1705096179, now seen corresponding path program 1 times [2025-01-09 04:20:11,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:11,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977802887] [2025-01-09 04:20:11,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:11,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:11,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-01-09 04:20:11,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-01-09 04:20:11,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:11,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:11,678 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 866 trivial. 0 not checked. [2025-01-09 04:20:11,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:11,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977802887] [2025-01-09 04:20:11,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977802887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:11,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:11,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:20:11,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005502622] [2025-01-09 04:20:11,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:11,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:20:11,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:11,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:20:11,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:20:11,679 INFO L87 Difference]: Start difference. First operand 7578 states and 9737 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 04:20:12,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:12,024 INFO L93 Difference]: Finished difference Result 15293 states and 19617 transitions. [2025-01-09 04:20:12,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:20:12,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 357 [2025-01-09 04:20:12,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:12,050 INFO L225 Difference]: With dead ends: 15293 [2025-01-09 04:20:12,050 INFO L226 Difference]: Without dead ends: 7338 [2025-01-09 04:20:12,060 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:20:12,061 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 26 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:12,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 673 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:20:12,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7338 states. [2025-01-09 04:20:12,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7338 to 7338. [2025-01-09 04:20:12,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7338 states, 5614 states have (on average 1.2369077306733167) internal successors, (6944), 5770 states have internal predecessors, (6944), 1135 states have call successors, (1135), 588 states have call predecessors, (1135), 588 states have return successors, (1135), 979 states have call predecessors, (1135), 1135 states have call successors, (1135) [2025-01-09 04:20:12,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7338 states to 7338 states and 9214 transitions. [2025-01-09 04:20:12,323 INFO L78 Accepts]: Start accepts. Automaton has 7338 states and 9214 transitions. Word has length 357 [2025-01-09 04:20:12,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:12,323 INFO L471 AbstractCegarLoop]: Abstraction has 7338 states and 9214 transitions. [2025-01-09 04:20:12,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 04:20:12,323 INFO L276 IsEmpty]: Start isEmpty. Operand 7338 states and 9214 transitions. [2025-01-09 04:20:12,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-01-09 04:20:12,333 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:12,333 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 04:20:12,333 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:12,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:12,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1668711513, now seen corresponding path program 1 times [2025-01-09 04:20:12,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:12,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877774594] [2025-01-09 04:20:12,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:12,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:12,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-01-09 04:20:12,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-01-09 04:20:12,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:12,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:12,700 INFO L134 CoverageAnalysis]: Checked inductivity of 967 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2025-01-09 04:20:12,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:12,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877774594] [2025-01-09 04:20:12,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877774594] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:20:12,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666489670] [2025-01-09 04:20:12,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:12,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:20:12,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:20:12,706 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:12,707 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:12,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-01-09 04:20:12,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-01-09 04:20:12,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:12,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:12,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 1367 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 04:20:12,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:20:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 967 backedges. 303 proven. 72 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2025-01-09 04:20:13,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:20:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 967 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2025-01-09 04:20:14,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666489670] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:20:14,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:20:14,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 12] total 22 [2025-01-09 04:20:14,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721930644] [2025-01-09 04:20:14,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:20:14,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 04:20:14,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:14,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 04:20:14,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:20:14,037 INFO L87 Difference]: Start difference. First operand 7338 states and 9214 transitions. Second operand has 22 states, 21 states have (on average 13.19047619047619) internal successors, (277), 21 states have internal predecessors, (277), 16 states have call successors, (65), 7 states have call predecessors, (65), 6 states have return successors, (63), 15 states have call predecessors, (63), 15 states have call successors, (63) [2025-01-09 04:20:23,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:23,038 INFO L93 Difference]: Finished difference Result 79508 states and 109567 transitions. [2025-01-09 04:20:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2025-01-09 04:20:23,038 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 13.19047619047619) internal successors, (277), 21 states have internal predecessors, (277), 16 states have call successors, (65), 7 states have call predecessors, (65), 6 states have return successors, (63), 15 states have call predecessors, (63), 15 states have call successors, (63) Word has length 367 [2025-01-09 04:20:23,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:23,311 INFO L225 Difference]: With dead ends: 79508 [2025-01-09 04:20:23,312 INFO L226 Difference]: Without dead ends: 73025 [2025-01-09 04:20:23,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 933 GetRequests, 759 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12421 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3829, Invalid=26971, Unknown=0, NotChecked=0, Total=30800 [2025-01-09 04:20:23,348 INFO L435 NwaCegarLoop]: 1201 mSDtfsCounter, 3702 mSDsluCounter, 10011 mSDsCounter, 0 mSdLazyCounter, 5040 mSolverCounterSat, 1160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3702 SdHoareTripleChecker+Valid, 11212 SdHoareTripleChecker+Invalid, 6200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1160 IncrementalHoareTripleChecker+Valid, 5040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:23,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3702 Valid, 11212 Invalid, 6200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1160 Valid, 5040 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 04:20:23,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73025 states. [2025-01-09 04:20:24,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73025 to 9214. [2025-01-09 04:20:24,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9214 states, 7082 states have (on average 1.237079920926292) internal successors, (8761), 7340 states have internal predecessors, (8761), 1392 states have call successors, (1392), 739 states have call predecessors, (1392), 739 states have return successors, (1392), 1134 states have call predecessors, (1392), 1392 states have call successors, (1392) [2025-01-09 04:20:24,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9214 states to 9214 states and 11545 transitions. [2025-01-09 04:20:24,907 INFO L78 Accepts]: Start accepts. Automaton has 9214 states and 11545 transitions. Word has length 367 [2025-01-09 04:20:24,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:24,908 INFO L471 AbstractCegarLoop]: Abstraction has 9214 states and 11545 transitions. [2025-01-09 04:20:24,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 13.19047619047619) internal successors, (277), 21 states have internal predecessors, (277), 16 states have call successors, (65), 7 states have call predecessors, (65), 6 states have return successors, (63), 15 states have call predecessors, (63), 15 states have call successors, (63) [2025-01-09 04:20:24,908 INFO L276 IsEmpty]: Start isEmpty. Operand 9214 states and 11545 transitions. [2025-01-09 04:20:24,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-01-09 04:20:24,921 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:24,921 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,930 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:25,125 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,SelfDestructingSolverStorable40 [2025-01-09 04:20:25,125 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:25,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:25,126 INFO L85 PathProgramCache]: Analyzing trace with hash -664681125, now seen corresponding path program 1 times [2025-01-09 04:20:25,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:25,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595292936] [2025-01-09 04:20:25,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:25,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:25,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-01-09 04:20:25,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-01-09 04:20:25,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:25,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:25,361 INFO L134 CoverageAnalysis]: Checked inductivity of 967 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 939 trivial. 0 not checked. [2025-01-09 04:20:25,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:25,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595292936] [2025-01-09 04:20:25,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595292936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:25,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:25,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:20:25,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750258320] [2025-01-09 04:20:25,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:25,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:20:25,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:25,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:20:25,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:20:25,363 INFO L87 Difference]: Start difference. First operand 9214 states and 11545 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) [2025-01-09 04:20:26,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:26,793 INFO L93 Difference]: Finished difference Result 19153 states and 24118 transitions. [2025-01-09 04:20:26,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:20:26,793 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) Word has length 367 [2025-01-09 04:20:26,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:26,835 INFO L225 Difference]: With dead ends: 19153 [2025-01-09 04:20:26,836 INFO L226 Difference]: Without dead ends: 10902 [2025-01-09 04:20:26,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:20:26,850 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 157 mSDsluCounter, 1926 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 2330 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:26,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 2330 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:20:26,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10902 states. [2025-01-09 04:20:27,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10902 to 7516. [2025-01-09 04:20:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7516 states, 5776 states have (on average 1.2337257617728532) internal successors, (7126), 6006 states have internal predecessors, (7126), 1130 states have call successors, (1130), 609 states have call predecessors, (1130), 609 states have return successors, (1130), 900 states have call predecessors, (1130), 1130 states have call successors, (1130) [2025-01-09 04:20:27,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7516 states to 7516 states and 9386 transitions. [2025-01-09 04:20:27,939 INFO L78 Accepts]: Start accepts. Automaton has 7516 states and 9386 transitions. Word has length 367 [2025-01-09 04:20:27,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:27,940 INFO L471 AbstractCegarLoop]: Abstraction has 7516 states and 9386 transitions. [2025-01-09 04:20:27,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) [2025-01-09 04:20:27,940 INFO L276 IsEmpty]: Start isEmpty. Operand 7516 states and 9386 transitions. [2025-01-09 04:20:27,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-01-09 04:20:27,953 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:27,954 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 04:20:27,954 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:27,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:27,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1864512432, now seen corresponding path program 1 times [2025-01-09 04:20:27,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:27,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215157956] [2025-01-09 04:20:27,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:27,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:27,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-01-09 04:20:28,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-01-09 04:20:28,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:28,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:28,980 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 04:20:28,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:28,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215157956] [2025-01-09 04:20:28,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215157956] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:20:28,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156916936] [2025-01-09 04:20:28,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:28,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:20:28,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:20:28,984 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:28,985 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:29,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-01-09 04:20:29,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-01-09 04:20:29,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:29,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:29,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 1368 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 04:20:29,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:20:29,755 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 303 proven. 70 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2025-01-09 04:20:29,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:20:30,250 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2025-01-09 04:20:30,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156916936] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:20:30,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:20:30,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 13] total 36 [2025-01-09 04:20:30,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824613889] [2025-01-09 04:20:30,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:20:30,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-01-09 04:20:30,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:30,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-01-09 04:20:30,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1129, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 04:20:30,252 INFO L87 Difference]: Start difference. First operand 7516 states and 9386 transitions. Second operand has 36 states, 35 states have (on average 8.942857142857143) internal successors, (313), 34 states have internal predecessors, (313), 19 states have call successors, (76), 7 states have call predecessors, (76), 7 states have return successors, (74), 19 states have call predecessors, (74), 18 states have call successors, (74) [2025-01-09 04:20:46,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:46,374 INFO L93 Difference]: Finished difference Result 55543 states and 74754 transitions. [2025-01-09 04:20:46,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2025-01-09 04:20:46,375 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 8.942857142857143) internal successors, (313), 34 states have internal predecessors, (313), 19 states have call successors, (76), 7 states have call predecessors, (76), 7 states have return successors, (74), 19 states have call predecessors, (74), 18 states have call successors, (74) Word has length 368 [2025-01-09 04:20:46,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:46,745 INFO L225 Difference]: With dead ends: 55543 [2025-01-09 04:20:46,745 INFO L226 Difference]: Without dead ends: 48990 [2025-01-09 04:20:46,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 969 GetRequests, 757 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16530 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4699, Invalid=40883, Unknown=0, NotChecked=0, Total=45582 [2025-01-09 04:20:46,776 INFO L435 NwaCegarLoop]: 1031 mSDtfsCounter, 4582 mSDsluCounter, 17892 mSDsCounter, 0 mSdLazyCounter, 9625 mSolverCounterSat, 1596 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4582 SdHoareTripleChecker+Valid, 18923 SdHoareTripleChecker+Invalid, 11221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1596 IncrementalHoareTripleChecker+Valid, 9625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:46,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4582 Valid, 18923 Invalid, 11221 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1596 Valid, 9625 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-01-09 04:20:46,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48990 states. [2025-01-09 04:20:48,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48990 to 14937. [2025-01-09 04:20:48,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14937 states, 11369 states have (on average 1.2418858298882927) internal successors, (14119), 11905 states have internal predecessors, (14119), 2343 states have call successors, (2343), 1224 states have call predecessors, (2343), 1224 states have return successors, (2343), 1807 states have call predecessors, (2343), 2343 states have call successors, (2343) [2025-01-09 04:20:48,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14937 states to 14937 states and 18805 transitions. [2025-01-09 04:20:48,817 INFO L78 Accepts]: Start accepts. Automaton has 14937 states and 18805 transitions. Word has length 368 [2025-01-09 04:20:48,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:48,818 INFO L471 AbstractCegarLoop]: Abstraction has 14937 states and 18805 transitions. [2025-01-09 04:20:48,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 8.942857142857143) internal successors, (313), 34 states have internal predecessors, (313), 19 states have call successors, (76), 7 states have call predecessors, (76), 7 states have return successors, (74), 19 states have call predecessors, (74), 18 states have call successors, (74) [2025-01-09 04:20:48,818 INFO L276 IsEmpty]: Start isEmpty. Operand 14937 states and 18805 transitions. [2025-01-09 04:20:48,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-01-09 04:20:48,839 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:48,840 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-09 04:20:49,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:20:49,044 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:49,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:49,045 INFO L85 PathProgramCache]: Analyzing trace with hash 417939576, now seen corresponding path program 1 times [2025-01-09 04:20:49,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:49,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921045633] [2025-01-09 04:20:49,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:49,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:49,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-01-09 04:20:49,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-01-09 04:20:49,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:49,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:49,976 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 04:20:49,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:49,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921045633] [2025-01-09 04:20:49,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921045633] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:20:49,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885170063] [2025-01-09 04:20:49,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:49,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:20:49,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:20:49,980 INFO L229 MonitoredProcess]: Starting monitored process 14 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:49,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 04:20:50,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-01-09 04:20:50,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-01-09 04:20:50,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:50,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:50,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 1369 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 04:20:50,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:20:50,934 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 264 proven. 112 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2025-01-09 04:20:50,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:20:51,512 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 14 proven. 26 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 04:20:51,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885170063] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:20:51,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:20:51,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 18] total 39 [2025-01-09 04:20:51,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304526176] [2025-01-09 04:20:51,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:20:51,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 04:20:51,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:51,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 04:20:51,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1333, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 04:20:51,514 INFO L87 Difference]: Start difference. First operand 14937 states and 18805 transitions. Second operand has 39 states, 38 states have (on average 8.763157894736842) internal successors, (333), 36 states have internal predecessors, (333), 18 states have call successors, (76), 7 states have call predecessors, (76), 9 states have return successors, (75), 19 states have call predecessors, (75), 17 states have call successors, (75)