./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i -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 eb2eb63835edf753d5a467feb7a4cdd6d105155177d7d0cab8bf29c1b74dbaf6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:38:42,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:38:42,095 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 20:38:42,110 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:38:42,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:38:42,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:38:42,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:38:42,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:38:42,142 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:38:42,142 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:38:42,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:38:42,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:38:42,143 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:38:42,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:38:42,143 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:38:42,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:38:42,143 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:38:42,143 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 20:38:42,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:38:42,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 20:38:42,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:38:42,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:38:42,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:38:42,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:38:42,144 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 20:38:42,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:38:42,144 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:38:42,144 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:38:42,145 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:38:42,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:38:42,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:38:42,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:38:42,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:38:42,145 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:38:42,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:38:42,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:38:42,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:38:42,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:38:42,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:38:42,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:38:42,146 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:38:42,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:38:42,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:38:42,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:38:42,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:38:42,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:38:42,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:38:42,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:38:42,147 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 -> eb2eb63835edf753d5a467feb7a4cdd6d105155177d7d0cab8bf29c1b74dbaf6 [2025-01-09 20:38:42,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:38:42,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:38:42,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:38:42,436 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:38:42,437 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:38:42,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i [2025-01-09 20:38:43,791 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40353d2ae/6a2e3f49bf5a47b8be1c61f1addff5ee/FLAG9b9e75479 [2025-01-09 20:38:44,161 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:38:44,162 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i [2025-01-09 20:38:44,176 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40353d2ae/6a2e3f49bf5a47b8be1c61f1addff5ee/FLAG9b9e75479 [2025-01-09 20:38:44,192 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40353d2ae/6a2e3f49bf5a47b8be1c61f1addff5ee [2025-01-09 20:38:44,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:38:44,196 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:38:44,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:38:44,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:38:44,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:38:44,204 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:38:44" (1/1) ... [2025-01-09 20:38:44,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@271433ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:38:44, skipping insertion in model container [2025-01-09 20:38:44,205 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:38:44" (1/1) ... [2025-01-09 20:38:44,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:38:44,511 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/uthash-2.0.2/uthash_BER_test3-1.i[33021,33034] [2025-01-09 20:38:44,615 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/uthash-2.0.2/uthash_BER_test3-1.i[44590,44603] [2025-01-09 20:38:44,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:38:44,642 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:38:44,696 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/uthash-2.0.2/uthash_BER_test3-1.i[33021,33034] [2025-01-09 20:38:44,771 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/uthash-2.0.2/uthash_BER_test3-1.i[44590,44603] [2025-01-09 20:38:44,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:38:44,814 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:38:44,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:38:44 WrapperNode [2025-01-09 20:38:44,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:38:44,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:38:44,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:38:44,818 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:38:44,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:38:44" (1/1) ... [2025-01-09 20:38:44,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:38:44" (1/1) ... [2025-01-09 20:38:44,960 INFO L138 Inliner]: procedures = 177, calls = 277, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1410 [2025-01-09 20:38:44,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:38:44,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:38:44,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:38:44,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:38:44,972 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:38:44" (1/1) ... [2025-01-09 20:38:44,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:38:44" (1/1) ... [2025-01-09 20:38:44,988 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:38:44" (1/1) ... [2025-01-09 20:38:45,069 INFO L175 MemorySlicer]: Split 255 memory accesses to 3 slices as follows [34, 2, 219]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 54 writes are split as follows [4, 0, 50]. [2025-01-09 20:38:45,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:38:44" (1/1) ... [2025-01-09 20:38:45,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:38:44" (1/1) ... [2025-01-09 20:38:45,122 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:38:44" (1/1) ... [2025-01-09 20:38:45,128 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:38:44" (1/1) ... [2025-01-09 20:38:45,146 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:38:44" (1/1) ... [2025-01-09 20:38:45,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:38:44" (1/1) ... [2025-01-09 20:38:45,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:38:44" (1/1) ... [2025-01-09 20:38:45,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:38:45,180 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:38:45,180 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:38:45,180 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:38:45,182 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:38:44" (1/1) ... [2025-01-09 20:38:45,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:38:45,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:38:45,212 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 20:38:45,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 20:38:45,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:38:45,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:38:45,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:38:45,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 20:38:45,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 20:38:45,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:38:45,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:38:45,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:38:45,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 20:38:45,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 20:38:45,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 20:38:45,245 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 20:38:45,245 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 20:38:45,245 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 20:38:45,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:38:45,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:38:45,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:38:45,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:38:45,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:38:45,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:38:45,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:38:45,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:38:45,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:38:45,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:38:45,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:38:45,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:38:45,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:38:45,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:38:45,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:38:45,485 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:38:45,487 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:38:47,025 INFO L? ?]: Removed 322 outVars from TransFormulas that were not future-live. [2025-01-09 20:38:47,026 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:38:47,051 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:38:47,052 INFO L312 CfgBuilder]: Removed 31 assume(true) statements. [2025-01-09 20:38:47,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:38:47 BoogieIcfgContainer [2025-01-09 20:38:47,054 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:38:47,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:38:47,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:38:47,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:38:47,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:38:44" (1/3) ... [2025-01-09 20:38:47,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c542f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:38:47, skipping insertion in model container [2025-01-09 20:38:47,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:38:44" (2/3) ... [2025-01-09 20:38:47,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c542f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:38:47, skipping insertion in model container [2025-01-09 20:38:47,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:38:47" (3/3) ... [2025-01-09 20:38:47,062 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test3-1.i [2025-01-09 20:38:47,074 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:38:47,075 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test3-1.i that has 5 procedures, 417 locations, 1 initial locations, 38 loop locations, and 2 error locations. [2025-01-09 20:38:47,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:38:47,148 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;@73ae6e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:38:47,149 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 20:38:47,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 409 states, 396 states have (on average 1.6161616161616161) internal successors, (640), 403 states have internal predecessors, (640), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:38:47,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 20:38:47,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:38:47,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:38:47,161 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:38:47,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:38:47,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1337802752, now seen corresponding path program 1 times [2025-01-09 20:38:47,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:38:47,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151409734] [2025-01-09 20:38:47,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:38:47,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:38:47,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 20:38:47,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 20:38:47,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:38:47,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:38:47,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:38:47,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:38:47,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151409734] [2025-01-09 20:38:47,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151409734] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:38:47,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:38:47,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 20:38:47,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575726416] [2025-01-09 20:38:47,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:38:47,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 20:38:47,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:38:47,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 20:38:47,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:38:47,350 INFO L87 Difference]: Start difference. First operand has 409 states, 396 states have (on average 1.6161616161616161) internal successors, (640), 403 states have internal predecessors, (640), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:38:47,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:38:47,420 INFO L93 Difference]: Finished difference Result 816 states and 1315 transitions. [2025-01-09 20:38:47,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 20:38:47,422 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 20:38:47,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:38:47,432 INFO L225 Difference]: With dead ends: 816 [2025-01-09 20:38:47,433 INFO L226 Difference]: Without dead ends: 406 [2025-01-09 20:38:47,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:38:47,439 INFO L435 NwaCegarLoop]: 592 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, 592 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:38:47,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:38:47,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-01-09 20:38:47,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2025-01-09 20:38:47,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 394 states have (on average 1.4543147208121827) internal successors, (573), 400 states have internal predecessors, (573), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:38:47,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 589 transitions. [2025-01-09 20:38:47,508 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 589 transitions. Word has length 9 [2025-01-09 20:38:47,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:38:47,508 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 589 transitions. [2025-01-09 20:38:47,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:38:47,509 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 589 transitions. [2025-01-09 20:38:47,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 20:38:47,510 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:38:47,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:38:47,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:38:47,510 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:38:47,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:38:47,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1340330682, now seen corresponding path program 1 times [2025-01-09 20:38:47,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:38:47,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597452952] [2025-01-09 20:38:47,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:38:47,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:38:47,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 20:38:47,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 20:38:47,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:38:47,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:38:47,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:38:47,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:38:47,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597452952] [2025-01-09 20:38:47,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597452952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:38:47,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:38:47,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:38:47,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492641710] [2025-01-09 20:38:47,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:38:47,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:38:47,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:38:47,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:38:47,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:38:47,733 INFO L87 Difference]: Start difference. First operand 406 states and 589 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:38:47,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:38:47,918 INFO L93 Difference]: Finished difference Result 1004 states and 1466 transitions. [2025-01-09 20:38:47,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:38:47,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-09 20:38:47,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:38:47,926 INFO L225 Difference]: With dead ends: 1004 [2025-01-09 20:38:47,926 INFO L226 Difference]: Without dead ends: 799 [2025-01-09 20:38:47,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:38:47,931 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 558 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:38:47,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1703 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:38:47,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-01-09 20:38:47,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 408. [2025-01-09 20:38:47,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 396 states have (on average 1.452020202020202) internal successors, (575), 402 states have internal predecessors, (575), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:38:47,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 591 transitions. [2025-01-09 20:38:47,970 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 591 transitions. Word has length 14 [2025-01-09 20:38:47,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:38:47,970 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 591 transitions. [2025-01-09 20:38:47,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:38:47,970 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 591 transitions. [2025-01-09 20:38:47,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 20:38:47,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:38:47,973 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:38:47,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:38:47,973 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:38:47,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:38:47,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1330389058, now seen corresponding path program 1 times [2025-01-09 20:38:47,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:38:47,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092480625] [2025-01-09 20:38:47,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:38:47,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:38:48,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 20:38:48,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 20:38:48,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:38:48,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:38:48,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:38:48,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:38:48,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092480625] [2025-01-09 20:38:48,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092480625] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:38:48,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:38:48,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:38:48,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082757310] [2025-01-09 20:38:48,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:38:48,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:38:48,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:38:48,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:38:48,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:38:48,458 INFO L87 Difference]: Start difference. First operand 408 states and 591 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:38:48,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:38:48,568 INFO L93 Difference]: Finished difference Result 770 states and 1112 transitions. [2025-01-09 20:38:48,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:38:48,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 20:38:48,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:38:48,573 INFO L225 Difference]: With dead ends: 770 [2025-01-09 20:38:48,573 INFO L226 Difference]: Without dead ends: 366 [2025-01-09 20:38:48,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:38:48,578 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 30 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:38:48,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1443 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:38:48,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-01-09 20:38:48,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2025-01-09 20:38:48,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 354 states have (on average 1.4067796610169492) internal successors, (498), 360 states have internal predecessors, (498), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:38:48,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 514 transitions. [2025-01-09 20:38:48,598 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 514 transitions. Word has length 90 [2025-01-09 20:38:48,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:38:48,599 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 514 transitions. [2025-01-09 20:38:48,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:38:48,600 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 514 transitions. [2025-01-09 20:38:48,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 20:38:48,604 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:38:48,605 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:38:48,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:38:48,605 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:38:48,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:38:48,606 INFO L85 PathProgramCache]: Analyzing trace with hash -794589748, now seen corresponding path program 1 times [2025-01-09 20:38:48,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:38:48,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571114726] [2025-01-09 20:38:48,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:38:48,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:38:48,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 20:38:48,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 20:38:48,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:38:48,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:38:48,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:38:48,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:38:48,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571114726] [2025-01-09 20:38:48,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571114726] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:38:48,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:38:48,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:38:48,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824866281] [2025-01-09 20:38:48,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:38:48,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:38:48,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:38:48,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:38:48,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:38:48,865 INFO L87 Difference]: Start difference. First operand 366 states and 514 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:38:48,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:38:48,930 INFO L93 Difference]: Finished difference Result 728 states and 1024 transitions. [2025-01-09 20:38:48,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:38:48,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 20:38:48,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:38:48,932 INFO L225 Difference]: With dead ends: 728 [2025-01-09 20:38:48,932 INFO L226 Difference]: Without dead ends: 366 [2025-01-09 20:38:48,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:38:48,937 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 1 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:38:48,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 978 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:38:48,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-01-09 20:38:48,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2025-01-09 20:38:48,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 354 states have (on average 1.3983050847457628) internal successors, (495), 360 states have internal predecessors, (495), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:38:48,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 511 transitions. [2025-01-09 20:38:48,955 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 511 transitions. Word has length 90 [2025-01-09 20:38:48,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:38:48,955 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 511 transitions. [2025-01-09 20:38:48,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:38:48,958 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 511 transitions. [2025-01-09 20:38:48,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 20:38:48,960 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:38:48,960 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:38:48,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:38:48,964 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:38:48,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:38:48,964 INFO L85 PathProgramCache]: Analyzing trace with hash 978103112, now seen corresponding path program 1 times [2025-01-09 20:38:48,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:38:48,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191577884] [2025-01-09 20:38:48,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:38:48,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:38:49,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 20:38:49,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 20:38:49,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:38:49,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:38:49,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:38:49,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:38:49,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191577884] [2025-01-09 20:38:49,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191577884] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:38:49,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:38:49,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:38:49,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182233575] [2025-01-09 20:38:49,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:38:49,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:38:49,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:38:49,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:38:49,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:38:49,166 INFO L87 Difference]: Start difference. First operand 366 states and 511 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:38:49,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:38:49,303 INFO L93 Difference]: Finished difference Result 978 states and 1375 transitions. [2025-01-09 20:38:49,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:38:49,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 20:38:49,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:38:49,308 INFO L225 Difference]: With dead ends: 978 [2025-01-09 20:38:49,310 INFO L226 Difference]: Without dead ends: 616 [2025-01-09 20:38:49,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:38:49,313 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 294 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:38:49,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1173 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:38:49,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-01-09 20:38:49,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 612. [2025-01-09 20:38:49,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 600 states have (on average 1.4116666666666666) internal successors, (847), 606 states have internal predecessors, (847), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:38:49,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 863 transitions. [2025-01-09 20:38:49,349 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 863 transitions. Word has length 90 [2025-01-09 20:38:49,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:38:49,350 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 863 transitions. [2025-01-09 20:38:49,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:38:49,350 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 863 transitions. [2025-01-09 20:38:49,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 20:38:49,354 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:38:49,354 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:38:49,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:38:49,355 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:38:49,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:38:49,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1452703295, now seen corresponding path program 1 times [2025-01-09 20:38:49,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:38:49,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152041004] [2025-01-09 20:38:49,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:38:49,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:38:49,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 20:38:49,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 20:38:49,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:38:49,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:38:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 20:38:49,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:38:49,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152041004] [2025-01-09 20:38:49,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152041004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:38:49,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:38:49,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:38:49,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841776179] [2025-01-09 20:38:49,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:38:49,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:38:49,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:38:49,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:38:49,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:38:49,819 INFO L87 Difference]: Start difference. First operand 612 states and 863 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:38:49,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:38:49,941 INFO L93 Difference]: Finished difference Result 909 states and 1286 transitions. [2025-01-09 20:38:49,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:38:49,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2025-01-09 20:38:49,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:38:49,947 INFO L225 Difference]: With dead ends: 909 [2025-01-09 20:38:49,947 INFO L226 Difference]: Without dead ends: 889 [2025-01-09 20:38:49,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:38:49,949 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 457 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:38:49,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1541 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:38:49,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2025-01-09 20:38:49,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 614. [2025-01-09 20:38:49,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 602 states have (on average 1.410299003322259) internal successors, (849), 608 states have internal predecessors, (849), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:38:49,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 865 transitions. [2025-01-09 20:38:49,978 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 865 transitions. Word has length 105 [2025-01-09 20:38:49,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:38:49,979 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 865 transitions. [2025-01-09 20:38:49,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:38:49,980 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 865 transitions. [2025-01-09 20:38:49,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 20:38:49,982 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:38:49,982 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:38:49,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:38:49,983 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:38:49,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:38:49,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2075204902, now seen corresponding path program 1 times [2025-01-09 20:38:49,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:38:49,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332719739] [2025-01-09 20:38:49,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:38:49,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:38:50,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 20:38:50,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 20:38:50,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:38:50,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:38:50,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 20:38:50,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:38:50,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332719739] [2025-01-09 20:38:50,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332719739] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:38:50,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:38:50,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:38:50,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963365660] [2025-01-09 20:38:50,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:38:50,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:38:50,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:38:50,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:38:50,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:38:50,309 INFO L87 Difference]: Start difference. First operand 614 states and 865 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:38:50,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:38:50,388 INFO L93 Difference]: Finished difference Result 893 states and 1269 transitions. [2025-01-09 20:38:50,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:38:50,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2025-01-09 20:38:50,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:38:50,392 INFO L225 Difference]: With dead ends: 893 [2025-01-09 20:38:50,392 INFO L226 Difference]: Without dead ends: 530 [2025-01-09 20:38:50,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:38:50,394 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 30 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:38:50,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1196 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:38:50,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-01-09 20:38:50,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2025-01-09 20:38:50,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 518 states have (on average 1.3416988416988418) internal successors, (695), 524 states have internal predecessors, (695), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:38:50,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 711 transitions. [2025-01-09 20:38:50,410 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 711 transitions. Word has length 154 [2025-01-09 20:38:50,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:38:50,410 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 711 transitions. [2025-01-09 20:38:50,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:38:50,411 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 711 transitions. [2025-01-09 20:38:50,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 20:38:50,412 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:38:50,412 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:38:50,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 20:38:50,413 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:38:50,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:38:50,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1048248270, now seen corresponding path program 1 times [2025-01-09 20:38:50,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:38:50,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970608398] [2025-01-09 20:38:50,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:38:50,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:38:50,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 20:38:50,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 20:38:50,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:38:50,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:38:50,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:38:50,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:38:50,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970608398] [2025-01-09 20:38:50,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970608398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:38:50,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:38:50,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:38:50,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185998867] [2025-01-09 20:38:50,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:38:50,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:38:50,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:38:50,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:38:50,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:38:50,668 INFO L87 Difference]: Start difference. First operand 530 states and 711 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:38:51,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:38:51,193 INFO L93 Difference]: Finished difference Result 1325 states and 1790 transitions. [2025-01-09 20:38:51,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:38:51,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2025-01-09 20:38:51,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:38:51,198 INFO L225 Difference]: With dead ends: 1325 [2025-01-09 20:38:51,199 INFO L226 Difference]: Without dead ends: 886 [2025-01-09 20:38:51,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:38:51,201 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 920 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 20:38:51,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 1562 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 20:38:51,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-01-09 20:38:51,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 668. [2025-01-09 20:38:51,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 656 states have (on average 1.3460365853658536) internal successors, (883), 662 states have internal predecessors, (883), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:38:51,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 899 transitions. [2025-01-09 20:38:51,235 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 899 transitions. Word has length 154 [2025-01-09 20:38:51,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:38:51,235 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 899 transitions. [2025-01-09 20:38:51,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:38:51,236 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 899 transitions. [2025-01-09 20:38:51,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 20:38:51,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:38:51,239 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:38:51,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 20:38:51,239 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:38:51,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:38:51,240 INFO L85 PathProgramCache]: Analyzing trace with hash 511530653, now seen corresponding path program 1 times [2025-01-09 20:38:51,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:38:51,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703507029] [2025-01-09 20:38:51,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:38:51,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:38:51,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 20:38:51,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 20:38:51,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:38:51,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:38:52,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:38:52,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:38:52,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703507029] [2025-01-09 20:38:52,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703507029] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:38:52,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578410802] [2025-01-09 20:38:52,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:38:52,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:38:52,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:38:52,018 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:38:52,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 20:38:52,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 20:38:52,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 20:38:52,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:38:52,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:38:52,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 20:38:52,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:38:52,479 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 15 treesize of output 1 [2025-01-09 20:38:52,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2025-01-09 20:38:52,737 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 15 treesize of output 7 [2025-01-09 20:38:52,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:38:52,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:38:52,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:38:52,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578410802] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:38:52,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:38:52,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-01-09 20:38:52,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379836339] [2025-01-09 20:38:52,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:38:52,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 20:38:52,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:38:52,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 20:38:52,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 20:38:52,999 INFO L87 Difference]: Start difference. First operand 668 states and 899 transitions. Second operand has 11 states, 11 states have (on average 22.454545454545453) internal successors, (247), 11 states have internal predecessors, (247), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 20:38:53,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:38:53,346 INFO L93 Difference]: Finished difference Result 2153 states and 2907 transitions. [2025-01-09 20:38:53,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 20:38:53,346 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 22.454545454545453) internal successors, (247), 11 states have internal predecessors, (247), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 164 [2025-01-09 20:38:53,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:38:53,355 INFO L225 Difference]: With dead ends: 2153 [2025-01-09 20:38:53,355 INFO L226 Difference]: Without dead ends: 1733 [2025-01-09 20:38:53,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 321 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-01-09 20:38:53,357 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 1165 mSDsluCounter, 3617 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 4070 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:38:53,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 4070 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:38:53,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2025-01-09 20:38:53,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1015. [2025-01-09 20:38:53,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 999 states have (on average 1.3353353353353354) internal successors, (1334), 1005 states have internal predecessors, (1334), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:38:53,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1356 transitions. [2025-01-09 20:38:53,409 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1356 transitions. Word has length 164 [2025-01-09 20:38:53,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:38:53,409 INFO L471 AbstractCegarLoop]: Abstraction has 1015 states and 1356 transitions. [2025-01-09 20:38:53,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.454545454545453) internal successors, (247), 11 states have internal predecessors, (247), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 20:38:53,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1356 transitions. [2025-01-09 20:38:53,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-01-09 20:38:53,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:38:53,417 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:38:53,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 20:38:53,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:38:53,618 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:38:53,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:38:53,619 INFO L85 PathProgramCache]: Analyzing trace with hash 2098217011, now seen corresponding path program 1 times [2025-01-09 20:38:53,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:38:53,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872430896] [2025-01-09 20:38:53,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:38:53,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:38:53,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-01-09 20:38:53,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-01-09 20:38:53,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:38:53,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:38:57,210 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:38:57,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:38:57,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872430896] [2025-01-09 20:38:57,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872430896] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:38:57,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64918158] [2025-01-09 20:38:57,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:38:57,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:38:57,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:38:57,215 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:38:57,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 20:38:57,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-01-09 20:38:57,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-01-09 20:38:57,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:38:57,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:38:57,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 20:38:57,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:38:57,970 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 15 treesize of output 1 [2025-01-09 20:38:58,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2025-01-09 20:38:58,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2025-01-09 20:38:58,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2025-01-09 20:38:58,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2025-01-09 20:38:58,548 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 15 treesize of output 7 [2025-01-09 20:38:58,556 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:38:58,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:38:59,106 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:38:59,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64918158] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:38:59,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:38:59,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 20 [2025-01-09 20:38:59,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240446548] [2025-01-09 20:38:59,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:38:59,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 20:38:59,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:38:59,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 20:38:59,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2025-01-09 20:38:59,111 INFO L87 Difference]: Start difference. First operand 1015 states and 1356 transitions. Second operand has 20 states, 20 states have (on average 35.45) internal successors, (709), 20 states have internal predecessors, (709), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 20:38:59,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:38:59,746 INFO L93 Difference]: Finished difference Result 4250 states and 5748 transitions. [2025-01-09 20:38:59,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 20:38:59,747 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 35.45) internal successors, (709), 20 states have internal predecessors, (709), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 392 [2025-01-09 20:38:59,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:38:59,767 INFO L225 Difference]: With dead ends: 4250 [2025-01-09 20:38:59,767 INFO L226 Difference]: Without dead ends: 3830 [2025-01-09 20:38:59,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 777 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=426, Unknown=0, NotChecked=0, Total=650 [2025-01-09 20:38:59,771 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 4407 mSDsluCounter, 4848 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4439 SdHoareTripleChecker+Valid, 5305 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:38:59,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4439 Valid, 5305 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:38:59,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3830 states. [2025-01-09 20:38:59,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3830 to 1879. [2025-01-09 20:38:59,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1857 states have (on average 1.3257942918686052) internal successors, (2462), 1863 states have internal predecessors, (2462), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 20:38:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2496 transitions. [2025-01-09 20:38:59,854 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2496 transitions. Word has length 392 [2025-01-09 20:38:59,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:38:59,855 INFO L471 AbstractCegarLoop]: Abstraction has 1879 states and 2496 transitions. [2025-01-09 20:38:59,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 35.45) internal successors, (709), 20 states have internal predecessors, (709), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 20:38:59,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2496 transitions. [2025-01-09 20:38:59,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 849 [2025-01-09 20:38:59,873 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:38:59,873 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:38:59,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 20:39:00,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:39:00,074 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:39:00,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:39:00,075 INFO L85 PathProgramCache]: Analyzing trace with hash -447305121, now seen corresponding path program 2 times [2025-01-09 20:39:00,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:39:00,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839527750] [2025-01-09 20:39:00,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 20:39:00,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:39:00,353 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 848 statements into 2 equivalence classes. [2025-01-09 20:39:00,389 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 73 of 848 statements. [2025-01-09 20:39:00,389 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 20:39:00,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:39:00,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 20:39:00,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:39:00,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839527750] [2025-01-09 20:39:00,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839527750] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:39:00,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:39:00,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:39:00,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568274013] [2025-01-09 20:39:00,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:39:00,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:39:00,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:39:00,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:39:00,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:39:00,724 INFO L87 Difference]: Start difference. First operand 1879 states and 2496 transitions. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:39:01,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:39:01,154 INFO L93 Difference]: Finished difference Result 2329 states and 3109 transitions. [2025-01-09 20:39:01,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:39:01,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 848 [2025-01-09 20:39:01,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:39:01,165 INFO L225 Difference]: With dead ends: 2329 [2025-01-09 20:39:01,166 INFO L226 Difference]: Without dead ends: 1912 [2025-01-09 20:39:01,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:39:01,171 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 20 mSDsluCounter, 1666 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2081 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:39:01,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2081 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 20:39:01,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2025-01-09 20:39:01,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1891. [2025-01-09 20:39:01,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1869 states have (on average 1.3237025147137507) internal successors, (2474), 1875 states have internal predecessors, (2474), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 20:39:01,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2508 transitions. [2025-01-09 20:39:01,241 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2508 transitions. Word has length 848 [2025-01-09 20:39:01,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:39:01,242 INFO L471 AbstractCegarLoop]: Abstraction has 1891 states and 2508 transitions. [2025-01-09 20:39:01,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:39:01,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2508 transitions. [2025-01-09 20:39:01,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2025-01-09 20:39:01,266 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:39:01,266 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:39:01,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 20:39:01,267 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:39:01,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:39:01,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1706146594, now seen corresponding path program 1 times [2025-01-09 20:39:01,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:39:01,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318641575] [2025-01-09 20:39:01,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:39:01,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:39:01,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 849 statements into 1 equivalence classes. [2025-01-09 20:39:01,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 849 of 849 statements. [2025-01-09 20:39:01,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:39:01,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:39:03,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 20:39:03,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:39:03,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318641575] [2025-01-09 20:39:03,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318641575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:39:03,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:39:03,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 20:39:03,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475356486] [2025-01-09 20:39:03,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:39:03,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 20:39:03,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:39:03,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 20:39:03,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:39:03,782 INFO L87 Difference]: Start difference. First operand 1891 states and 2508 transitions. Second operand has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:39:04,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:39:04,152 INFO L93 Difference]: Finished difference Result 2365 states and 3151 transitions. [2025-01-09 20:39:04,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:39:04,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 849 [2025-01-09 20:39:04,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:39:04,163 INFO L225 Difference]: With dead ends: 2365 [2025-01-09 20:39:04,164 INFO L226 Difference]: Without dead ends: 1936 [2025-01-09 20:39:04,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:39:04,166 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 25 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2124 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:39:04,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2124 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:39:04,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2025-01-09 20:39:04,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1903. [2025-01-09 20:39:04,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1903 states, 1881 states have (on average 1.3232323232323233) internal successors, (2489), 1887 states have internal predecessors, (2489), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 20:39:04,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 2523 transitions. [2025-01-09 20:39:04,225 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 2523 transitions. Word has length 849 [2025-01-09 20:39:04,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:39:04,226 INFO L471 AbstractCegarLoop]: Abstraction has 1903 states and 2523 transitions. [2025-01-09 20:39:04,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:39:04,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 2523 transitions. [2025-01-09 20:39:04,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2025-01-09 20:39:04,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:39:04,234 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:39:04,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 20:39:04,235 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:39:04,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:39:04,235 INFO L85 PathProgramCache]: Analyzing trace with hash -844440405, now seen corresponding path program 1 times [2025-01-09 20:39:04,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:39:04,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648808783] [2025-01-09 20:39:04,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:39:04,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:39:04,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 850 statements into 1 equivalence classes. [2025-01-09 20:39:04,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 850 of 850 statements. [2025-01-09 20:39:04,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:39:04,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:39:07,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 20:39:07,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:39:07,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648808783] [2025-01-09 20:39:07,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648808783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:39:07,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:39:07,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:39:07,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266956997] [2025-01-09 20:39:07,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:39:07,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:39:07,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:39:07,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:39:07,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:39:07,021 INFO L87 Difference]: Start difference. First operand 1903 states and 2523 transitions. Second operand has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:39:07,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:39:07,551 INFO L93 Difference]: Finished difference Result 2377 states and 3172 transitions. [2025-01-09 20:39:07,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:39:07,552 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 850 [2025-01-09 20:39:07,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:39:07,562 INFO L225 Difference]: With dead ends: 2377 [2025-01-09 20:39:07,562 INFO L226 Difference]: Without dead ends: 1936 [2025-01-09 20:39:07,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:39:07,564 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 31 mSDsluCounter, 2450 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2861 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:39:07,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2861 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 20:39:07,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2025-01-09 20:39:07,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1927. [2025-01-09 20:39:07,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1927 states, 1905 states have (on average 1.3223097112860893) internal successors, (2519), 1911 states have internal predecessors, (2519), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 20:39:07,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 2553 transitions. [2025-01-09 20:39:07,625 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 2553 transitions. Word has length 850 [2025-01-09 20:39:07,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:39:07,627 INFO L471 AbstractCegarLoop]: Abstraction has 1927 states and 2553 transitions. [2025-01-09 20:39:07,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:39:07,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2553 transitions. [2025-01-09 20:39:07,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2025-01-09 20:39:07,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:39:07,637 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:39:07,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 20:39:07,637 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:39:07,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:39:07,638 INFO L85 PathProgramCache]: Analyzing trace with hash -619716348, now seen corresponding path program 1 times [2025-01-09 20:39:07,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:39:07,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74884478] [2025-01-09 20:39:07,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:39:07,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:39:07,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 850 statements into 1 equivalence classes. [2025-01-09 20:39:08,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 850 of 850 statements. [2025-01-09 20:39:08,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:39:08,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:39:09,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 20:39:09,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:39:09,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74884478] [2025-01-09 20:39:09,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74884478] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:39:09,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:39:09,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:39:09,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001153907] [2025-01-09 20:39:09,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:39:09,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:39:09,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:39:09,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:39:09,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:39:09,929 INFO L87 Difference]: Start difference. First operand 1927 states and 2553 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:39:10,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:39:10,249 INFO L93 Difference]: Finished difference Result 2419 states and 3214 transitions. [2025-01-09 20:39:10,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:39:10,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 850 [2025-01-09 20:39:10,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:39:10,258 INFO L225 Difference]: With dead ends: 2419 [2025-01-09 20:39:10,258 INFO L226 Difference]: Without dead ends: 1954 [2025-01-09 20:39:10,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:39:10,260 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 15 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2101 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:39:10,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2101 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:39:10,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2025-01-09 20:39:10,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1936. [2025-01-09 20:39:10,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1914 states have (on average 1.3207941483803554) internal successors, (2528), 1920 states have internal predecessors, (2528), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 20:39:10,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2562 transitions. [2025-01-09 20:39:10,318 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2562 transitions. Word has length 850 [2025-01-09 20:39:10,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:39:10,319 INFO L471 AbstractCegarLoop]: Abstraction has 1936 states and 2562 transitions. [2025-01-09 20:39:10,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:39:10,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2562 transitions. [2025-01-09 20:39:10,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2025-01-09 20:39:10,327 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:39:10,328 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:39:10,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 20:39:10,328 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:39:10,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:39:10,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1570806817, now seen corresponding path program 1 times [2025-01-09 20:39:10,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:39:10,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853709108] [2025-01-09 20:39:10,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:39:10,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:39:10,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 851 statements into 1 equivalence classes.