./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-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 f0735ebc421a940bb70b06777060abaef432af6ff0cfdeb82bfa2e45a81b4e11 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:32:31,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:32:32,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 08:32:32,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:32:32,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:32:32,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:32:32,050 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:32:32,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:32:32,050 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 08:32:32,051 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 08:32:32,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:32:32,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:32:32,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:32:32,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:32:32,051 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:32:32,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:32:32,051 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:32:32,051 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 08:32:32,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:32:32,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 08:32:32,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:32:32,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:32:32,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:32:32,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:32:32,051 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 08:32:32,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:32:32,051 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:32:32,052 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:32:32,052 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:32:32,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:32:32,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 08:32:32,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:32:32,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:32:32,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:32:32,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:32:32,052 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:32:32,052 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:32:32,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:32:32,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:32:32,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:32:32,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:32:32,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:32:32,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:32:32,052 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 -> f0735ebc421a940bb70b06777060abaef432af6ff0cfdeb82bfa2e45a81b4e11 [2025-02-06 08:32:32,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:32:32,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:32:32,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:32:32,302 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:32:32,302 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:32:32,306 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_test2-1.i [2025-02-06 08:32:33,582 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37d2a828f/84c73f0537f84d1d93ca524fa9fa73ad/FLAG1519326e4 [2025-02-06 08:32:33,899 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:32:33,900 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i [2025-02-06 08:32:33,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37d2a828f/84c73f0537f84d1d93ca524fa9fa73ad/FLAG1519326e4 [2025-02-06 08:32:34,134 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37d2a828f/84c73f0537f84d1d93ca524fa9fa73ad [2025-02-06 08:32:34,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:32:34,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:32:34,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:32:34,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:32:34,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:32:34,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:32:34" (1/1) ... [2025-02-06 08:32:34,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@554a056b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:34, skipping insertion in model container [2025-02-06 08:32:34,146 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:32:34" (1/1) ... [2025-02-06 08:32:34,182 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:32:34,430 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_test2-1.i[37019,37032] [2025-02-06 08:32:34,532 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_test2-1.i[47352,47365] [2025-02-06 08:32:34,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:32:34,552 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:32:34,577 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_test2-1.i[37019,37032] [2025-02-06 08:32:34,624 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_test2-1.i[47352,47365] [2025-02-06 08:32:34,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:32:34,670 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:32:34,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:34 WrapperNode [2025-02-06 08:32:34,672 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:32:34,673 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:32:34,674 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:32:34,674 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:32:34,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:34" (1/1) ... [2025-02-06 08:32:34,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:34" (1/1) ... [2025-02-06 08:32:34,747 INFO L138 Inliner]: procedures = 208, calls = 227, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1264 [2025-02-06 08:32:34,747 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:32:34,748 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:32:34,748 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:32:34,748 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:32:34,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:34" (1/1) ... [2025-02-06 08:32:34,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:34" (1/1) ... [2025-02-06 08:32:34,765 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:34" (1/1) ... [2025-02-06 08:32:34,810 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2025-02-06 08:32:34,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:34" (1/1) ... [2025-02-06 08:32:34,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:34" (1/1) ... [2025-02-06 08:32:34,831 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:34" (1/1) ... [2025-02-06 08:32:34,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:34" (1/1) ... [2025-02-06 08:32:34,841 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:34" (1/1) ... [2025-02-06 08:32:34,843 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:34" (1/1) ... [2025-02-06 08:32:34,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:32:34,855 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:32:34,855 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:32:34,856 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:32:34,856 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:34" (1/1) ... [2025-02-06 08:32:34,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:32:34,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:32:34,883 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 08:32:34,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 08:32:34,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 08:32:34,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 08:32:34,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 08:32:34,902 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 08:32:34,902 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 08:32:34,902 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 08:32:34,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 08:32:34,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 08:32:34,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 08:32:34,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 08:32:34,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:32:34,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 08:32:34,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 08:32:34,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 08:32:34,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 08:32:34,903 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 08:32:34,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 08:32:34,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 08:32:34,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 08:32:34,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 08:32:34,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:32:34,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 08:32:34,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 08:32:34,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 08:32:34,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 08:32:34,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 08:32:34,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 08:32:34,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:32:34,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:32:35,070 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:32:35,071 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:32:36,005 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-06 08:32:36,079 INFO L? ?]: Removed 302 outVars from TransFormulas that were not future-live. [2025-02-06 08:32:36,079 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:32:36,119 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:32:36,121 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 08:32:36,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:32:36 BoogieIcfgContainer [2025-02-06 08:32:36,122 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:32:36,123 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:32:36,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:32:36,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:32:36,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:32:34" (1/3) ... [2025-02-06 08:32:36,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad9baac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:32:36, skipping insertion in model container [2025-02-06 08:32:36,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:34" (2/3) ... [2025-02-06 08:32:36,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad9baac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:32:36, skipping insertion in model container [2025-02-06 08:32:36,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:32:36" (3/3) ... [2025-02-06 08:32:36,129 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test2-1.i [2025-02-06 08:32:36,142 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:32:36,143 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test2-1.i that has 5 procedures, 386 locations, 1 initial locations, 33 loop locations, and 2 error locations. [2025-02-06 08:32:36,179 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:32:36,186 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;@538f478b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:32:36,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-06 08:32:36,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 378 states, 365 states have (on average 1.6164383561643836) internal successors, (590), 372 states have internal predecessors, (590), 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-02-06 08:32:36,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 08:32:36,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:32:36,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:32:36,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:32:36,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:32:36,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1731134348, now seen corresponding path program 1 times [2025-02-06 08:32:36,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:32:36,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864746715] [2025-02-06 08:32:36,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:32:36,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:32:36,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 08:32:36,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 08:32:36,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:32:36,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:32:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:32:36,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:32:36,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864746715] [2025-02-06 08:32:36,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864746715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:32:36,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:32:36,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:32:36,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826710300] [2025-02-06 08:32:36,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:32:36,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 08:32:36,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:32:36,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 08:32:36,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:32:36,312 INFO L87 Difference]: Start difference. First operand has 378 states, 365 states have (on average 1.6164383561643836) internal successors, (590), 372 states have internal predecessors, (590), 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-02-06 08:32:36,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:32:36,424 INFO L93 Difference]: Finished difference Result 754 states and 1215 transitions. [2025-02-06 08:32:36,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 08:32:36,426 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-02-06 08:32:36,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:32:36,433 INFO L225 Difference]: With dead ends: 754 [2025-02-06 08:32:36,434 INFO L226 Difference]: Without dead ends: 374 [2025-02-06 08:32:36,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-02-06 08:32:36,439 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:32:36,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:32:36,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-02-06 08:32:36,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2025-02-06 08:32:36,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 362 states have (on average 1.4640883977900552) internal successors, (530), 368 states have internal predecessors, (530), 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-02-06 08:32:36,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 546 transitions. [2025-02-06 08:32:36,482 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 546 transitions. Word has length 9 [2025-02-06 08:32:36,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:32:36,482 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 546 transitions. [2025-02-06 08:32:36,482 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-02-06 08:32:36,482 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 546 transitions. [2025-02-06 08:32:36,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 08:32:36,485 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:32:36,485 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:32:36,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:32:36,485 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:32:36,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:32:36,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1643267715, now seen corresponding path program 1 times [2025-02-06 08:32:36,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:32:36,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539130747] [2025-02-06 08:32:36,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:32:36,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:32:36,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 08:32:36,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 08:32:36,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:32:36,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:32:36,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:32:36,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:32:36,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539130747] [2025-02-06 08:32:36,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539130747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:32:36,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:32:36,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:32:36,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020007566] [2025-02-06 08:32:36,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:32:36,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:32:36,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:32:36,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:32:36,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:32:36,882 INFO L87 Difference]: Start difference. First operand 374 states and 546 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-02-06 08:32:37,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:32:37,171 INFO L93 Difference]: Finished difference Result 910 states and 1339 transitions. [2025-02-06 08:32:37,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:32:37,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 63 [2025-02-06 08:32:37,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:32:37,177 INFO L225 Difference]: With dead ends: 910 [2025-02-06 08:32:37,178 INFO L226 Difference]: Without dead ends: 735 [2025-02-06 08:32:37,179 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-02-06 08:32:37,181 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 515 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:32:37,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1449 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:32:37,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-02-06 08:32:37,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 376. [2025-02-06 08:32:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 364 states have (on average 1.4615384615384615) internal successors, (532), 370 states have internal predecessors, (532), 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-02-06 08:32:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 548 transitions. [2025-02-06 08:32:37,199 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 548 transitions. Word has length 63 [2025-02-06 08:32:37,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:32:37,200 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 548 transitions. [2025-02-06 08:32:37,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-02-06 08:32:37,200 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 548 transitions. [2025-02-06 08:32:37,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 08:32:37,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:32:37,203 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:32:37,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:32:37,204 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:32:37,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:32:37,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1103245072, now seen corresponding path program 1 times [2025-02-06 08:32:37,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:32:37,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994866960] [2025-02-06 08:32:37,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:32:37,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:32:37,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 08:32:37,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 08:32:37,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:32:37,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:32:37,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:32:37,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:32:37,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994866960] [2025-02-06 08:32:37,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994866960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:32:37,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:32:37,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:32:37,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008803145] [2025-02-06 08:32:37,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:32:37,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:32:37,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:32:37,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:32:37,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:32:37,504 INFO L87 Difference]: Start difference. First operand 376 states and 548 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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-02-06 08:32:37,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:32:37,633 INFO L93 Difference]: Finished difference Result 706 states and 1026 transitions. [2025-02-06 08:32:37,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:32:37,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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 138 [2025-02-06 08:32:37,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:32:37,635 INFO L225 Difference]: With dead ends: 706 [2025-02-06 08:32:37,635 INFO L226 Difference]: Without dead ends: 334 [2025-02-06 08:32:37,636 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-02-06 08:32:37,637 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 30 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:32:37,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1220 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:32:37,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-02-06 08:32:37,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2025-02-06 08:32:37,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 322 states have (on average 1.4130434782608696) internal successors, (455), 328 states have internal predecessors, (455), 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-02-06 08:32:37,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 471 transitions. [2025-02-06 08:32:37,649 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 471 transitions. Word has length 138 [2025-02-06 08:32:37,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:32:37,649 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 471 transitions. [2025-02-06 08:32:37,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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-02-06 08:32:37,649 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 471 transitions. [2025-02-06 08:32:37,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 08:32:37,652 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:32:37,653 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:32:37,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:32:37,653 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:32:37,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:32:37,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1583155658, now seen corresponding path program 1 times [2025-02-06 08:32:37,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:32:37,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011621438] [2025-02-06 08:32:37,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:32:37,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:32:37,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 08:32:37,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 08:32:37,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:32:37,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:32:37,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:32:37,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:32:37,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011621438] [2025-02-06 08:32:37,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011621438] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:32:37,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:32:37,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:32:37,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135153736] [2025-02-06 08:32:37,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:32:37,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:32:37,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:32:37,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:32:37,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:32:37,845 INFO L87 Difference]: Start difference. First operand 334 states and 471 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-02-06 08:32:38,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:32:38,007 INFO L93 Difference]: Finished difference Result 897 states and 1280 transitions. [2025-02-06 08:32:38,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:32:38,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 138 [2025-02-06 08:32:38,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:32:38,010 INFO L225 Difference]: With dead ends: 897 [2025-02-06 08:32:38,010 INFO L226 Difference]: Without dead ends: 567 [2025-02-06 08:32:38,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:32:38,013 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 270 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:32:38,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 1023 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:32:38,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-02-06 08:32:38,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 565. [2025-02-06 08:32:38,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 548 states have (on average 1.4306569343065694) internal successors, (784), 559 states have internal predecessors, (784), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 08:32:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 810 transitions. [2025-02-06 08:32:38,046 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 810 transitions. Word has length 138 [2025-02-06 08:32:38,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:32:38,046 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 810 transitions. [2025-02-06 08:32:38,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-02-06 08:32:38,046 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 810 transitions. [2025-02-06 08:32:38,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 08:32:38,051 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:32:38,051 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] [2025-02-06 08:32:38,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:32:38,051 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:32:38,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:32:38,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1816596973, now seen corresponding path program 1 times [2025-02-06 08:32:38,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:32:38,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808484237] [2025-02-06 08:32:38,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:32:38,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:32:38,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 08:32:38,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 08:32:38,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:32:38,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:32:38,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 08:32:38,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:32:38,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808484237] [2025-02-06 08:32:38,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808484237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:32:38,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:32:38,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:32:38,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064762501] [2025-02-06 08:32:38,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:32:38,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:32:38,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:32:38,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:32:38,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:32:38,367 INFO L87 Difference]: Start difference. First operand 565 states and 810 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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-02-06 08:32:38,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:32:38,480 INFO L93 Difference]: Finished difference Result 800 states and 1158 transitions. [2025-02-06 08:32:38,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:32:38,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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 153 [2025-02-06 08:32:38,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:32:38,483 INFO L225 Difference]: With dead ends: 800 [2025-02-06 08:32:38,485 INFO L226 Difference]: Without dead ends: 481 [2025-02-06 08:32:38,486 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-02-06 08:32:38,487 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 30 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:32:38,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 998 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:32:38,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-02-06 08:32:38,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2025-02-06 08:32:38,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 464 states have (on average 1.3577586206896552) internal successors, (630), 475 states have internal predecessors, (630), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 08:32:38,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 656 transitions. [2025-02-06 08:32:38,506 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 656 transitions. Word has length 153 [2025-02-06 08:32:38,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:32:38,506 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 656 transitions. [2025-02-06 08:32:38,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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-02-06 08:32:38,507 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 656 transitions. [2025-02-06 08:32:38,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 08:32:38,511 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:32:38,511 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] [2025-02-06 08:32:38,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:32:38,511 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:32:38,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:32:38,511 INFO L85 PathProgramCache]: Analyzing trace with hash -940774036, now seen corresponding path program 1 times [2025-02-06 08:32:38,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:32:38,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067950773] [2025-02-06 08:32:38,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:32:38,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:32:38,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 08:32:38,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 08:32:38,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:32:38,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:32:38,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:32:38,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:32:38,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067950773] [2025-02-06 08:32:38,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067950773] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:32:38,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:32:38,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:32:38,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108577872] [2025-02-06 08:32:38,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:32:38,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 08:32:38,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:32:38,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 08:32:38,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:32:38,776 INFO L87 Difference]: Start difference. First operand 481 states and 656 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 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-02-06 08:32:39,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:32:39,076 INFO L93 Difference]: Finished difference Result 950 states and 1296 transitions. [2025-02-06 08:32:39,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:32:39,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 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 153 [2025-02-06 08:32:39,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:32:39,079 INFO L225 Difference]: With dead ends: 950 [2025-02-06 08:32:39,079 INFO L226 Difference]: Without dead ends: 559 [2025-02-06 08:32:39,080 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-02-06 08:32:39,080 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 1016 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:32:39,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 946 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:32:39,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-02-06 08:32:39,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 378. [2025-02-06 08:32:39,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 366 states have (on average 1.3469945355191257) internal successors, (493), 372 states have internal predecessors, (493), 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-02-06 08:32:39,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 509 transitions. [2025-02-06 08:32:39,099 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 509 transitions. Word has length 153 [2025-02-06 08:32:39,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:32:39,100 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 509 transitions. [2025-02-06 08:32:39,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 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-02-06 08:32:39,100 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 509 transitions. [2025-02-06 08:32:39,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 08:32:39,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:32:39,102 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] [2025-02-06 08:32:39,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 08:32:39,102 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:32:39,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:32:39,103 INFO L85 PathProgramCache]: Analyzing trace with hash -777753282, now seen corresponding path program 1 times [2025-02-06 08:32:39,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:32:39,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023764200] [2025-02-06 08:32:39,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:32:39,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:32:39,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 08:32:39,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 08:32:39,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:32:39,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:32:39,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:32:39,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:32:39,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023764200] [2025-02-06 08:32:39,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023764200] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:32:39,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112725777] [2025-02-06 08:32:39,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:32:39,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:32:39,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:32:39,694 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:32:39,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 08:32:39,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 08:32:40,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 08:32:40,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:32:40,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:32:40,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 08:32:40,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:32:40,059 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 11 treesize of output 7 [2025-02-06 08:32:40,254 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 19 treesize of output 11 [2025-02-06 08:32:40,271 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:32:40,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:32:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:32:40,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112725777] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:32:40,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:32:40,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 12 [2025-02-06 08:32:40,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707038792] [2025-02-06 08:32:40,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:32:40,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 08:32:40,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:32:40,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 08:32:40,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:32:40,428 INFO L87 Difference]: Start difference. First operand 378 states and 509 transitions. Second operand has 12 states, 12 states have (on average 26.916666666666668) internal successors, (323), 12 states have internal predecessors, (323), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:32:40,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:32:40,863 INFO L93 Difference]: Finished difference Result 1251 states and 1695 transitions. [2025-02-06 08:32:40,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 08:32:40,864 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 26.916666666666668) internal successors, (323), 12 states have internal predecessors, (323), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 163 [2025-02-06 08:32:40,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:32:40,868 INFO L225 Difference]: With dead ends: 1251 [2025-02-06 08:32:40,868 INFO L226 Difference]: Without dead ends: 1118 [2025-02-06 08:32:40,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 318 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-02-06 08:32:40,869 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 1548 mSDsluCounter, 3416 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1562 SdHoareTripleChecker+Valid, 3918 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:32:40,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1562 Valid, 3918 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:32:40,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2025-02-06 08:32:40,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 720. [2025-02-06 08:32:40,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 704 states have (on average 1.3423295454545454) internal successors, (945), 710 states have internal predecessors, (945), 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-02-06 08:32:40,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 967 transitions. [2025-02-06 08:32:40,892 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 967 transitions. Word has length 163 [2025-02-06 08:32:40,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:32:40,893 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 967 transitions. [2025-02-06 08:32:40,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 26.916666666666668) internal successors, (323), 12 states have internal predecessors, (323), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:32:40,893 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 967 transitions. [2025-02-06 08:32:40,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-02-06 08:32:40,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:32:40,896 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, 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-02-06 08:32:40,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 08:32:41,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:32:41,098 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:32:41,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:32:41,099 INFO L85 PathProgramCache]: Analyzing trace with hash 429219077, now seen corresponding path program 1 times [2025-02-06 08:32:41,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:32:41,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106285535] [2025-02-06 08:32:41,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:32:41,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:32:41,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-02-06 08:32:41,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-02-06 08:32:41,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:32:41,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:32:43,936 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:32:43,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:32:43,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106285535] [2025-02-06 08:32:43,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106285535] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:32:43,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614020534] [2025-02-06 08:32:43,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:32:43,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:32:43,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:32:43,940 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:32:43,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 08:32:44,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-02-06 08:32:44,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-02-06 08:32:44,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:32:44,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:32:44,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 08:32:44,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:32:44,478 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 11 treesize of output 7 [2025-02-06 08:32:44,628 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 19 treesize of output 11 [2025-02-06 08:32:44,715 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 19 treesize of output 11 [2025-02-06 08:32:44,805 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 19 treesize of output 11 [2025-02-06 08:32:44,904 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 19 treesize of output 11 [2025-02-06 08:32:44,918 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:32:44,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:32:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:32:45,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614020534] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:32:45,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:32:45,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 23 [2025-02-06 08:32:45,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219768526] [2025-02-06 08:32:45,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:32:45,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 08:32:45,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:32:45,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 08:32:45,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2025-02-06 08:32:45,332 INFO L87 Difference]: Start difference. First operand 720 states and 967 transitions. Second operand has 23 states, 23 states have (on average 43.391304347826086) internal successors, (998), 23 states have internal predecessors, (998), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:32:46,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:32:46,441 INFO L93 Difference]: Finished difference Result 2481 states and 3369 transitions. [2025-02-06 08:32:46,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 08:32:46,442 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 43.391304347826086) internal successors, (998), 23 states have internal predecessors, (998), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 388 [2025-02-06 08:32:46,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:32:46,449 INFO L225 Difference]: With dead ends: 2481 [2025-02-06 08:32:46,449 INFO L226 Difference]: Without dead ends: 2348 [2025-02-06 08:32:46,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 764 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=296, Invalid=696, Unknown=0, NotChecked=0, Total=992 [2025-02-06 08:32:46,450 INFO L435 NwaCegarLoop]: 1310 mSDtfsCounter, 4281 mSDsluCounter, 11581 mSDsCounter, 0 mSdLazyCounter, 1628 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4316 SdHoareTripleChecker+Valid, 12891 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 08:32:46,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4316 Valid, 12891 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1628 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 08:32:46,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2025-02-06 08:32:46,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 1572. [2025-02-06 08:32:46,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1550 states have (on average 1.3412903225806452) internal successors, (2079), 1556 states have internal predecessors, (2079), 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-02-06 08:32:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2113 transitions. [2025-02-06 08:32:46,497 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2113 transitions. Word has length 388 [2025-02-06 08:32:46,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:32:46,498 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2113 transitions. [2025-02-06 08:32:46,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 43.391304347826086) internal successors, (998), 23 states have internal predecessors, (998), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:32:46,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2113 transitions. [2025-02-06 08:32:46,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2025-02-06 08:32:46,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:32:46,513 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, 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-02-06 08:32:46,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 08:32:46,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:32:46,714 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:32:46,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:32:46,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1232731173, now seen corresponding path program 2 times [2025-02-06 08:32:46,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:32:46,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850350235] [2025-02-06 08:32:46,718 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:32:46,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:32:46,917 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 838 statements into 2 equivalence classes. [2025-02-06 08:32:46,938 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 73 of 838 statements. [2025-02-06 08:32:46,942 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 08:32:46,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:32:47,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3381 trivial. 0 not checked. [2025-02-06 08:32:47,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:32:47,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850350235] [2025-02-06 08:32:47,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850350235] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:32:47,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:32:47,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:32:47,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27826467] [2025-02-06 08:32:47,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:32:47,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:32:47,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:32:47,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:32:47,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:32:47,110 INFO L87 Difference]: Start difference. First operand 1572 states and 2113 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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-02-06 08:32:47,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:32:47,424 INFO L93 Difference]: Finished difference Result 1709 states and 2301 transitions. [2025-02-06 08:32:47,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:32:47,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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 838 [2025-02-06 08:32:47,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:32:47,433 INFO L225 Difference]: With dead ends: 1709 [2025-02-06 08:32:47,433 INFO L226 Difference]: Without dead ends: 1577 [2025-02-06 08:32:47,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:32:47,435 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 14 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:32:47,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1451 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:32:47,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2025-02-06 08:32:47,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1574. [2025-02-06 08:32:47,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1552 states have (on average 1.3408505154639174) internal successors, (2081), 1558 states have internal predecessors, (2081), 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-02-06 08:32:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 2115 transitions. [2025-02-06 08:32:47,479 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 2115 transitions. Word has length 838 [2025-02-06 08:32:47,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:32:47,480 INFO L471 AbstractCegarLoop]: Abstraction has 1574 states and 2115 transitions. [2025-02-06 08:32:47,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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-02-06 08:32:47,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 2115 transitions. [2025-02-06 08:32:47,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 840 [2025-02-06 08:32:47,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:32:47,496 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, 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-02-06 08:32:47,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 08:32:47,497 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:32:47,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:32:47,497 INFO L85 PathProgramCache]: Analyzing trace with hash 421841299, now seen corresponding path program 1 times [2025-02-06 08:32:47,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:32:47,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514323258] [2025-02-06 08:32:47,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:32:47,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:32:47,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 839 statements into 1 equivalence classes. [2025-02-06 08:32:47,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 839 of 839 statements. [2025-02-06 08:32:47,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:32:47,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:32:49,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3381 trivial. 0 not checked. [2025-02-06 08:32:49,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:32:49,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514323258] [2025-02-06 08:32:49,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514323258] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:32:49,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:32:49,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:32:49,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129000083] [2025-02-06 08:32:49,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:32:49,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:32:49,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:32:49,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:32:49,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:32:49,381 INFO L87 Difference]: Start difference. First operand 1574 states and 2115 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-02-06 08:32:49,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:32:49,814 INFO L93 Difference]: Finished difference Result 1713 states and 2305 transitions. [2025-02-06 08:32:49,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:32:49,815 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 839 [2025-02-06 08:32:49,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:32:49,822 INFO L225 Difference]: With dead ends: 1713 [2025-02-06 08:32:49,822 INFO L226 Difference]: Without dead ends: 1579 [2025-02-06 08:32:49,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:32:49,823 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 15 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 08:32:49,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1742 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 08:32:49,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2025-02-06 08:32:49,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1578. [2025-02-06 08:32:49,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1556 states have (on average 1.3406169665809768) internal successors, (2086), 1562 states have internal predecessors, (2086), 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-02-06 08:32:49,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2120 transitions. [2025-02-06 08:32:49,873 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2120 transitions. Word has length 839 [2025-02-06 08:32:49,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:32:49,875 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2120 transitions. [2025-02-06 08:32:49,875 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-02-06 08:32:49,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2120 transitions. [2025-02-06 08:32:49,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 840 [2025-02-06 08:32:49,884 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:32:49,884 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, 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-02-06 08:32:49,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 08:32:49,885 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:32:49,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:32:49,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1520637772, now seen corresponding path program 1 times [2025-02-06 08:32:49,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:32:49,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234670615] [2025-02-06 08:32:49,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:32:49,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:32:50,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 839 statements into 1 equivalence classes.