./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-2.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 d11f955236406002afd026860cf5cae6834e26918579de44c447a4ac30cb678d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:58:25,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:58:25,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 20:58:26,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:58:26,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:58:26,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:58:26,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:58:26,029 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:58:26,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:58:26,029 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:58:26,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:58:26,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:58:26,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:58:26,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:58:26,030 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:58:26,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:58:26,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:58:26,031 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 20:58:26,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:58:26,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 20:58:26,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:58:26,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:58:26,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:58:26,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:58:26,031 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 20:58:26,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:58:26,031 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:58:26,031 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:58:26,031 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:58:26,031 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:58:26,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:58:26,031 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:58:26,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:58:26,031 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:58:26,031 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:58:26,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:58:26,031 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:58:26,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:58:26,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:58:26,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:58:26,032 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:58:26,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:58:26,032 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:58:26,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:58:26,032 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:58:26,032 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:58:26,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:58:26,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:58:26,032 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 -> d11f955236406002afd026860cf5cae6834e26918579de44c447a4ac30cb678d [2025-01-09 20:58:26,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:58:26,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:58:26,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:58:26,267 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:58:26,268 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:58:26,268 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_SFH_test3-2.i [2025-01-09 20:58:27,523 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e26492e96/34b9b280af7447bebb49785da619933a/FLAG6eed9c152 [2025-01-09 20:58:27,878 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:58:27,880 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-2.i [2025-01-09 20:58:27,897 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e26492e96/34b9b280af7447bebb49785da619933a/FLAG6eed9c152 [2025-01-09 20:58:28,102 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e26492e96/34b9b280af7447bebb49785da619933a [2025-01-09 20:58:28,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:58:28,106 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:58:28,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:58:28,107 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:58:28,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:58:28,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:58:28" (1/1) ... [2025-01-09 20:58:28,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5324402c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:28, skipping insertion in model container [2025-01-09 20:58:28,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:58:28" (1/1) ... [2025-01-09 20:58:28,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:58:28,405 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_SFH_test3-2.i[33021,33034] [2025-01-09 20:58:28,470 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_SFH_test3-2.i[44590,44603] [2025-01-09 20:58:28,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:58:28,488 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:58:28,510 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_SFH_test3-2.i[33021,33034] [2025-01-09 20:58:28,547 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_SFH_test3-2.i[44590,44603] [2025-01-09 20:58:28,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:58:28,582 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:58:28,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:28 WrapperNode [2025-01-09 20:58:28,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:58:28,585 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:58:28,585 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:58:28,585 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:58:28,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:28" (1/1) ... [2025-01-09 20:58:28,616 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:28" (1/1) ... [2025-01-09 20:58:28,664 INFO L138 Inliner]: procedures = 177, calls = 328, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1569 [2025-01-09 20:58:28,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:58:28,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:58:28,665 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:58:28,665 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:58:28,676 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:28" (1/1) ... [2025-01-09 20:58:28,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:28" (1/1) ... [2025-01-09 20:58:28,690 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:28" (1/1) ... [2025-01-09 20:58:28,765 INFO L175 MemorySlicer]: Split 303 memory accesses to 3 slices as follows [2, 267, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2025-01-09 20:58:28,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:28" (1/1) ... [2025-01-09 20:58:28,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:28" (1/1) ... [2025-01-09 20:58:28,807 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:28" (1/1) ... [2025-01-09 20:58:28,809 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:28" (1/1) ... [2025-01-09 20:58:28,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:28" (1/1) ... [2025-01-09 20:58:28,827 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:28" (1/1) ... [2025-01-09 20:58:28,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:28" (1/1) ... [2025-01-09 20:58:28,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:58:28,843 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:58:28,844 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:58:28,844 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:58:28,844 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:28" (1/1) ... [2025-01-09 20:58:28,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:58:28,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:58:28,867 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 20:58:28,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 20:58:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:58:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:58:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:58:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 20:58:28,892 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 20:58:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:58:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:58:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:58:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 20:58:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 20:58:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 20:58:28,892 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 20:58:28,892 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 20:58:28,892 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 20:58:28,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:58:28,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:58:28,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:58:28,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:58:28,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:58:28,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:58:28,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:58:28,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:58:28,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:58:28,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:58:28,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:58:28,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:58:28,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:58:28,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:58:28,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:58:29,101 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:58:29,103 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:58:30,208 INFO L? ?]: Removed 344 outVars from TransFormulas that were not future-live. [2025-01-09 20:58:30,208 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:58:30,220 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:58:30,220 INFO L312 CfgBuilder]: Removed 35 assume(true) statements. [2025-01-09 20:58:30,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:58:30 BoogieIcfgContainer [2025-01-09 20:58:30,220 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:58:30,221 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:58:30,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:58:30,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:58:30,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:58:28" (1/3) ... [2025-01-09 20:58:30,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b1c69d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:58:30, skipping insertion in model container [2025-01-09 20:58:30,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:28" (2/3) ... [2025-01-09 20:58:30,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b1c69d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:58:30, skipping insertion in model container [2025-01-09 20:58:30,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:58:30" (3/3) ... [2025-01-09 20:58:30,226 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test3-2.i [2025-01-09 20:58:30,237 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:58:30,238 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test3-2.i that has 5 procedures, 450 locations, 1 initial locations, 43 loop locations, and 2 error locations. [2025-01-09 20:58:30,301 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:58:30,312 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;@3f96f3a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:58:30,313 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 20:58:30,318 INFO L276 IsEmpty]: Start isEmpty. Operand has 442 states, 429 states have (on average 1.6177156177156178) internal successors, (694), 436 states have internal predecessors, (694), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:58:30,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 20:58:30,321 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:58:30,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:58:30,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:58:30,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:58:30,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1337802752, now seen corresponding path program 1 times [2025-01-09 20:58:30,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:58:30,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913837050] [2025-01-09 20:58:30,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:58:30,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:58:30,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 20:58:30,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 20:58:30,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:58:30,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:58:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:58:30,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:58:30,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913837050] [2025-01-09 20:58:30,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913837050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:58:30,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:58:30,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 20:58:30,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590715360] [2025-01-09 20:58:30,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:58:30,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 20:58:30,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:58:30,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 20:58:30,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:58:30,484 INFO L87 Difference]: Start difference. First operand has 442 states, 429 states have (on average 1.6177156177156178) internal successors, (694), 436 states have internal predecessors, (694), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:58:30,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:58:30,536 INFO L93 Difference]: Finished difference Result 882 states and 1423 transitions. [2025-01-09 20:58:30,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 20:58:30,537 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 20:58:30,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:58:30,552 INFO L225 Difference]: With dead ends: 882 [2025-01-09 20:58:30,552 INFO L226 Difference]: Without dead ends: 406 [2025-01-09 20:58:30,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:58:30,557 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:58:30,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:58:30,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-01-09 20:58:30,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2025-01-09 20:58:30,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 394 states have (on average 1.4543147208121827) internal successors, (573), 400 states have internal predecessors, (573), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:58:30,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 589 transitions. [2025-01-09 20:58:30,613 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 589 transitions. Word has length 9 [2025-01-09 20:58:30,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:58:30,614 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 589 transitions. [2025-01-09 20:58:30,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:58:30,614 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 589 transitions. [2025-01-09 20:58:30,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 20:58:30,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:58:30,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:58:30,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:58:30,615 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:58:30,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:58:30,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1344578874, now seen corresponding path program 1 times [2025-01-09 20:58:30,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:58:30,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579790031] [2025-01-09 20:58:30,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:58:30,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:58:30,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 20:58:30,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 20:58:30,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:58:30,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:58:30,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:58:30,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:58:30,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579790031] [2025-01-09 20:58:30,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579790031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:58:30,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:58:30,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:58:30,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056121112] [2025-01-09 20:58:30,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:58:30,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:58:30,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:58:30,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:58:30,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:58:30,738 INFO L87 Difference]: Start difference. First operand 406 states and 589 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:58:30,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:58:30,844 INFO L93 Difference]: Finished difference Result 1004 states and 1466 transitions. [2025-01-09 20:58:30,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:58:30,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-09 20:58:30,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:58:30,848 INFO L225 Difference]: With dead ends: 1004 [2025-01-09 20:58:30,848 INFO L226 Difference]: Without dead ends: 799 [2025-01-09 20:58:30,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:58:30,849 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 558 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:58:30,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1787 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:58:30,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-01-09 20:58:30,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 408. [2025-01-09 20:58:30,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 396 states have (on average 1.452020202020202) internal successors, (575), 402 states have internal predecessors, (575), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:58:30,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 591 transitions. [2025-01-09 20:58:30,867 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 591 transitions. Word has length 14 [2025-01-09 20:58:30,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:58:30,867 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 591 transitions. [2025-01-09 20:58:30,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:58:30,867 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 591 transitions. [2025-01-09 20:58:30,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 20:58:30,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:58:30,869 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:58:30,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:58:30,869 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:58:30,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:58:30,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1326140866, now seen corresponding path program 1 times [2025-01-09 20:58:30,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:58:30,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365186702] [2025-01-09 20:58:30,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:58:30,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:58:30,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 20:58:30,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 20:58:30,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:58:30,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:58:31,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:58:31,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:58:31,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365186702] [2025-01-09 20:58:31,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365186702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:58:31,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:58:31,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:58:31,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264824511] [2025-01-09 20:58:31,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:58:31,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:58:31,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:58:31,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:58:31,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:58:31,223 INFO L87 Difference]: Start difference. First operand 408 states and 591 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:58:31,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:58:31,295 INFO L93 Difference]: Finished difference Result 770 states and 1112 transitions. [2025-01-09 20:58:31,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:58:31,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 20:58:31,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:58:31,297 INFO L225 Difference]: With dead ends: 770 [2025-01-09 20:58:31,297 INFO L226 Difference]: Without dead ends: 366 [2025-01-09 20:58:31,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:58:31,298 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 30 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:58:31,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1443 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:58:31,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-01-09 20:58:31,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2025-01-09 20:58:31,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 354 states have (on average 1.4067796610169492) internal successors, (498), 360 states have internal predecessors, (498), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:58:31,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 514 transitions. [2025-01-09 20:58:31,312 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 514 transitions. Word has length 90 [2025-01-09 20:58:31,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:58:31,312 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 514 transitions. [2025-01-09 20:58:31,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:58:31,312 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 514 transitions. [2025-01-09 20:58:31,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 20:58:31,314 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:58:31,314 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:58:31,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:58:31,314 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:58:31,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:58:31,315 INFO L85 PathProgramCache]: Analyzing trace with hash -790341556, now seen corresponding path program 1 times [2025-01-09 20:58:31,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:58:31,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542607532] [2025-01-09 20:58:31,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:58:31,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:58:31,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 20:58:31,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 20:58:31,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:58:31,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:58:31,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:58:31,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:58:31,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542607532] [2025-01-09 20:58:31,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542607532] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:58:31,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:58:31,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:58:31,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733378404] [2025-01-09 20:58:31,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:58:31,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:58:31,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:58:31,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:58:31,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:58:31,456 INFO L87 Difference]: Start difference. First operand 366 states and 514 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:58:31,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:58:31,496 INFO L93 Difference]: Finished difference Result 728 states and 1024 transitions. [2025-01-09 20:58:31,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:58:31,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 20:58:31,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:58:31,498 INFO L225 Difference]: With dead ends: 728 [2025-01-09 20:58:31,498 INFO L226 Difference]: Without dead ends: 366 [2025-01-09 20:58:31,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:58:31,499 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 1 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:58:31,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 978 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:58:31,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-01-09 20:58:31,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2025-01-09 20:58:31,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 354 states have (on average 1.3983050847457628) internal successors, (495), 360 states have internal predecessors, (495), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:58:31,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 511 transitions. [2025-01-09 20:58:31,508 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 511 transitions. Word has length 90 [2025-01-09 20:58:31,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:58:31,508 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 511 transitions. [2025-01-09 20:58:31,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:58:31,509 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 511 transitions. [2025-01-09 20:58:31,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 20:58:31,511 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:58:31,511 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:58:31,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:58:31,511 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:58:31,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:58:31,512 INFO L85 PathProgramCache]: Analyzing trace with hash 982351304, now seen corresponding path program 1 times [2025-01-09 20:58:31,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:58:31,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560525956] [2025-01-09 20:58:31,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:58:31,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:58:31,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 20:58:31,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 20:58:31,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:58:31,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:58:31,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:58:31,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:58:31,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560525956] [2025-01-09 20:58:31,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560525956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:58:31,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:58:31,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:58:31,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726351081] [2025-01-09 20:58:31,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:58:31,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:58:31,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:58:31,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:58:31,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:58:31,702 INFO L87 Difference]: Start difference. First operand 366 states and 511 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:58:31,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:58:31,782 INFO L93 Difference]: Finished difference Result 991 states and 1398 transitions. [2025-01-09 20:58:31,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:58:31,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 20:58:31,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:58:31,786 INFO L225 Difference]: With dead ends: 991 [2025-01-09 20:58:31,786 INFO L226 Difference]: Without dead ends: 629 [2025-01-09 20:58:31,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:58:31,787 INFO L435 NwaCegarLoop]: 712 mSDtfsCounter, 308 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:58:31,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1199 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:58:31,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2025-01-09 20:58:31,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 612. [2025-01-09 20:58:31,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 600 states have (on average 1.4116666666666666) internal successors, (847), 606 states have internal predecessors, (847), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:58:31,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 863 transitions. [2025-01-09 20:58:31,800 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 863 transitions. Word has length 90 [2025-01-09 20:58:31,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:58:31,800 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 863 transitions. [2025-01-09 20:58:31,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:58:31,800 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 863 transitions. [2025-01-09 20:58:31,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 20:58:31,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:58:31,803 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:58:31,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:58:31,803 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:58:31,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:58:31,804 INFO L85 PathProgramCache]: Analyzing trace with hash 72479039, now seen corresponding path program 1 times [2025-01-09 20:58:31,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:58:31,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200447595] [2025-01-09 20:58:31,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:58:31,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:58:31,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 20:58:31,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 20:58:31,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:58:31,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:58:32,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 20:58:32,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:58:32,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200447595] [2025-01-09 20:58:32,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200447595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:58:32,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:58:32,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:58:32,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517131255] [2025-01-09 20:58:32,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:58:32,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:58:32,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:58:32,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:58:32,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:58:32,150 INFO L87 Difference]: Start difference. First operand 612 states and 863 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:58:32,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:58:32,250 INFO L93 Difference]: Finished difference Result 909 states and 1286 transitions. [2025-01-09 20:58:32,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:58:32,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2025-01-09 20:58:32,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:58:32,256 INFO L225 Difference]: With dead ends: 909 [2025-01-09 20:58:32,256 INFO L226 Difference]: Without dead ends: 889 [2025-01-09 20:58:32,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:58:32,258 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 457 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:58:32,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1455 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:58:32,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2025-01-09 20:58:32,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 614. [2025-01-09 20:58:32,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 602 states have (on average 1.410299003322259) internal successors, (849), 608 states have internal predecessors, (849), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:58:32,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 865 transitions. [2025-01-09 20:58:32,277 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 865 transitions. Word has length 105 [2025-01-09 20:58:32,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:58:32,277 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 865 transitions. [2025-01-09 20:58:32,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:58:32,278 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 865 transitions. [2025-01-09 20:58:32,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 20:58:32,281 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:58:32,281 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:58:32,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:58:32,281 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:58:32,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:58:32,282 INFO L85 PathProgramCache]: Analyzing trace with hash 2126205530, now seen corresponding path program 1 times [2025-01-09 20:58:32,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:58:32,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075623189] [2025-01-09 20:58:32,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:58:32,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:58:32,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 20:58:32,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 20:58:32,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:58:32,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:58:32,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 20:58:32,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:58:32,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075623189] [2025-01-09 20:58:32,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075623189] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:58:32,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:58:32,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:58:32,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196291130] [2025-01-09 20:58:32,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:58:32,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:58:32,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:58:32,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:58:32,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:58:32,511 INFO L87 Difference]: Start difference. First operand 614 states and 865 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:58:32,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:58:32,575 INFO L93 Difference]: Finished difference Result 893 states and 1269 transitions. [2025-01-09 20:58:32,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:58:32,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2025-01-09 20:58:32,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:58:32,578 INFO L225 Difference]: With dead ends: 893 [2025-01-09 20:58:32,578 INFO L226 Difference]: Without dead ends: 530 [2025-01-09 20:58:32,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:58:32,580 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 30 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:58:32,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1196 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:58:32,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-01-09 20:58:32,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2025-01-09 20:58:32,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 518 states have (on average 1.3416988416988418) internal successors, (695), 524 states have internal predecessors, (695), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:58:32,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 711 transitions. [2025-01-09 20:58:32,595 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 711 transitions. Word has length 154 [2025-01-09 20:58:32,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:58:32,596 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 711 transitions. [2025-01-09 20:58:32,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:58:32,596 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 711 transitions. [2025-01-09 20:58:32,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 20:58:32,597 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:58:32,597 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:58:32,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 20:58:32,598 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:58:32,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:58:32,599 INFO L85 PathProgramCache]: Analyzing trace with hash 954691406, now seen corresponding path program 1 times [2025-01-09 20:58:32,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:58:32,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563707974] [2025-01-09 20:58:32,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:58:32,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:58:32,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 20:58:32,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 20:58:32,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:58:32,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:58:32,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:58:32,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:58:32,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563707974] [2025-01-09 20:58:32,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563707974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:58:32,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:58:32,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:58:32,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279403564] [2025-01-09 20:58:32,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:58:32,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:58:32,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:58:32,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:58:32,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:58:32,844 INFO L87 Difference]: Start difference. First operand 530 states and 711 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:58:33,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:58:33,300 INFO L93 Difference]: Finished difference Result 1338 states and 1813 transitions. [2025-01-09 20:58:33,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:58:33,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2025-01-09 20:58:33,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:58:33,304 INFO L225 Difference]: With dead ends: 1338 [2025-01-09 20:58:33,304 INFO L226 Difference]: Without dead ends: 899 [2025-01-09 20:58:33,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:58:33,305 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 934 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:58:33,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 1564 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 20:58:33,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2025-01-09 20:58:33,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 668. [2025-01-09 20:58:33,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 656 states have (on average 1.3460365853658536) internal successors, (883), 662 states have internal predecessors, (883), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 20:58:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 899 transitions. [2025-01-09 20:58:33,321 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 899 transitions. Word has length 154 [2025-01-09 20:58:33,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:58:33,322 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 899 transitions. [2025-01-09 20:58:33,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:58:33,322 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 899 transitions. [2025-01-09 20:58:33,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 20:58:33,323 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:58:33,323 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:58:33,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 20:58:33,323 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:58:33,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:58:33,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1648073187, now seen corresponding path program 1 times [2025-01-09 20:58:33,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:58:33,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314048382] [2025-01-09 20:58:33,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:58:33,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:58:33,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 20:58:33,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 20:58:33,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:58:33,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:58:33,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:58:33,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:58:33,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314048382] [2025-01-09 20:58:33,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314048382] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:58:33,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493853840] [2025-01-09 20:58:33,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:58:33,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:58:33,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:58:33,915 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:58:33,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 20:58:34,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 20:58:34,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 20:58:34,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:58:34,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:58:34,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 20:58:34,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:58:34,265 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-01-09 20:58:34,479 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 23 treesize of output 3 [2025-01-09 20:58:34,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 20:58:34,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:58:34,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:58:34,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:58:34,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493853840] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:58:34,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:58:34,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-01-09 20:58:34,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103063374] [2025-01-09 20:58:34,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:58:34,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 20:58:34,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:58:34,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 20:58:34,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-01-09 20:58:34,663 INFO L87 Difference]: Start difference. First operand 668 states and 899 transitions. Second operand has 11 states, 11 states have (on average 29.545454545454547) internal successors, (325), 11 states have internal predecessors, (325), 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-01-09 20:58:34,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:58:34,862 INFO L93 Difference]: Finished difference Result 2153 states and 2907 transitions. [2025-01-09 20:58:34,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 20:58:34,863 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 29.545454545454547) internal successors, (325), 11 states have internal predecessors, (325), 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 164 [2025-01-09 20:58:34,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:58:34,870 INFO L225 Difference]: With dead ends: 2153 [2025-01-09 20:58:34,870 INFO L226 Difference]: Without dead ends: 1733 [2025-01-09 20:58:34,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 321 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-01-09 20:58:34,873 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 1830 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1839 SdHoareTripleChecker+Valid, 2484 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:58:34,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1839 Valid, 2484 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:58:34,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2025-01-09 20:58:34,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1015. [2025-01-09 20:58:34,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 999 states have (on average 1.3353353353353354) internal successors, (1334), 1005 states have internal predecessors, (1334), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:58:34,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1356 transitions. [2025-01-09 20:58:34,907 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1356 transitions. Word has length 164 [2025-01-09 20:58:34,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:58:34,908 INFO L471 AbstractCegarLoop]: Abstraction has 1015 states and 1356 transitions. [2025-01-09 20:58:34,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 29.545454545454547) internal successors, (325), 11 states have internal predecessors, (325), 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-01-09 20:58:34,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1356 transitions. [2025-01-09 20:58:34,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-01-09 20:58:34,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:58:34,914 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:58:34,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 20:58:35,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:58:35,115 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:58:35,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:58:35,116 INFO L85 PathProgramCache]: Analyzing trace with hash -680423501, now seen corresponding path program 1 times [2025-01-09 20:58:35,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:58:35,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824768881] [2025-01-09 20:58:35,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:58:35,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:58:35,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-01-09 20:58:35,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-01-09 20:58:35,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:58:35,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:58:37,469 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:58:37,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:58:37,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824768881] [2025-01-09 20:58:37,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824768881] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:58:37,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280211916] [2025-01-09 20:58:37,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:58:37,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:58:37,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:58:37,472 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:58:37,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 20:58:37,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-01-09 20:58:38,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-01-09 20:58:38,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:58:38,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:58:38,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 20:58:38,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:58:38,069 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-01-09 20:58:38,291 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 23 treesize of output 3 [2025-01-09 20:58:38,436 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 36 treesize of output 13 [2025-01-09 20:58:38,549 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 36 treesize of output 13 [2025-01-09 20:58:38,643 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 36 treesize of output 13 [2025-01-09 20:58:38,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 20:58:38,653 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:58:38,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:58:39,072 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:58:39,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280211916] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:58:39,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:58:39,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 19 [2025-01-09 20:58:39,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069687003] [2025-01-09 20:58:39,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:58:39,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 20:58:39,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:58:39,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 20:58:39,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2025-01-09 20:58:39,075 INFO L87 Difference]: Start difference. First operand 1015 states and 1356 transitions. Second operand has 19 states, 19 states have (on average 41.31578947368421) internal successors, (785), 19 states have internal predecessors, (785), 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-01-09 20:58:39,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:58:39,593 INFO L93 Difference]: Finished difference Result 4250 states and 5748 transitions. [2025-01-09 20:58:39,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 20:58:39,594 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 41.31578947368421) internal successors, (785), 19 states have internal predecessors, (785), 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 392 [2025-01-09 20:58:39,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:58:39,610 INFO L225 Difference]: With dead ends: 4250 [2025-01-09 20:58:39,610 INFO L226 Difference]: Without dead ends: 3830 [2025-01-09 20:58:39,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 802 GetRequests, 775 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=427, Unknown=0, NotChecked=0, Total=650 [2025-01-09 20:58:39,613 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 3790 mSDsluCounter, 5141 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3820 SdHoareTripleChecker+Valid, 5596 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:58:39,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3820 Valid, 5596 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:58:39,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3830 states. [2025-01-09 20:58:39,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3830 to 1879. [2025-01-09 20:58:39,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1857 states have (on average 1.3257942918686052) internal successors, (2462), 1863 states have internal predecessors, (2462), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 20:58:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2496 transitions. [2025-01-09 20:58:39,692 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2496 transitions. Word has length 392 [2025-01-09 20:58:39,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:58:39,694 INFO L471 AbstractCegarLoop]: Abstraction has 1879 states and 2496 transitions. [2025-01-09 20:58:39,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 41.31578947368421) internal successors, (785), 19 states have internal predecessors, (785), 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-01-09 20:58:39,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2496 transitions. [2025-01-09 20:58:39,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 849 [2025-01-09 20:58:39,710 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:58:39,711 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:58:39,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 20:58:39,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:58:39,915 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:58:39,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:58:39,917 INFO L85 PathProgramCache]: Analyzing trace with hash -745768481, now seen corresponding path program 2 times [2025-01-09 20:58:39,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:58:39,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044370529] [2025-01-09 20:58:39,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 20:58:39,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:58:40,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 848 statements into 2 equivalence classes. [2025-01-09 20:58:40,199 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 73 of 848 statements. [2025-01-09 20:58:40,199 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 20:58:40,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:58:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 20:58:40,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:58:40,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044370529] [2025-01-09 20:58:40,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044370529] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:58:40,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:58:40,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:58:40,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384956914] [2025-01-09 20:58:40,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:58:40,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:58:40,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:58:40,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:58:40,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:58:40,477 INFO L87 Difference]: Start difference. First operand 1879 states and 2496 transitions. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:58:40,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:58:40,794 INFO L93 Difference]: Finished difference Result 2329 states and 3109 transitions. [2025-01-09 20:58:40,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:58:40,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 848 [2025-01-09 20:58:40,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:58:40,801 INFO L225 Difference]: With dead ends: 2329 [2025-01-09 20:58:40,802 INFO L226 Difference]: Without dead ends: 1912 [2025-01-09 20:58:40,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:58:40,804 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 20 mSDsluCounter, 1666 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2081 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:58:40,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2081 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:58:40,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2025-01-09 20:58:40,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1891. [2025-01-09 20:58:40,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1869 states have (on average 1.3237025147137507) internal successors, (2474), 1875 states have internal predecessors, (2474), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 20:58:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2508 transitions. [2025-01-09 20:58:40,844 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2508 transitions. Word has length 848 [2025-01-09 20:58:40,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:58:40,844 INFO L471 AbstractCegarLoop]: Abstraction has 1891 states and 2508 transitions. [2025-01-09 20:58:40,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:58:40,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2508 transitions. [2025-01-09 20:58:40,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2025-01-09 20:58:40,858 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:58:40,859 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:58:40,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 20:58:40,859 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:58:40,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:58:40,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1926391134, now seen corresponding path program 1 times [2025-01-09 20:58:40,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:58:40,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833756737] [2025-01-09 20:58:40,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:58:40,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:58:41,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 849 statements into 1 equivalence classes. [2025-01-09 20:58:41,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 849 of 849 statements. [2025-01-09 20:58:41,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:58:41,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:58:42,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 20:58:42,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:58:42,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833756737] [2025-01-09 20:58:42,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833756737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:58:42,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:58:42,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 20:58:42,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28797671] [2025-01-09 20:58:42,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:58:42,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 20:58:42,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:58:42,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 20:58:42,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:58:42,489 INFO L87 Difference]: Start difference. First operand 1891 states and 2508 transitions. Second operand has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:58:42,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:58:42,816 INFO L93 Difference]: Finished difference Result 2365 states and 3151 transitions. [2025-01-09 20:58:42,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:58:42,817 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 849 [2025-01-09 20:58:42,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:58:42,825 INFO L225 Difference]: With dead ends: 2365 [2025-01-09 20:58:42,825 INFO L226 Difference]: Without dead ends: 1936 [2025-01-09 20:58:42,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:58:42,827 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 24 mSDsluCounter, 2028 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 2436 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:58:42,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 2436 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:58:42,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2025-01-09 20:58:42,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1903. [2025-01-09 20:58:42,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1903 states, 1881 states have (on average 1.3232323232323233) internal successors, (2489), 1887 states have internal predecessors, (2489), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 20:58:42,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 2523 transitions. [2025-01-09 20:58:42,873 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 2523 transitions. Word has length 849 [2025-01-09 20:58:42,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:58:42,875 INFO L471 AbstractCegarLoop]: Abstraction has 1903 states and 2523 transitions. [2025-01-09 20:58:42,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:58:42,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 2523 transitions. [2025-01-09 20:58:42,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2025-01-09 20:58:42,881 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:58:42,881 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:58:42,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 20:58:42,881 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:58:42,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:58:42,882 INFO L85 PathProgramCache]: Analyzing trace with hash 95079467, now seen corresponding path program 1 times [2025-01-09 20:58:42,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:58:42,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651529904] [2025-01-09 20:58:42,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:58:42,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:58:43,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 850 statements into 1 equivalence classes. [2025-01-09 20:58:43,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 850 of 850 statements. [2025-01-09 20:58:43,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:58:43,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:58:44,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 20:58:44,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:58:44,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651529904] [2025-01-09 20:58:44,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651529904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:58:44,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:58:44,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:58:44,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285034515] [2025-01-09 20:58:44,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:58:44,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:58:44,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:58:44,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:58:44,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:58:44,967 INFO L87 Difference]: Start difference. First operand 1903 states and 2523 transitions. Second operand has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:58:45,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:58:45,367 INFO L93 Difference]: Finished difference Result 2377 states and 3172 transitions. [2025-01-09 20:58:45,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:58:45,368 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 850 [2025-01-09 20:58:45,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:58:45,373 INFO L225 Difference]: With dead ends: 2377 [2025-01-09 20:58:45,373 INFO L226 Difference]: Without dead ends: 1936 [2025-01-09 20:58:45,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:58:45,374 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 31 mSDsluCounter, 2450 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2861 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:58:45,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2861 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:58:45,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2025-01-09 20:58:45,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1927. [2025-01-09 20:58:45,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1927 states, 1905 states have (on average 1.3223097112860893) internal successors, (2519), 1911 states have internal predecessors, (2519), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 20:58:45,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 2553 transitions. [2025-01-09 20:58:45,410 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 2553 transitions. Word has length 850 [2025-01-09 20:58:45,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:58:45,410 INFO L471 AbstractCegarLoop]: Abstraction has 1927 states and 2553 transitions. [2025-01-09 20:58:45,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:58:45,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2553 transitions. [2025-01-09 20:58:45,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2025-01-09 20:58:45,415 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:58:45,416 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:58:45,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 20:58:45,416 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:58:45,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:58:45,417 INFO L85 PathProgramCache]: Analyzing trace with hash 319803524, now seen corresponding path program 1 times [2025-01-09 20:58:45,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:58:45,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679225076] [2025-01-09 20:58:45,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:58:45,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:58:45,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 850 statements into 1 equivalence classes. [2025-01-09 20:58:45,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 850 of 850 statements. [2025-01-09 20:58:45,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:58:45,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:58:46,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 20:58:46,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:58:46,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679225076] [2025-01-09 20:58:46,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679225076] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:58:46,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:58:46,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:58:46,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690320642] [2025-01-09 20:58:46,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:58:46,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:58:46,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:58:46,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:58:46,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:58:46,850 INFO L87 Difference]: Start difference. First operand 1927 states and 2553 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:58:47,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:58:47,086 INFO L93 Difference]: Finished difference Result 2419 states and 3214 transitions. [2025-01-09 20:58:47,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:58:47,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 850 [2025-01-09 20:58:47,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:58:47,093 INFO L225 Difference]: With dead ends: 2419 [2025-01-09 20:58:47,093 INFO L226 Difference]: Without dead ends: 1954 [2025-01-09 20:58:47,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:58:47,094 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 15 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2101 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:58:47,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2101 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:58:47,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2025-01-09 20:58:47,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1936. [2025-01-09 20:58:47,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1914 states have (on average 1.3207941483803554) internal successors, (2528), 1920 states have internal predecessors, (2528), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 20:58:47,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2562 transitions. [2025-01-09 20:58:47,127 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2562 transitions. Word has length 850 [2025-01-09 20:58:47,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:58:47,128 INFO L471 AbstractCegarLoop]: Abstraction has 1936 states and 2562 transitions. [2025-01-09 20:58:47,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:58:47,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2562 transitions. [2025-01-09 20:58:47,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2025-01-09 20:58:47,133 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:58:47,133 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:58:47,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 20:58:47,133 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:58:47,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:58:47,134 INFO L85 PathProgramCache]: Analyzing trace with hash 631151777, now seen corresponding path program 1 times [2025-01-09 20:58:47,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:58:47,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338568213] [2025-01-09 20:58:47,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:58:47,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:58:47,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 851 statements into 1 equivalence classes.