./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/rekh_nxt.2.M4-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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_nxt.2.M4-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 c3428ae6a0cff233befb72334b90ad9e2070ed1c51acfcfa2fe6d4fef2ceb1ff --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:25:51,795 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:25:51,845 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:25:51,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:25:51,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:25:51,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:25:51,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:25:51,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:25:51,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:25:51,881 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:25:51,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:25:51,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:25:51,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:25:51,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:25:51,883 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:25:51,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:25:51,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:25:51,883 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:25:51,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:25:51,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:25:51,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:25:51,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:25:51,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:25:51,884 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:25:51,884 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:25:51,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:25:51,884 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:25:51,884 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:25:51,884 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:25:51,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:25:51,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:25:51,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:25:51,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:25:51,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:25:51,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:25:51,885 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:25:51,885 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:25:51,885 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:25:51,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:25:51,885 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:25:51,885 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:25:51,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:25:51,885 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:25:51,885 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 -> c3428ae6a0cff233befb72334b90ad9e2070ed1c51acfcfa2fe6d4fef2ceb1ff [2025-02-05 16:25:52,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:25:52,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:25:52,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:25:52,134 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:25:52,134 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:25:52,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/rekh_nxt.2.M4-1.c [2025-02-05 16:25:53,335 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74b1dad3b/cd2b19390b6a42afb73d05384dcae3bc/FLAG0048f2e7e [2025-02-05 16:25:53,712 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:25:53,714 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_nxt.2.M4-1.c [2025-02-05 16:25:53,734 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74b1dad3b/cd2b19390b6a42afb73d05384dcae3bc/FLAG0048f2e7e [2025-02-05 16:25:53,928 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74b1dad3b/cd2b19390b6a42afb73d05384dcae3bc [2025-02-05 16:25:53,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:25:53,931 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:25:53,931 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:25:53,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:25:53,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:25:53,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:25:53" (1/1) ... [2025-02-05 16:25:53,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bcc66c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:53, skipping insertion in model container [2025-02-05 16:25:53,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:25:53" (1/1) ... [2025-02-05 16:25:53,961 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:25:54,075 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_nxt.2.M4-1.c[1682,1695] [2025-02-05 16:25:54,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:25:54,276 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:25:54,282 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"/tmp/aaaa/nxt.ok2.i","-S") [42] [2025-02-05 16:25:54,286 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_nxt.2.M4-1.c[1682,1695] [2025-02-05 16:25:54,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:25:54,440 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:25:54,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:54 WrapperNode [2025-02-05 16:25:54,441 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:25:54,442 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:25:54,442 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:25:54,442 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:25:54,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:54" (1/1) ... [2025-02-05 16:25:54,478 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:54" (1/1) ... [2025-02-05 16:25:54,604 INFO L138 Inliner]: procedures = 56, calls = 2288, calls flagged for inlining = 21, calls inlined = 21, statements flattened = 4967 [2025-02-05 16:25:54,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:25:54,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:25:54,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:25:54,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:25:54,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:54" (1/1) ... [2025-02-05 16:25:54,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:54" (1/1) ... [2025-02-05 16:25:54,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:54" (1/1) ... [2025-02-05 16:25:54,713 INFO L175 MemorySlicer]: Split 1599 memory accesses to 15 slices as follows [8, 2, 277, 285, 113, 113, 186, 203, 186, 203, 8, 7, 2, 4, 2]. 18 percent of accesses are in the largest equivalence class. The 220 initializations are split as follows [0, 2, 27, 27, 27, 27, 27, 27, 27, 27, 0, 2, 0, 0, 0]. The 235 writes are split as follows [4, 0, 27, 27, 27, 27, 31, 26, 31, 26, 4, 3, 1, 0, 1]. [2025-02-05 16:25:54,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:54" (1/1) ... [2025-02-05 16:25:54,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:54" (1/1) ... [2025-02-05 16:25:54,827 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:54" (1/1) ... [2025-02-05 16:25:54,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:54" (1/1) ... [2025-02-05 16:25:54,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:54" (1/1) ... [2025-02-05 16:25:54,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:54" (1/1) ... [2025-02-05 16:25:54,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:25:54,901 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:25:54,902 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:25:54,902 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:25:54,902 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:54" (1/1) ... [2025-02-05 16:25:54,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:25:54,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:25:54,928 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-02-05 16:25:54,930 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-02-05 16:25:54,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:25:54,957 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t2 [2025-02-05 16:25:54,957 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t2 [2025-02-05 16:25:54,957 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_nxtway_gs_mode [2025-02-05 16:25:54,957 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_nxtway_gs_mode [2025-02-05 16:25:54,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 16:25:54,957 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t0 [2025-02-05 16:25:54,957 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t0 [2025-02-05 16:25:54,957 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t1 [2025-02-05 16:25:54,957 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t1 [2025-02-05 16:25:54,957 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_obstacle_flag [2025-02-05 16:25:54,957 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_obstacle_flag [2025-02-05 16:25:54,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 16:25:54,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 16:25:54,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 16:25:54,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-05 16:25:54,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-05 16:25:54,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-05 16:25:54,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-05 16:25:54,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-05 16:25:54,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-05 16:25:54,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-05 16:25:54,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-05 16:25:54,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-05 16:25:54,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-05 16:25:54,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-05 16:25:54,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-05 16:25:54,958 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_count [2025-02-05 16:25:54,958 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_count [2025-02-05 16:25:54,958 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_get_gyro_sensor [2025-02-05 16:25:54,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_get_gyro_sensor [2025-02-05 16:25:54,958 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts1 [2025-02-05 16:25:54,961 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts1 [2025-02-05 16:25:54,961 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts2 [2025-02-05 16:25:54,961 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts2 [2025-02-05 16:25:54,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_hyperperiod [2025-02-05 16:25:54,962 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_hyperperiod [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_Background [2025-02-05 16:25:54,962 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_Background [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-02-05 16:25:54,962 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_speed [2025-02-05 16:25:54,962 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_speed [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 16:25:54,962 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 16:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 16:25:54,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 16:25:54,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 16:25:54,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 16:25:54,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 16:25:54,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 16:25:54,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 16:25:54,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 16:25:54,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 16:25:54,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:25:54,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:25:54,963 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_get_systick_ms [2025-02-05 16:25:54,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_get_systick_ms [2025-02-05 16:25:54,963 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_get_count [2025-02-05 16:25:54,963 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_get_count [2025-02-05 16:25:54,963 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtway_gs_mode [2025-02-05 16:25:54,963 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtway_gs_mode [2025-02-05 16:25:55,277 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:25:55,278 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:25:55,836 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L82: call ULTIMATE.dealloc(balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset);havoc balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset;call ULTIMATE.dealloc(balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset);havoc balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset; [2025-02-05 16:25:55,837 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L208: call ULTIMATE.dealloc(OSEK_Task_ts1_~#pwm_l~0#1.base, OSEK_Task_ts1_~#pwm_l~0#1.offset);havoc OSEK_Task_ts1_~#pwm_l~0#1.base, OSEK_Task_ts1_~#pwm_l~0#1.offset;call ULTIMATE.dealloc(OSEK_Task_ts1_~#pwm_r~0#1.base, OSEK_Task_ts1_~#pwm_r~0#1.offset);havoc OSEK_Task_ts1_~#pwm_r~0#1.base, OSEK_Task_ts1_~#pwm_r~0#1.offset; [2025-02-05 16:26:00,180 INFO L? ?]: Removed 351 outVars from TransFormulas that were not future-live. [2025-02-05 16:26:00,180 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:26:00,215 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:26:00,215 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:26:00,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:26:00 BoogieIcfgContainer [2025-02-05 16:26:00,215 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:26:00,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:26:00,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:26:00,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:26:00,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:25:53" (1/3) ... [2025-02-05 16:26:00,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1470d9c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:26:00, skipping insertion in model container [2025-02-05 16:26:00,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:25:54" (2/3) ... [2025-02-05 16:26:00,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1470d9c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:26:00, skipping insertion in model container [2025-02-05 16:26:00,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:26:00" (3/3) ... [2025-02-05 16:26:00,222 INFO L128 eAbstractionObserver]: Analyzing ICFG rekh_nxt.2.M4-1.c [2025-02-05 16:26:00,231 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:26:00,233 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rekh_nxt.2.M4-1.c that has 18 procedures, 1536 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 16:26:00,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:26:00,298 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;@30ba18e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:26:00,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:26:00,304 INFO L276 IsEmpty]: Start isEmpty. Operand has 1536 states, 877 states have (on average 1.2565564424173319) internal successors, (1102), 1006 states have internal predecessors, (1102), 640 states have call successors, (640), 17 states have call predecessors, (640), 17 states have return successors, (640), 541 states have call predecessors, (640), 640 states have call successors, (640) [2025-02-05 16:26:00,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1311 [2025-02-05 16:26:00,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:00,350 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:26:00,350 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:00,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:00,354 INFO L85 PathProgramCache]: Analyzing trace with hash 729040902, now seen corresponding path program 1 times [2025-02-05 16:26:00,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:00,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531485596] [2025-02-05 16:26:00,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:00,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:00,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1310 statements into 1 equivalence classes. [2025-02-05 16:26:00,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1310 of 1310 statements. [2025-02-05 16:26:00,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:00,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:01,597 INFO L134 CoverageAnalysis]: Checked inductivity of 86944 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 86528 trivial. 0 not checked. [2025-02-05 16:26:01,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:01,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531485596] [2025-02-05 16:26:01,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531485596] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:26:01,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818767873] [2025-02-05 16:26:01,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:01,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:26:01,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:26:01,607 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-02-05 16:26:01,607 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-02-05 16:26:02,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1310 statements into 1 equivalence classes. [2025-02-05 16:26:02,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1310 of 1310 statements. [2025-02-05 16:26:02,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:02,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:02,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 3994 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 16:26:02,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:26:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 86944 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 86528 trivial. 0 not checked. [2025-02-05 16:26:02,856 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:26:02,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818767873] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:02,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:26:02,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 16:26:02,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023347650] [2025-02-05 16:26:02,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:02,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 16:26:02,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:02,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 16:26:02,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:26:02,891 INFO L87 Difference]: Start difference. First operand has 1536 states, 877 states have (on average 1.2565564424173319) internal successors, (1102), 1006 states have internal predecessors, (1102), 640 states have call successors, (640), 17 states have call predecessors, (640), 17 states have return successors, (640), 541 states have call predecessors, (640), 640 states have call successors, (640) Second operand has 2 states, 2 states have (on average 132.0) internal successors, (264), 2 states have internal predecessors, (264), 2 states have call successors, (213), 2 states have call predecessors, (213), 1 states have return successors, (211), 1 states have call predecessors, (211), 2 states have call successors, (211) [2025-02-05 16:26:03,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:03,077 INFO L93 Difference]: Finished difference Result 3067 states and 5382 transitions. [2025-02-05 16:26:03,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 16:26:03,079 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 132.0) internal successors, (264), 2 states have internal predecessors, (264), 2 states have call successors, (213), 2 states have call predecessors, (213), 1 states have return successors, (211), 1 states have call predecessors, (211), 2 states have call successors, (211) Word has length 1310 [2025-02-05 16:26:03,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:03,101 INFO L225 Difference]: With dead ends: 3067 [2025-02-05 16:26:03,102 INFO L226 Difference]: Without dead ends: 1531 [2025-02-05 16:26:03,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1311 GetRequests, 1311 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-02-05 16:26:03,126 INFO L435 NwaCegarLoop]: 2380 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, 2380 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-02-05 16:26:03,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:26:03,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2025-02-05 16:26:03,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1531. [2025-02-05 16:26:03,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 873 states have (on average 1.2554410080183276) internal successors, (1096), 1002 states have internal predecessors, (1096), 640 states have call successors, (640), 17 states have call predecessors, (640), 17 states have return successors, (639), 540 states have call predecessors, (639), 639 states have call successors, (639) [2025-02-05 16:26:03,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 2375 transitions. [2025-02-05 16:26:03,406 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 2375 transitions. Word has length 1310 [2025-02-05 16:26:03,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:03,406 INFO L471 AbstractCegarLoop]: Abstraction has 1531 states and 2375 transitions. [2025-02-05 16:26:03,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 132.0) internal successors, (264), 2 states have internal predecessors, (264), 2 states have call successors, (213), 2 states have call predecessors, (213), 1 states have return successors, (211), 1 states have call predecessors, (211), 2 states have call successors, (211) [2025-02-05 16:26:03,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2375 transitions. [2025-02-05 16:26:03,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1311 [2025-02-05 16:26:03,440 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:03,440 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:26:03,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 16:26:03,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 16:26:03,645 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:03,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:03,647 INFO L85 PathProgramCache]: Analyzing trace with hash -755563807, now seen corresponding path program 1 times [2025-02-05 16:26:03,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:03,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346808907] [2025-02-05 16:26:03,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:03,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:03,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1310 statements into 1 equivalence classes. [2025-02-05 16:26:04,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1310 of 1310 statements. [2025-02-05 16:26:04,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:04,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:04,902 INFO L134 CoverageAnalysis]: Checked inductivity of 86944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86944 trivial. 0 not checked. [2025-02-05 16:26:04,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:04,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346808907] [2025-02-05 16:26:04,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346808907] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:04,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:04,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:26:04,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952418636] [2025-02-05 16:26:04,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:04,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:26:04,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:04,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:26:04,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:26:04,909 INFO L87 Difference]: Start difference. First operand 1531 states and 2375 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 2 states have call successors, (213), 2 states have call predecessors, (213), 2 states have return successors, (211), 2 states have call predecessors, (211), 2 states have call successors, (211) [2025-02-05 16:26:05,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:05,018 INFO L93 Difference]: Finished difference Result 3057 states and 4771 transitions. [2025-02-05 16:26:05,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:26:05,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 2 states have call successors, (213), 2 states have call predecessors, (213), 2 states have return successors, (211), 2 states have call predecessors, (211), 2 states have call successors, (211) Word has length 1310 [2025-02-05 16:26:05,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:05,037 INFO L225 Difference]: With dead ends: 3057 [2025-02-05 16:26:05,038 INFO L226 Difference]: Without dead ends: 1531 [2025-02-05 16:26:05,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:26:05,049 INFO L435 NwaCegarLoop]: 2373 mSDtfsCounter, 0 mSDsluCounter, 2363 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4736 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:05,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4736 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:26:05,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2025-02-05 16:26:05,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1531. [2025-02-05 16:26:05,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 873 states have (on average 1.254295532646048) internal successors, (1095), 1002 states have internal predecessors, (1095), 640 states have call successors, (640), 17 states have call predecessors, (640), 17 states have return successors, (639), 540 states have call predecessors, (639), 639 states have call successors, (639) [2025-02-05 16:26:05,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 2374 transitions. [2025-02-05 16:26:05,260 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 2374 transitions. Word has length 1310 [2025-02-05 16:26:05,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:05,265 INFO L471 AbstractCegarLoop]: Abstraction has 1531 states and 2374 transitions. [2025-02-05 16:26:05,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 2 states have call successors, (213), 2 states have call predecessors, (213), 2 states have return successors, (211), 2 states have call predecessors, (211), 2 states have call successors, (211) [2025-02-05 16:26:05,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2374 transitions. [2025-02-05 16:26:05,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1320 [2025-02-05 16:26:05,278 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:05,279 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:26:05,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:26:05,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:05,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:05,282 INFO L85 PathProgramCache]: Analyzing trace with hash -630905306, now seen corresponding path program 1 times [2025-02-05 16:26:05,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:05,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219068240] [2025-02-05 16:26:05,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:05,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:05,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1319 statements into 1 equivalence classes. [2025-02-05 16:26:05,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1319 of 1319 statements. [2025-02-05 16:26:05,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:05,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:08,550 INFO L134 CoverageAnalysis]: Checked inductivity of 86944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86944 trivial. 0 not checked. [2025-02-05 16:26:08,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:08,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219068240] [2025-02-05 16:26:08,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219068240] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:08,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:08,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:26:08,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933419125] [2025-02-05 16:26:08,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:08,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:26:08,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:08,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:26:08,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:26:08,555 INFO L87 Difference]: Start difference. First operand 1531 states and 2374 transitions. Second operand has 5 states, 4 states have (on average 66.75) internal successors, (267), 5 states have internal predecessors, (267), 4 states have call successors, (215), 2 states have call predecessors, (215), 2 states have return successors, (213), 3 states have call predecessors, (213), 4 states have call successors, (213) [2025-02-05 16:26:12,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:12,021 INFO L93 Difference]: Finished difference Result 3768 states and 5831 transitions. [2025-02-05 16:26:12,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:26:12,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 66.75) internal successors, (267), 5 states have internal predecessors, (267), 4 states have call successors, (215), 2 states have call predecessors, (215), 2 states have return successors, (213), 3 states have call predecessors, (213), 4 states have call successors, (213) Word has length 1319 [2025-02-05 16:26:12,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:12,048 INFO L225 Difference]: With dead ends: 3768 [2025-02-05 16:26:12,048 INFO L226 Difference]: Without dead ends: 2242 [2025-02-05 16:26:12,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-02-05 16:26:12,065 INFO L435 NwaCegarLoop]: 3415 mSDtfsCounter, 3402 mSDsluCounter, 2404 mSDsCounter, 0 mSdLazyCounter, 2984 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3402 SdHoareTripleChecker+Valid, 5819 SdHoareTripleChecker+Invalid, 3012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:12,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3402 Valid, 5819 Invalid, 3012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2984 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-05 16:26:12,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2025-02-05 16:26:12,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2239. [2025-02-05 16:26:12,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2239 states, 1297 states have (on average 1.2289899768696992) internal successors, (1594), 1426 states have internal predecessors, (1594), 919 states have call successors, (919), 23 states have call predecessors, (919), 22 states have return successors, (918), 818 states have call predecessors, (918), 918 states have call successors, (918) [2025-02-05 16:26:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2239 states to 2239 states and 3431 transitions. [2025-02-05 16:26:12,432 INFO L78 Accepts]: Start accepts. Automaton has 2239 states and 3431 transitions. Word has length 1319 [2025-02-05 16:26:12,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:12,435 INFO L471 AbstractCegarLoop]: Abstraction has 2239 states and 3431 transitions. [2025-02-05 16:26:12,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 66.75) internal successors, (267), 5 states have internal predecessors, (267), 4 states have call successors, (215), 2 states have call predecessors, (215), 2 states have return successors, (213), 3 states have call predecessors, (213), 4 states have call successors, (213) [2025-02-05 16:26:12,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2239 states and 3431 transitions. [2025-02-05 16:26:12,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1324 [2025-02-05 16:26:12,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:12,455 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:26:12,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:26:12,455 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:12,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:12,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1444016676, now seen corresponding path program 1 times [2025-02-05 16:26:12,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:12,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320368138] [2025-02-05 16:26:12,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:12,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:12,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1323 statements into 1 equivalence classes. [2025-02-05 16:26:12,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1323 of 1323 statements. [2025-02-05 16:26:12,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:12,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:13,936 INFO L134 CoverageAnalysis]: Checked inductivity of 86944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86944 trivial. 0 not checked. [2025-02-05 16:26:13,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:13,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320368138] [2025-02-05 16:26:13,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320368138] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:13,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:13,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:26:13,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266671435] [2025-02-05 16:26:13,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:13,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:26:13,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:13,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:26:13,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:26:13,943 INFO L87 Difference]: Start difference. First operand 2239 states and 3431 transitions. Second operand has 5 states, 4 states have (on average 67.25) internal successors, (269), 5 states have internal predecessors, (269), 4 states have call successors, (216), 2 states have call predecessors, (216), 2 states have return successors, (214), 3 states have call predecessors, (214), 4 states have call successors, (214) [2025-02-05 16:26:17,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:17,142 INFO L93 Difference]: Finished difference Result 4004 states and 6177 transitions. [2025-02-05 16:26:17,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:26:17,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 67.25) internal successors, (269), 5 states have internal predecessors, (269), 4 states have call successors, (216), 2 states have call predecessors, (216), 2 states have return successors, (214), 3 states have call predecessors, (214), 4 states have call successors, (214) Word has length 1323 [2025-02-05 16:26:17,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:17,164 INFO L225 Difference]: With dead ends: 4004 [2025-02-05 16:26:17,165 INFO L226 Difference]: Without dead ends: 2238 [2025-02-05 16:26:17,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:26:17,179 INFO L435 NwaCegarLoop]: 3408 mSDtfsCounter, 4084 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 1900 mSolverCounterSat, 830 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4084 SdHoareTripleChecker+Valid, 4952 SdHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 830 IncrementalHoareTripleChecker+Valid, 1900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:17,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4084 Valid, 4952 Invalid, 2730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [830 Valid, 1900 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-05 16:26:17,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2238 states. [2025-02-05 16:26:17,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2238 to 2235. [2025-02-05 16:26:17,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2235 states, 1295 states have (on average 1.2277992277992278) internal successors, (1590), 1424 states have internal predecessors, (1590), 917 states have call successors, (917), 23 states have call predecessors, (917), 22 states have return successors, (916), 816 states have call predecessors, (916), 916 states have call successors, (916) [2025-02-05 16:26:17,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 3423 transitions. [2025-02-05 16:26:17,456 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 3423 transitions. Word has length 1323 [2025-02-05 16:26:17,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:17,458 INFO L471 AbstractCegarLoop]: Abstraction has 2235 states and 3423 transitions. [2025-02-05 16:26:17,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 67.25) internal successors, (269), 5 states have internal predecessors, (269), 4 states have call successors, (216), 2 states have call predecessors, (216), 2 states have return successors, (214), 3 states have call predecessors, (214), 4 states have call successors, (214) [2025-02-05 16:26:17,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 3423 transitions. [2025-02-05 16:26:17,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1325 [2025-02-05 16:26:17,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:17,474 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:26:17,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:26:17,475 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:17,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:17,476 INFO L85 PathProgramCache]: Analyzing trace with hash 551782380, now seen corresponding path program 1 times [2025-02-05 16:26:17,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:17,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207624176] [2025-02-05 16:26:17,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:17,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:17,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1324 statements into 1 equivalence classes. [2025-02-05 16:26:17,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1324 of 1324 statements. [2025-02-05 16:26:17,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:17,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:19,595 INFO L134 CoverageAnalysis]: Checked inductivity of 86944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86944 trivial. 0 not checked. [2025-02-05 16:26:19,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:19,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207624176] [2025-02-05 16:26:19,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207624176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:19,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:19,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:26:19,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714438466] [2025-02-05 16:26:19,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:19,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:26:19,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:19,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:26:19,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:26:19,605 INFO L87 Difference]: Start difference. First operand 2235 states and 3423 transitions. Second operand has 6 states, 6 states have (on average 45.0) internal successors, (270), 5 states have internal predecessors, (270), 3 states have call successors, (216), 3 states have call predecessors, (216), 2 states have return successors, (214), 3 states have call predecessors, (214), 3 states have call successors, (214) [2025-02-05 16:26:23,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:23,389 INFO L93 Difference]: Finished difference Result 3670 states and 5673 transitions. [2025-02-05 16:26:23,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:26:23,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.0) internal successors, (270), 5 states have internal predecessors, (270), 3 states have call successors, (216), 3 states have call predecessors, (216), 2 states have return successors, (214), 3 states have call predecessors, (214), 3 states have call successors, (214) Word has length 1324 [2025-02-05 16:26:23,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:23,416 INFO L225 Difference]: With dead ends: 3670 [2025-02-05 16:26:23,416 INFO L226 Difference]: Without dead ends: 3668 [2025-02-05 16:26:23,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:26:23,418 INFO L435 NwaCegarLoop]: 2673 mSDtfsCounter, 3939 mSDsluCounter, 6150 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 1811 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4249 SdHoareTripleChecker+Valid, 8823 SdHoareTripleChecker+Invalid, 3468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1811 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:23,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4249 Valid, 8823 Invalid, 3468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1811 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-02-05 16:26:23,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3668 states. [2025-02-05 16:26:23,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3668 to 3640. [2025-02-05 16:26:23,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3640 states, 2090 states have (on average 1.239712918660287) internal successors, (2591), 2343 states have internal predecessors, (2591), 1513 states have call successors, (1513), 36 states have call predecessors, (1513), 36 states have return successors, (1540), 1315 states have call predecessors, (1540), 1511 states have call successors, (1540) [2025-02-05 16:26:23,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3640 states to 3640 states and 5644 transitions. [2025-02-05 16:26:23,917 INFO L78 Accepts]: Start accepts. Automaton has 3640 states and 5644 transitions. Word has length 1324 [2025-02-05 16:26:23,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:23,919 INFO L471 AbstractCegarLoop]: Abstraction has 3640 states and 5644 transitions. [2025-02-05 16:26:23,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.0) internal successors, (270), 5 states have internal predecessors, (270), 3 states have call successors, (216), 3 states have call predecessors, (216), 2 states have return successors, (214), 3 states have call predecessors, (214), 3 states have call successors, (214) [2025-02-05 16:26:23,923 INFO L276 IsEmpty]: Start isEmpty. Operand 3640 states and 5644 transitions. [2025-02-05 16:26:23,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1330 [2025-02-05 16:26:23,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:23,944 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:26:23,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:26:23,944 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:23,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:23,945 INFO L85 PathProgramCache]: Analyzing trace with hash 246644488, now seen corresponding path program 1 times [2025-02-05 16:26:23,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:23,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098885851] [2025-02-05 16:26:23,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:23,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:24,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1329 statements into 1 equivalence classes. [2025-02-05 16:26:29,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1329 of 1329 statements. [2025-02-05 16:26:29,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:29,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 86947 backedges. 426 proven. 198 refuted. 0 times theorem prover too weak. 86323 trivial. 0 not checked. [2025-02-05 16:26:32,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:32,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098885851] [2025-02-05 16:26:32,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098885851] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:26:32,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568418823] [2025-02-05 16:26:32,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:32,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:26:32,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:26:32,217 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-02-05 16:26:32,219 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-02-05 16:26:32,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1329 statements into 1 equivalence classes. [2025-02-05 16:26:35,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1329 of 1329 statements. [2025-02-05 16:26:35,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:35,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:35,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 4054 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-05 16:26:35,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:26:35,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 301 treesize of output 1 [2025-02-05 16:26:36,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-02-05 16:26:36,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 16:26:36,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 26 [2025-02-05 16:26:36,660 INFO L134 CoverageAnalysis]: Checked inductivity of 86947 backedges. 37070 proven. 96 refuted. 0 times theorem prover too weak. 49781 trivial. 0 not checked. [2025-02-05 16:26:36,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:26:37,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2025-02-05 16:26:38,023 INFO L134 CoverageAnalysis]: Checked inductivity of 86947 backedges. 1377 proven. 486 refuted. 0 times theorem prover too weak. 85084 trivial. 0 not checked. [2025-02-05 16:26:38,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568418823] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:26:38,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:26:38,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 15] total 34 [2025-02-05 16:26:38,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073612048] [2025-02-05 16:26:38,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:26:38,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-05 16:26:38,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:38,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-05 16:26:38,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=951, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 16:26:38,028 INFO L87 Difference]: Start difference. First operand 3640 states and 5644 transitions. Second operand has 34 states, 27 states have (on average 16.0) internal successors, (432), 33 states have internal predecessors, (432), 15 states have call successors, (348), 6 states have call predecessors, (348), 9 states have return successors, (346), 10 states have call predecessors, (346), 15 states have call successors, (346) [2025-02-05 16:26:39,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:26:40,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:26:41,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:26:44,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:26:46,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:26:50,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:26:51,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:26:53,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:27:09,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:27:13,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []