./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/rekh_ctm.1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/rekh_ctm.1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c3ec7c03a28dc415c6db5fadbfd8dcd491b1a493cd1bf88ef12d02131cd13437 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:33:15,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:33:15,947 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:33:15,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:33:15,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:33:15,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:33:15,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:33:15,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:33:15,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:33:15,987 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:33:15,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:33:15,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:33:15,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:33:15,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:33:15,989 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:33:15,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:33:15,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:33:15,989 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:33:15,989 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:33:15,989 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:33:15,989 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:33:15,989 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:33:15,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:33:15,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:33:15,990 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:33:15,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:33:15,990 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:33:15,990 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:33:15,991 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:33:15,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:33:15,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:33:15,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:33:15,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:33:15,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:33:15,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:33:15,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:33:15,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:33:15,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:33:15,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:33:15,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:33:15,993 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:33:15,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:33:15,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:33:15,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:33:15,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:33:15,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:33:15,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:33:15,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:33:15,993 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 -> c3ec7c03a28dc415c6db5fadbfd8dcd491b1a493cd1bf88ef12d02131cd13437 [2025-01-09 04:33:16,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:33:16,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:33:16,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:33:16,264 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:33:16,266 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:33:16,267 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/rekh_ctm.1.c [2025-01-09 04:33:17,512 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/950af49a4/de1d597c5c6942b29f4dba23808eb9ee/FLAGb14094af5 [2025-01-09 04:33:18,040 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:33:18,040 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_ctm.1.c [2025-01-09 04:33:18,074 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/950af49a4/de1d597c5c6942b29f4dba23808eb9ee/FLAGb14094af5 [2025-01-09 04:33:18,092 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/950af49a4/de1d597c5c6942b29f4dba23808eb9ee [2025-01-09 04:33:18,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:33:18,096 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:33:18,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:33:18,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:33:18,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:33:18,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:33:18" (1/1) ... [2025-01-09 04:33:18,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d59e520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:18, skipping insertion in model container [2025-01-09 04:33:18,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:33:18" (1/1) ... [2025-01-09 04:33:18,180 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:33:18,342 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/rekh_ctm.1.c[1868,1881] [2025-01-09 04:33:18,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:33:18,836 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:33:18,845 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"/tmp/aaaa/ctm.ok1.i","-S") [42] [2025-01-09 04:33:18,851 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/rekh_ctm.1.c[1868,1881] [2025-01-09 04:33:19,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:33:19,122 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:33:19,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19 WrapperNode [2025-01-09 04:33:19,124 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:33:19,125 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:33:19,125 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:33:19,125 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:33:19,133 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:33:19" (1/1) ... [2025-01-09 04:33:19,205 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:33:19" (1/1) ... [2025-01-09 04:33:19,458 INFO L138 Inliner]: procedures = 99, calls = 2727, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 8497 [2025-01-09 04:33:19,459 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:33:19,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:33:19,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:33:19,461 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:33:19,470 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19" (1/1) ... [2025-01-09 04:33:19,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19" (1/1) ... [2025-01-09 04:33:19,512 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19" (1/1) ... [2025-01-09 04:33:19,633 INFO L175 MemorySlicer]: Split 2332 memory accesses to 49 slices as follows [2, 80, 86, 37, 37, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46]. 4 percent of accesses are in the largest equivalence class. The 338 initializations are split as follows [2, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]. The 402 writes are split as follows [0, 7, 7, 7, 7, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6]. [2025-01-09 04:33:19,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19" (1/1) ... [2025-01-09 04:33:19,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19" (1/1) ... [2025-01-09 04:33:19,835 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19" (1/1) ... [2025-01-09 04:33:19,849 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19" (1/1) ... [2025-01-09 04:33:19,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19" (1/1) ... [2025-01-09 04:33:19,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19" (1/1) ... [2025-01-09 04:33:20,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19" (1/1) ... [2025-01-09 04:33:20,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:33:20,082 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:33:20,083 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:33:20,083 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:33:20,084 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19" (1/1) ... [2025-01-09 04:33:20,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:33:20,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:33:20,143 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:33:20,190 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:33:20,233 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_state [2025-01-09 04:33:20,233 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_state [2025-01-09 04:33:20,234 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_state [2025-01-09 04:33:20,234 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_state [2025-01-09 04:33:20,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 04:33:20,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 04:33:20,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 04:33:20,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 04:33:20,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 04:33:20,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 04:33:20,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 04:33:20,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 04:33:20,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 04:33:20,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 04:33:20,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 04:33:20,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 04:33:20,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 04:33:20,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 04:33:20,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 04:33:20,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 04:33:20,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 04:33:20,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-09 04:33:20,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-09 04:33:20,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-01-09 04:33:20,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-01-09 04:33:20,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-01-09 04:33:20,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-01-09 04:33:20,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-01-09 04:33:20,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-01-09 04:33:20,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-01-09 04:33:20,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-01-09 04:33:20,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#27 [2025-01-09 04:33:20,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#28 [2025-01-09 04:33:20,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#29 [2025-01-09 04:33:20,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#30 [2025-01-09 04:33:20,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#31 [2025-01-09 04:33:20,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#32 [2025-01-09 04:33:20,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#33 [2025-01-09 04:33:20,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#34 [2025-01-09 04:33:20,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#35 [2025-01-09 04:33:20,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#36 [2025-01-09 04:33:20,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#37 [2025-01-09 04:33:20,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#38 [2025-01-09 04:33:20,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#39 [2025-01-09 04:33:20,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#40 [2025-01-09 04:33:20,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#41 [2025-01-09 04:33:20,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#42 [2025-01-09 04:33:20,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#43 [2025-01-09 04:33:20,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#44 [2025-01-09 04:33:20,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#45 [2025-01-09 04:33:20,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#46 [2025-01-09 04:33:20,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#47 [2025-01-09 04:33:20,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#48 [2025-01-09 04:33:20,244 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_need_to_run_nxtbg [2025-01-09 04:33:20,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_need_to_run_nxtbg [2025-01-09 04:33:20,244 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_count [2025-01-09 04:33:20,244 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_count [2025-01-09 04:33:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write___startrek_current_priority [2025-01-09 04:33:20,245 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write___startrek_current_priority [2025-01-09 04:33:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_input [2025-01-09 04:33:20,245 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_input [2025-01-09 04:33:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_hyperperiod [2025-01-09 04:33:20,245 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_hyperperiod [2025-01-09 04:33:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure bg_nxtcolorsensor [2025-01-09 04:33:20,245 INFO L138 BoogieDeclarations]: Found implementation of procedure bg_nxtcolorsensor [2025-01-09 04:33:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Writer [2025-01-09 04:33:20,245 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Writer [2025-01-09 04:33:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtcolorsensor_mode [2025-01-09 04:33:20,245 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtcolorsensor_mode [2025-01-09 04:33:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 04:33:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 04:33:20,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 04:33:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 04:33:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 04:33:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 04:33:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 04:33:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 04:33:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 04:33:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 04:33:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 04:33:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 04:33:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 04:33:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 04:33:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 04:33:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 04:33:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 04:33:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-09 04:33:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-09 04:33:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-01-09 04:33:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-01-09 04:33:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-01-09 04:33:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-01-09 04:33:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-01-09 04:33:20,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-01-09 04:33:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-01-09 04:33:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-01-09 04:33:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#27 [2025-01-09 04:33:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#28 [2025-01-09 04:33:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#29 [2025-01-09 04:33:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#30 [2025-01-09 04:33:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#31 [2025-01-09 04:33:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#32 [2025-01-09 04:33:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#33 [2025-01-09 04:33:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#34 [2025-01-09 04:33:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#35 [2025-01-09 04:33:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#36 [2025-01-09 04:33:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#37 [2025-01-09 04:33:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#38 [2025-01-09 04:33:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#39 [2025-01-09 04:33:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#40 [2025-01-09 04:33:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#41 [2025-01-09 04:33:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#42 [2025-01-09 04:33:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#43 [2025-01-09 04:33:20,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#44 [2025-01-09 04:33:20,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#45 [2025-01-09 04:33:20,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#46 [2025-01-09 04:33:20,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#47 [2025-01-09 04:33:20,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#48 [2025-01-09 04:33:20,248 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-01-09 04:33:20,248 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-01-09 04:33:20,248 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_count [2025-01-09 04:33:20,248 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_count [2025-01-09 04:33:20,248 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_T_state [2025-01-09 04:33:20,248 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_T_state [2025-01-09 04:33:20,248 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_output [2025-01-09 04:33:20,248 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_output [2025-01-09 04:33:20,248 INFO L130 BoogieDeclarations]: Found specification of procedure move_motor [2025-01-09 04:33:20,248 INFO L138 BoogieDeclarations]: Found implementation of procedure move_motor [2025-01-09 04:33:20,248 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_speed [2025-01-09 04:33:20,248 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_speed [2025-01-09 04:33:20,248 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_get_count [2025-01-09 04:33:20,248 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_get_count [2025-01-09 04:33:20,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:33:20,250 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t2 [2025-01-09 04:33:20,250 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t2 [2025-01-09 04:33:20,250 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_set_nxtcolorsensor [2025-01-09 04:33:20,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_set_nxtcolorsensor [2025-01-09 04:33:20,250 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t3 [2025-01-09 04:33:20,250 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t3 [2025-01-09 04:33:20,250 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_output [2025-01-09 04:33:20,250 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_output [2025-01-09 04:33:20,250 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t0 [2025-01-09 04:33:20,251 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t0 [2025-01-09 04:33:20,251 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_T_count [2025-01-09 04:33:20,251 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_T_count [2025-01-09 04:33:20,251 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t1 [2025-01-09 04:33:20,251 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t1 [2025-01-09 04:33:20,251 INFO L130 BoogieDeclarations]: Found specification of procedure TerminateTask [2025-01-09 04:33:20,251 INFO L138 BoogieDeclarations]: Found implementation of procedure TerminateTask [2025-01-09 04:33:20,251 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_W_count [2025-01-09 04:33:20,251 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_W_count [2025-01-09 04:33:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read___startrek_current_priority [2025-01-09 04:33:20,252 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read___startrek_current_priority [2025-01-09 04:33:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_count [2025-01-09 04:33:20,252 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_count [2025-01-09 04:33:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_count [2025-01-09 04:33:20,252 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_count [2025-01-09 04:33:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_speed [2025-01-09 04:33:20,252 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_speed [2025-01-09 04:33:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtcolorsensor_data_mode [2025-01-09 04:33:20,252 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtcolorsensor_data_mode [2025-01-09 04:33:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_threshold [2025-01-09 04:33:20,253 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_threshold [2025-01-09 04:33:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_need_to_read [2025-01-09 04:33:20,253 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_need_to_read [2025-01-09 04:33:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_R_state [2025-01-09 04:33:20,253 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_R_state [2025-01-09 04:33:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Reader [2025-01-09 04:33:20,253 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Reader [2025-01-09 04:33:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_dir [2025-01-09 04:33:20,253 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_dir [2025-01-09 04:33:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_speed [2025-01-09 04:33:20,253 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_speed [2025-01-09 04:33:20,253 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_input [2025-01-09 04:33:20,254 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_input [2025-01-09 04:33:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_state [2025-01-09 04:33:20,254 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_state [2025-01-09 04:33:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_need_to_run_nxtbg [2025-01-09 04:33:20,254 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_need_to_run_nxtbg [2025-01-09 04:33:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_W_state [2025-01-09 04:33:20,254 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_W_state [2025-01-09 04:33:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_R_count [2025-01-09 04:33:20,254 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_R_count [2025-01-09 04:33:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_TapeMover [2025-01-09 04:33:20,254 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_TapeMover [2025-01-09 04:33:20,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:33:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 04:33:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 04:33:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 04:33:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 04:33:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 04:33:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 04:33:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 04:33:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 04:33:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 04:33:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 04:33:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 04:33:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 04:33:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#27 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#28 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#29 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#30 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#31 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#32 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#33 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#34 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#35 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#36 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#37 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#38 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#39 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#40 [2025-01-09 04:33:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#41 [2025-01-09 04:33:20,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#42 [2025-01-09 04:33:20,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#43 [2025-01-09 04:33:20,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#44 [2025-01-09 04:33:20,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#45 [2025-01-09 04:33:20,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#46 [2025-01-09 04:33:20,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#47 [2025-01-09 04:33:20,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#48 [2025-01-09 04:33:20,257 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Controller [2025-01-09 04:33:20,257 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Controller [2025-01-09 04:33:20,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:33:20,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:33:20,939 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:33:20,941 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:33:32,290 INFO L? ?]: Removed 947 outVars from TransFormulas that were not future-live. [2025-01-09 04:33:32,290 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:33:32,352 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:33:32,352 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 04:33:32,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:33:32 BoogieIcfgContainer [2025-01-09 04:33:32,352 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:33:32,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:33:32,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:33:32,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:33:32,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:33:18" (1/3) ... [2025-01-09 04:33:32,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ca7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:33:32, skipping insertion in model container [2025-01-09 04:33:32,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19" (2/3) ... [2025-01-09 04:33:32,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ca7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:33:32, skipping insertion in model container [2025-01-09 04:33:32,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:33:32" (3/3) ... [2025-01-09 04:33:32,361 INFO L128 eAbstractionObserver]: Analyzing ICFG rekh_ctm.1.c [2025-01-09 04:33:32,375 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:33:32,379 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rekh_ctm.1.c that has 45 procedures, 2464 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:33:32,499 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:33:32,511 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;@53c54082, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:33:32,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:33:32,526 INFO L276 IsEmpty]: Start isEmpty. Operand has 2464 states, 2113 states have (on average 1.480832938949361) internal successors, (3129), 2137 states have internal predecessors, (3129), 305 states have call successors, (305), 44 states have call predecessors, (305), 44 states have return successors, (305), 295 states have call predecessors, (305), 305 states have call successors, (305) [2025-01-09 04:33:32,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 04:33:32,544 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:33:32,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:32,546 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:33:32,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:33:32,551 INFO L85 PathProgramCache]: Analyzing trace with hash 433864660, now seen corresponding path program 1 times [2025-01-09 04:33:32,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:33:32,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228979691] [2025-01-09 04:33:32,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:33:32,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:33:33,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 04:33:33,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 04:33:33,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:33:33,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:33:33,899 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:33:33,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:33:33,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228979691] [2025-01-09 04:33:33,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228979691] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:33:33,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:33:33,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:33:33,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461060417] [2025-01-09 04:33:33,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:33:33,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 04:33:33,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:33:33,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 04:33:33,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:33:33,943 INFO L87 Difference]: Start difference. First operand has 2464 states, 2113 states have (on average 1.480832938949361) internal successors, (3129), 2137 states have internal predecessors, (3129), 305 states have call successors, (305), 44 states have call predecessors, (305), 44 states have return successors, (305), 295 states have call predecessors, (305), 305 states have call successors, (305) Second operand has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:33:34,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:33:34,265 INFO L93 Difference]: Finished difference Result 4919 states and 7725 transitions. [2025-01-09 04:33:34,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 04:33:34,268 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 148 [2025-01-09 04:33:34,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:33:34,308 INFO L225 Difference]: With dead ends: 4919 [2025-01-09 04:33:34,308 INFO L226 Difference]: Without dead ends: 2451 [2025-01-09 04:33:34,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:33:34,349 INFO L435 NwaCegarLoop]: 3043 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3043 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:33:34,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3043 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:33:34,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2451 states. [2025-01-09 04:33:34,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2451 to 2451. [2025-01-09 04:33:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2451 states, 2101 states have (on average 1.15421227986673) internal successors, (2425), 2125 states have internal predecessors, (2425), 305 states have call successors, (305), 44 states have call predecessors, (305), 44 states have return successors, (304), 294 states have call predecessors, (304), 304 states have call successors, (304) [2025-01-09 04:33:34,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 3034 transitions. [2025-01-09 04:33:34,591 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 3034 transitions. Word has length 148 [2025-01-09 04:33:34,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:33:34,591 INFO L471 AbstractCegarLoop]: Abstraction has 2451 states and 3034 transitions. [2025-01-09 04:33:34,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:33:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 3034 transitions. [2025-01-09 04:33:34,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 04:33:34,608 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:33:34,608 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:34,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:33:34,608 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:33:34,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:33:34,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1872430963, now seen corresponding path program 1 times [2025-01-09 04:33:34,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:33:34,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582811775] [2025-01-09 04:33:34,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:33:34,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:33:35,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 04:33:35,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 04:33:35,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:33:35,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:33:36,423 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 04:33:36,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:33:36,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582811775] [2025-01-09 04:33:36,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582811775] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:33:36,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:33:36,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:33:36,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597380855] [2025-01-09 04:33:36,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:33:36,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:33:36,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:33:36,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:33:36,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:33:36,436 INFO L87 Difference]: Start difference. First operand 2451 states and 3034 transitions. Second operand has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:33:40,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:33:40,527 INFO L93 Difference]: Finished difference Result 5556 states and 6977 transitions. [2025-01-09 04:33:40,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:33:40,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 208 [2025-01-09 04:33:40,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:33:40,555 INFO L225 Difference]: With dead ends: 5556 [2025-01-09 04:33:40,556 INFO L226 Difference]: Without dead ends: 3110 [2025-01-09 04:33:40,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:33:40,578 INFO L435 NwaCegarLoop]: 3648 mSDtfsCounter, 5820 mSDsluCounter, 4602 mSDsCounter, 0 mSdLazyCounter, 2054 mSolverCounterSat, 487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5820 SdHoareTripleChecker+Valid, 8250 SdHoareTripleChecker+Invalid, 2541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 2054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:33:40,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5820 Valid, 8250 Invalid, 2541 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [487 Valid, 2054 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-01-09 04:33:40,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2025-01-09 04:33:40,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 2974. [2025-01-09 04:33:40,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2974 states, 2476 states have (on average 1.186995153473344) internal successors, (2939), 2506 states have internal predecessors, (2939), 420 states have call successors, (420), 77 states have call predecessors, (420), 77 states have return successors, (419), 405 states have call predecessors, (419), 419 states have call successors, (419) [2025-01-09 04:33:40,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 3778 transitions. [2025-01-09 04:33:40,751 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 3778 transitions. Word has length 208 [2025-01-09 04:33:40,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:33:40,755 INFO L471 AbstractCegarLoop]: Abstraction has 2974 states and 3778 transitions. [2025-01-09 04:33:40,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:33:40,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 3778 transitions. [2025-01-09 04:33:40,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 04:33:40,766 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:33:40,766 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:40,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:33:40,766 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:33:40,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:33:40,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1097966701, now seen corresponding path program 1 times [2025-01-09 04:33:40,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:33:40,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858032839] [2025-01-09 04:33:40,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:33:40,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:33:41,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 04:33:41,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 04:33:41,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:33:41,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:33:42,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:33:42,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:33:42,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858032839] [2025-01-09 04:33:42,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858032839] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:33:42,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:33:42,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:33:42,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733188762] [2025-01-09 04:33:42,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:33:42,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:33:42,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:33:42,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:33:42,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:33:42,194 INFO L87 Difference]: Start difference. First operand 2974 states and 3778 transitions. Second operand has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:33:46,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:33:46,128 INFO L93 Difference]: Finished difference Result 6455 states and 8258 transitions. [2025-01-09 04:33:46,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:33:46,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 209 [2025-01-09 04:33:46,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:33:46,159 INFO L225 Difference]: With dead ends: 6455 [2025-01-09 04:33:46,159 INFO L226 Difference]: Without dead ends: 3486 [2025-01-09 04:33:46,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:33:46,182 INFO L435 NwaCegarLoop]: 3525 mSDtfsCounter, 3727 mSDsluCounter, 5463 mSDsCounter, 0 mSdLazyCounter, 2326 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3727 SdHoareTripleChecker+Valid, 8988 SdHoareTripleChecker+Invalid, 2337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:33:46,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3727 Valid, 8988 Invalid, 2337 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 2326 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-09 04:33:46,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3486 states. [2025-01-09 04:33:46,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3486 to 3348. [2025-01-09 04:33:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3348 states, 2752 states have (on average 1.2063953488372092) internal successors, (3320), 2791 states have internal predecessors, (3320), 497 states have call successors, (497), 98 states have call predecessors, (497), 98 states have return successors, (496), 478 states have call predecessors, (496), 496 states have call successors, (496) [2025-01-09 04:33:46,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3348 states to 3348 states and 4313 transitions. [2025-01-09 04:33:46,376 INFO L78 Accepts]: Start accepts. Automaton has 3348 states and 4313 transitions. Word has length 209 [2025-01-09 04:33:46,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:33:46,378 INFO L471 AbstractCegarLoop]: Abstraction has 3348 states and 4313 transitions. [2025-01-09 04:33:46,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:33:46,378 INFO L276 IsEmpty]: Start isEmpty. Operand 3348 states and 4313 transitions. [2025-01-09 04:33:46,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 04:33:46,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:33:46,387 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:46,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:33:46,390 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:33:46,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:33:46,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2070802068, now seen corresponding path program 1 times [2025-01-09 04:33:46,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:33:46,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045600267] [2025-01-09 04:33:46,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:33:46,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:33:46,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 04:33:47,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 04:33:47,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:33:47,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:33:48,659 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:33:48,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:33:48,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045600267] [2025-01-09 04:33:48,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045600267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:33:48,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:33:48,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:33:48,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133514573] [2025-01-09 04:33:48,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:33:48,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:33:48,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:33:48,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:33:48,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:33:48,662 INFO L87 Difference]: Start difference. First operand 3348 states and 4313 transitions. Second operand has 5 states, 4 states have (on average 45.5) internal successors, (182), 5 states have internal predecessors, (182), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 04:33:51,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:33:51,395 INFO L93 Difference]: Finished difference Result 7065 states and 9162 transitions. [2025-01-09 04:33:51,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:33:51,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 45.5) internal successors, (182), 5 states have internal predecessors, (182), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 205 [2025-01-09 04:33:51,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:33:51,424 INFO L225 Difference]: With dead ends: 7065 [2025-01-09 04:33:51,424 INFO L226 Difference]: Without dead ends: 3722 [2025-01-09 04:33:51,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:33:51,445 INFO L435 NwaCegarLoop]: 3419 mSDtfsCounter, 3665 mSDsluCounter, 3345 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3665 SdHoareTripleChecker+Valid, 6764 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:33:51,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3665 Valid, 6764 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 04:33:51,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2025-01-09 04:33:51,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2025-01-09 04:33:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3720 states, 3027 states have (on average 1.2223323422530559) internal successors, (3700), 3072 states have internal predecessors, (3700), 574 states have call successors, (574), 118 states have call predecessors, (574), 118 states have return successors, (573), 553 states have call predecessors, (573), 573 states have call successors, (573) [2025-01-09 04:33:51,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 4847 transitions. [2025-01-09 04:33:51,606 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 4847 transitions. Word has length 205 [2025-01-09 04:33:51,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:33:51,607 INFO L471 AbstractCegarLoop]: Abstraction has 3720 states and 4847 transitions. [2025-01-09 04:33:51,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 45.5) internal successors, (182), 5 states have internal predecessors, (182), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 04:33:51,607 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 4847 transitions. [2025-01-09 04:33:51,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 04:33:51,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:33:51,613 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:51,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:33:51,613 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:33:51,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:33:51,614 INFO L85 PathProgramCache]: Analyzing trace with hash 522398467, now seen corresponding path program 1 times [2025-01-09 04:33:51,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:33:51,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845686646] [2025-01-09 04:33:51,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:33:51,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:33:51,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 04:33:52,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 04:33:52,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:33:52,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:33:52,538 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 04:33:52,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:33:52,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845686646] [2025-01-09 04:33:52,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845686646] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:33:52,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985213984] [2025-01-09 04:33:52,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:33:52,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:33:52,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:33:52,543 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:33:52,544 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:33:53,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 04:33:53,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 04:33:53,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:33:53,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:33:53,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 2846 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 04:33:53,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:33:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 04:33:54,042 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:33:54,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985213984] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:33:54,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:33:54,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-01-09 04:33:54,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922200755] [2025-01-09 04:33:54,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:33:54,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:33:54,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:33:54,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:33:54,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:33:54,044 INFO L87 Difference]: Start difference. First operand 3720 states and 4847 transitions. Second operand has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:33:56,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:33:56,625 INFO L93 Difference]: Finished difference Result 7672 states and 9979 transitions. [2025-01-09 04:33:56,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:33:56,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 208 [2025-01-09 04:33:56,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:33:56,648 INFO L225 Difference]: With dead ends: 7672 [2025-01-09 04:33:56,648 INFO L226 Difference]: Without dead ends: 3843 [2025-01-09 04:33:56,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:33:56,661 INFO L435 NwaCegarLoop]: 3597 mSDtfsCounter, 1465 mSDsluCounter, 8407 mSDsCounter, 0 mSdLazyCounter, 1603 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 12004 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:33:56,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 12004 Invalid, 1605 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2 Valid, 1603 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 04:33:56,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3843 states. [2025-01-09 04:33:56,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3843 to 3707. [2025-01-09 04:33:56,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3707 states, 3019 states have (on average 1.2209340841338192) internal successors, (3686), 3064 states have internal predecessors, (3686), 569 states have call successors, (569), 118 states have call predecessors, (569), 118 states have return successors, (568), 548 states have call predecessors, (568), 568 states have call successors, (568) [2025-01-09 04:33:56,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 4823 transitions. [2025-01-09 04:33:56,812 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 4823 transitions. Word has length 208 [2025-01-09 04:33:56,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:33:56,812 INFO L471 AbstractCegarLoop]: Abstraction has 3707 states and 4823 transitions. [2025-01-09 04:33:56,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:33:56,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 4823 transitions. [2025-01-09 04:33:56,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 04:33:56,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:33:56,818 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:56,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 04:33:57,018 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:33:57,019 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:33:57,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:33:57,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1749754574, now seen corresponding path program 1 times [2025-01-09 04:33:57,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:33:57,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41779934] [2025-01-09 04:33:57,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:33:57,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:33:57,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 04:33:57,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 04:33:57,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:33:57,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:33:58,111 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:33:58,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:33:58,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41779934] [2025-01-09 04:33:58,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41779934] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:33:58,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058762367] [2025-01-09 04:33:58,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:33:58,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:33:58,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:33:58,116 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:33:58,118 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:33:59,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 04:33:59,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 04:33:59,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:33:59,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:33:59,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 2848 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:33:59,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:33:59,554 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 04:33:59,555 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:33:59,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058762367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:33:59,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:33:59,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-01-09 04:33:59,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657036037] [2025-01-09 04:33:59,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:33:59,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:33:59,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:33:59,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:33:59,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:33:59,557 INFO L87 Difference]: Start difference. First operand 3707 states and 4823 transitions. Second operand has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:34:00,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:00,769 INFO L93 Difference]: Finished difference Result 7603 states and 9874 transitions. [2025-01-09 04:34:00,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:00,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 209 [2025-01-09 04:34:00,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:00,793 INFO L225 Difference]: With dead ends: 7603 [2025-01-09 04:34:00,793 INFO L226 Difference]: Without dead ends: 3835 [2025-01-09 04:34:00,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:34:00,805 INFO L435 NwaCegarLoop]: 3575 mSDtfsCounter, 1170 mSDsluCounter, 6449 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 10024 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:00,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 10024 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 04:34:00,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3835 states. [2025-01-09 04:34:00,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3835 to 3697. [2025-01-09 04:34:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3697 states, 3013 states have (on average 1.219714570195818) internal successors, (3675), 3058 states have internal predecessors, (3675), 565 states have call successors, (565), 118 states have call predecessors, (565), 118 states have return successors, (564), 544 states have call predecessors, (564), 564 states have call successors, (564) [2025-01-09 04:34:00,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3697 states to 3697 states and 4804 transitions. [2025-01-09 04:34:00,959 INFO L78 Accepts]: Start accepts. Automaton has 3697 states and 4804 transitions. Word has length 209 [2025-01-09 04:34:00,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:00,959 INFO L471 AbstractCegarLoop]: Abstraction has 3697 states and 4804 transitions. [2025-01-09 04:34:00,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:34:00,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3697 states and 4804 transitions. [2025-01-09 04:34:00,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 04:34:00,966 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:00,966 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:00,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 04:34:01,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:34:01,167 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:01,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:01,168 INFO L85 PathProgramCache]: Analyzing trace with hash -12706403, now seen corresponding path program 1 times [2025-01-09 04:34:01,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:01,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428525602] [2025-01-09 04:34:01,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:01,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:01,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 04:34:01,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 04:34:01,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:01,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:02,080 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:34:02,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:02,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428525602] [2025-01-09 04:34:02,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428525602] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:34:02,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166842026] [2025-01-09 04:34:02,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:02,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:34:02,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:34:02,083 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:34:02,087 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:34:02,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 04:34:03,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 04:34:03,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:03,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:03,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 2850 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:34:03,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:34:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:34:03,419 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:34:03,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166842026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:03,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:34:03,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-01-09 04:34:03,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864032052] [2025-01-09 04:34:03,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:03,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:34:03,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:03,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:34:03,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:34:03,421 INFO L87 Difference]: Start difference. First operand 3697 states and 4804 transitions. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:34:05,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:05,312 INFO L93 Difference]: Finished difference Result 8192 states and 10641 transitions. [2025-01-09 04:34:05,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:05,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 210 [2025-01-09 04:34:05,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:05,341 INFO L225 Difference]: With dead ends: 8192 [2025-01-09 04:34:05,341 INFO L226 Difference]: Without dead ends: 4500 [2025-01-09 04:34:05,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:34:05,356 INFO L435 NwaCegarLoop]: 3782 mSDtfsCounter, 1746 mSDsluCounter, 8865 mSDsCounter, 0 mSdLazyCounter, 1636 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1746 SdHoareTripleChecker+Valid, 12647 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:05,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1746 Valid, 12647 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1636 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 04:34:05,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4500 states. [2025-01-09 04:34:05,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4500 to 4171. [2025-01-09 04:34:05,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4171 states, 3355 states have (on average 1.235171385991058) internal successors, (4144), 3411 states have internal predecessors, (4144), 673 states have call successors, (673), 141 states have call predecessors, (673), 142 states have return successors, (673), 648 states have call predecessors, (673), 672 states have call successors, (673) [2025-01-09 04:34:05,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 5490 transitions. [2025-01-09 04:34:05,547 INFO L78 Accepts]: Start accepts. Automaton has 4171 states and 5490 transitions. Word has length 210 [2025-01-09 04:34:05,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:05,547 INFO L471 AbstractCegarLoop]: Abstraction has 4171 states and 5490 transitions. [2025-01-09 04:34:05,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:34:05,548 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 5490 transitions. [2025-01-09 04:34:05,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 04:34:05,556 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:05,557 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:05,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 04:34:05,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:34:05,758 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:05,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:05,758 INFO L85 PathProgramCache]: Analyzing trace with hash -586234271, now seen corresponding path program 1 times [2025-01-09 04:34:05,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:05,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049321363] [2025-01-09 04:34:05,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:05,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:06,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 04:34:06,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 04:34:06,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:06,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:06,604 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:34:06,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:06,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049321363] [2025-01-09 04:34:06,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049321363] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:34:06,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298444195] [2025-01-09 04:34:06,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:06,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:34:06,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:34:06,608 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:34:06,611 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:34:07,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 04:34:07,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 04:34:07,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:07,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:07,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 2848 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:34:07,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:34:08,000 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:34:08,000 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:34:08,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298444195] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:08,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:34:08,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-01-09 04:34:08,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537749505] [2025-01-09 04:34:08,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:08,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:34:08,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:08,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:34:08,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:34:08,002 INFO L87 Difference]: Start difference. First operand 4171 states and 5490 transitions. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:34:09,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:09,496 INFO L93 Difference]: Finished difference Result 8339 states and 10982 transitions. [2025-01-09 04:34:09,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:34:09,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 210 [2025-01-09 04:34:09,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:09,531 INFO L225 Difference]: With dead ends: 8339 [2025-01-09 04:34:09,531 INFO L226 Difference]: Without dead ends: 4173 [2025-01-09 04:34:09,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:34:09,553 INFO L435 NwaCegarLoop]: 2946 mSDtfsCounter, 1039 mSDsluCounter, 5755 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 8701 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:09,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 8701 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 04:34:09,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4173 states. [2025-01-09 04:34:09,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4173 to 4171. [2025-01-09 04:34:09,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4171 states, 3355 states have (on average 1.2348733233979137) internal successors, (4143), 3411 states have internal predecessors, (4143), 673 states have call successors, (673), 141 states have call predecessors, (673), 142 states have return successors, (673), 648 states have call predecessors, (673), 672 states have call successors, (673) [2025-01-09 04:34:09,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 5489 transitions. [2025-01-09 04:34:09,812 INFO L78 Accepts]: Start accepts. Automaton has 4171 states and 5489 transitions. Word has length 210 [2025-01-09 04:34:09,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:09,813 INFO L471 AbstractCegarLoop]: Abstraction has 4171 states and 5489 transitions. [2025-01-09 04:34:09,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:34:09,813 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 5489 transitions. [2025-01-09 04:34:09,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 04:34:09,823 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:09,824 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:09,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 04:34:10,024 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,SelfDestructingSolverStorable7 [2025-01-09 04:34:10,025 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:10,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:10,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1511219555, now seen corresponding path program 1 times [2025-01-09 04:34:10,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:10,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726205533] [2025-01-09 04:34:10,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:10,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:10,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 04:34:10,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 04:34:10,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:10,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:10,919 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 04:34:10,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:10,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726205533] [2025-01-09 04:34:10,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726205533] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:10,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:10,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:10,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416496135] [2025-01-09 04:34:10,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:10,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:10,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:10,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:10,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:10,921 INFO L87 Difference]: Start difference. First operand 4171 states and 5489 transitions. Second operand has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:34:13,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:13,450 INFO L93 Difference]: Finished difference Result 7857 states and 10278 transitions. [2025-01-09 04:34:13,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:34:13,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 220 [2025-01-09 04:34:13,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:13,474 INFO L225 Difference]: With dead ends: 7857 [2025-01-09 04:34:13,474 INFO L226 Difference]: Without dead ends: 3691 [2025-01-09 04:34:13,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:34:13,489 INFO L435 NwaCegarLoop]: 3489 mSDtfsCounter, 5730 mSDsluCounter, 4471 mSDsCounter, 0 mSdLazyCounter, 2089 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5730 SdHoareTripleChecker+Valid, 7960 SdHoareTripleChecker+Invalid, 2633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 2089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:13,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5730 Valid, 7960 Invalid, 2633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 2089 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 04:34:13,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3691 states. [2025-01-09 04:34:13,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3691 to 3689. [2025-01-09 04:34:13,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3689 states, 3008 states have (on average 1.2180851063829787) internal successors, (3664), 3053 states have internal predecessors, (3664), 562 states have call successors, (562), 118 states have call predecessors, (562), 118 states have return successors, (561), 541 states have call predecessors, (561), 561 states have call successors, (561) [2025-01-09 04:34:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3689 states to 3689 states and 4787 transitions. [2025-01-09 04:34:13,640 INFO L78 Accepts]: Start accepts. Automaton has 3689 states and 4787 transitions. Word has length 220 [2025-01-09 04:34:13,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:13,641 INFO L471 AbstractCegarLoop]: Abstraction has 3689 states and 4787 transitions. [2025-01-09 04:34:13,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:34:13,641 INFO L276 IsEmpty]: Start isEmpty. Operand 3689 states and 4787 transitions. [2025-01-09 04:34:13,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 04:34:13,646 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:13,646 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:13,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:34:13,647 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:13,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:13,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1809571231, now seen corresponding path program 1 times [2025-01-09 04:34:13,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:13,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874022755] [2025-01-09 04:34:13,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:13,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:14,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 04:34:14,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 04:34:14,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:14,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:14,601 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 04:34:14,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:14,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874022755] [2025-01-09 04:34:14,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874022755] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:34:14,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313687453] [2025-01-09 04:34:14,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:14,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:34:14,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:34:14,604 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:34:14,607 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:34:15,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 04:34:15,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 04:34:15,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:15,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:15,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 2876 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:34:15,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:34:15,920 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:34:15,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:34:15,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313687453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:15,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:34:15,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-01-09 04:34:15,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359325279] [2025-01-09 04:34:15,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:15,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:34:15,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:15,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:34:15,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:34:15,922 INFO L87 Difference]: Start difference. First operand 3689 states and 4787 transitions. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:34:17,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:17,808 INFO L93 Difference]: Finished difference Result 7373 states and 9573 transitions. [2025-01-09 04:34:17,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:34:17,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 220 [2025-01-09 04:34:17,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:17,831 INFO L225 Difference]: With dead ends: 7373 [2025-01-09 04:34:17,832 INFO L226 Difference]: Without dead ends: 3689 [2025-01-09 04:34:17,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:34:17,847 INFO L435 NwaCegarLoop]: 3063 mSDtfsCounter, 2498 mSDsluCounter, 4070 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2498 SdHoareTripleChecker+Valid, 7133 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:17,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2498 Valid, 7133 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 04:34:17,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2025-01-09 04:34:18,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3687. [2025-01-09 04:34:18,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3687 states, 3007 states have (on average 1.2178250748254074) internal successors, (3662), 3052 states have internal predecessors, (3662), 561 states have call successors, (561), 118 states have call predecessors, (561), 118 states have return successors, (560), 540 states have call predecessors, (560), 560 states have call successors, (560) [2025-01-09 04:34:18,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3687 states to 3687 states and 4783 transitions. [2025-01-09 04:34:18,039 INFO L78 Accepts]: Start accepts. Automaton has 3687 states and 4783 transitions. Word has length 220 [2025-01-09 04:34:18,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:18,040 INFO L471 AbstractCegarLoop]: Abstraction has 3687 states and 4783 transitions. [2025-01-09 04:34:18,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:34:18,040 INFO L276 IsEmpty]: Start isEmpty. Operand 3687 states and 4783 transitions. [2025-01-09 04:34:18,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 04:34:18,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:18,047 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:18,064 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:34:18,247 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,SelfDestructingSolverStorable9 [2025-01-09 04:34:18,248 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:18,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:18,249 INFO L85 PathProgramCache]: Analyzing trace with hash -434462741, now seen corresponding path program 1 times [2025-01-09 04:34:18,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:18,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610630510] [2025-01-09 04:34:18,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:18,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:18,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 04:34:18,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 04:34:18,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:18,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:19,016 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 04:34:19,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:19,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610630510] [2025-01-09 04:34:19,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610630510] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:19,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:19,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:19,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721168629] [2025-01-09 04:34:19,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:19,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:19,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:19,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:19,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:19,018 INFO L87 Difference]: Start difference. First operand 3687 states and 4783 transitions. Second operand has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:34:21,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:21,621 INFO L93 Difference]: Finished difference Result 7371 states and 9567 transitions. [2025-01-09 04:34:21,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:34:21,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 220 [2025-01-09 04:34:21,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:21,642 INFO L225 Difference]: With dead ends: 7371 [2025-01-09 04:34:21,642 INFO L226 Difference]: Without dead ends: 3689 [2025-01-09 04:34:21,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:34:21,656 INFO L435 NwaCegarLoop]: 3391 mSDtfsCounter, 5656 mSDsluCounter, 4451 mSDsCounter, 0 mSdLazyCounter, 2048 mSolverCounterSat, 572 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5656 SdHoareTripleChecker+Valid, 7842 SdHoareTripleChecker+Invalid, 2620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 572 IncrementalHoareTripleChecker+Valid, 2048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:21,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5656 Valid, 7842 Invalid, 2620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [572 Valid, 2048 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 04:34:21,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2025-01-09 04:34:21,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3687. [2025-01-09 04:34:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3687 states, 3007 states have (on average 1.2174925174592617) internal successors, (3661), 3052 states have internal predecessors, (3661), 561 states have call successors, (561), 118 states have call predecessors, (561), 118 states have return successors, (560), 540 states have call predecessors, (560), 560 states have call successors, (560) [2025-01-09 04:34:21,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3687 states to 3687 states and 4782 transitions. [2025-01-09 04:34:21,804 INFO L78 Accepts]: Start accepts. Automaton has 3687 states and 4782 transitions. Word has length 220 [2025-01-09 04:34:21,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:21,805 INFO L471 AbstractCegarLoop]: Abstraction has 3687 states and 4782 transitions. [2025-01-09 04:34:21,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:34:21,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3687 states and 4782 transitions. [2025-01-09 04:34:21,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-01-09 04:34:21,809 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:21,809 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:21,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:34:21,809 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:21,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:21,810 INFO L85 PathProgramCache]: Analyzing trace with hash 945504034, now seen corresponding path program 1 times [2025-01-09 04:34:21,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:21,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413851131] [2025-01-09 04:34:21,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:21,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:22,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 04:34:22,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 04:34:22,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:22,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:22,644 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 04:34:22,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:22,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413851131] [2025-01-09 04:34:22,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413851131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:22,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:22,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:22,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058353009] [2025-01-09 04:34:22,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:22,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:22,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:22,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:22,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:22,646 INFO L87 Difference]: Start difference. First operand 3687 states and 4782 transitions. Second operand has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10)