./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d4416b38cd75f122474354d64a020f92e3751959548582c6308a6e879679f77 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:54:38,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:54:38,834 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:54:38,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:54:38,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:54:38,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:54:38,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:54:38,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:54:38,855 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:54:38,855 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:54:38,855 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:54:38,855 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:54:38,855 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:54:38,855 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:54:38,855 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:54:38,855 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:54:38,855 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:54:38,856 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 20:54:38,856 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:54:38,856 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 20:54:38,856 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:54:38,856 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:54:38,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:54:38,856 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:54:38,856 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 20:54:38,856 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:54:38,856 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:54:38,856 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:54:38,857 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:54:38,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:54:38,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:54:38,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:54:38,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:54:38,857 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:54:38,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:54:38,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:54:38,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:54:38,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:54:38,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:54:38,857 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:54:38,858 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:54:38,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:54:38,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:54:38,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:54:38,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:54:38,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:54:38,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:54:38,858 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:54:38,858 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 -> 8d4416b38cd75f122474354d64a020f92e3751959548582c6308a6e879679f77 [2025-01-09 20:54:39,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:54:39,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:54:39,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:54:39,091 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:54:39,091 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:54:39,092 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_SAX_test4-1.i [2025-01-09 20:54:40,274 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a6fb9132/3ac34f56193949d49d1d6533c60f31a6/FLAG10835402b [2025-01-09 20:54:40,593 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:54:40,594 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-1.i [2025-01-09 20:54:40,604 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a6fb9132/3ac34f56193949d49d1d6533c60f31a6/FLAG10835402b [2025-01-09 20:54:40,857 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a6fb9132/3ac34f56193949d49d1d6533c60f31a6 [2025-01-09 20:54:40,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:54:40,860 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:54:40,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:54:40,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:54:40,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:54:40,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:54:40" (1/1) ... [2025-01-09 20:54:40,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dfe4e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:40, skipping insertion in model container [2025-01-09 20:54:40,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:54:40" (1/1) ... [2025-01-09 20:54:40,905 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:54:41,131 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_SAX_test4-1.i[33021,33034] [2025-01-09 20:54:41,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:54:41,209 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:54:41,246 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_SAX_test4-1.i[33021,33034] [2025-01-09 20:54:41,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:54:41,331 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:54:41,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:41 WrapperNode [2025-01-09 20:54:41,332 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:54:41,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:54:41,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:54:41,333 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:54:41,337 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:54:41" (1/1) ... [2025-01-09 20:54:41,359 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:54:41" (1/1) ... [2025-01-09 20:54:41,425 INFO L138 Inliner]: procedures = 176, calls = 335, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1540 [2025-01-09 20:54:41,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:54:41,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:54:41,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:54:41,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:54:41,433 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:41" (1/1) ... [2025-01-09 20:54:41,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:41" (1/1) ... [2025-01-09 20:54:41,450 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:41" (1/1) ... [2025-01-09 20:54:41,525 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2025-01-09 20:54:41,525 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:41" (1/1) ... [2025-01-09 20:54:41,525 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:41" (1/1) ... [2025-01-09 20:54:41,571 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:41" (1/1) ... [2025-01-09 20:54:41,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:41" (1/1) ... [2025-01-09 20:54:41,589 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:41" (1/1) ... [2025-01-09 20:54:41,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:41" (1/1) ... [2025-01-09 20:54:41,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:41" (1/1) ... [2025-01-09 20:54:41,613 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:54:41,616 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:54:41,616 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:54:41,616 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:54:41,617 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:41" (1/1) ... [2025-01-09 20:54:41,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:54:41,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:54:41,639 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:54:41,645 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:54:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:54:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:54:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 20:54:41,659 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 20:54:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:54:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:54:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 20:54:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 20:54:41,660 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 20:54:41,660 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 20:54:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:54:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:54:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:54:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:54:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:54:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:54:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:54:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:54:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:54:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:54:41,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:54:41,827 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:54:41,829 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:54:43,218 INFO L? ?]: Removed 387 outVars from TransFormulas that were not future-live. [2025-01-09 20:54:43,219 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:54:43,239 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:54:43,243 INFO L312 CfgBuilder]: Removed 28 assume(true) statements. [2025-01-09 20:54:43,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:54:43 BoogieIcfgContainer [2025-01-09 20:54:43,243 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:54:43,244 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:54:43,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:54:43,251 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:54:43,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:54:40" (1/3) ... [2025-01-09 20:54:43,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d0efae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:54:43, skipping insertion in model container [2025-01-09 20:54:43,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:54:41" (2/3) ... [2025-01-09 20:54:43,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d0efae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:54:43, skipping insertion in model container [2025-01-09 20:54:43,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:54:43" (3/3) ... [2025-01-09 20:54:43,253 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test4-1.i [2025-01-09 20:54:43,264 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:54:43,266 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test4-1.i that has 4 procedures, 424 locations, 1 initial locations, 36 loop locations, and 1 error locations. [2025-01-09 20:54:43,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:54:43,319 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;@138b6169, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:54:43,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 20:54:43,322 INFO L276 IsEmpty]: Start isEmpty. Operand has 420 states, 400 states have (on average 1.61) internal successors, (644), 411 states have internal predecessors, (644), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 20:54:43,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 20:54:43,325 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:43,326 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:54:43,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:43,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:43,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1546485800, now seen corresponding path program 1 times [2025-01-09 20:54:43,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:43,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008073307] [2025-01-09 20:54:43,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:43,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:43,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 20:54:43,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 20:54:43,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:43,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:43,476 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:54:43,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:43,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008073307] [2025-01-09 20:54:43,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008073307] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:54:43,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:54:43,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:54:43,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046139223] [2025-01-09 20:54:43,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:54:43,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:54:43,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:43,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:54:43,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:54:43,502 INFO L87 Difference]: Start difference. First operand has 420 states, 400 states have (on average 1.61) internal successors, (644), 411 states have internal predecessors, (644), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:54:43,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:43,595 INFO L93 Difference]: Finished difference Result 1220 states and 1978 transitions. [2025-01-09 20:54:43,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:54:43,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2025-01-09 20:54:43,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:43,610 INFO L225 Difference]: With dead ends: 1220 [2025-01-09 20:54:43,610 INFO L226 Difference]: Without dead ends: 799 [2025-01-09 20:54:43,614 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:54:43,619 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 543 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:54:43,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1271 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:54:43,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-01-09 20:54:43,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 418. [2025-01-09 20:54:43,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 399 states have (on average 1.4536340852130325) internal successors, (580), 409 states have internal predecessors, (580), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 20:54:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 612 transitions. [2025-01-09 20:54:43,711 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 612 transitions. Word has length 9 [2025-01-09 20:54:43,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:43,715 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 612 transitions. [2025-01-09 20:54:43,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:54:43,715 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 612 transitions. [2025-01-09 20:54:43,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 20:54:43,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:43,724 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:54:43,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:54:43,724 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:43,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:43,725 INFO L85 PathProgramCache]: Analyzing trace with hash -671645855, now seen corresponding path program 1 times [2025-01-09 20:54:43,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:43,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136884065] [2025-01-09 20:54:43,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:43,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:43,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 20:54:43,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 20:54:43,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:43,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:44,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:54:44,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:44,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136884065] [2025-01-09 20:54:44,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136884065] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:54:44,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:54:44,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:54:44,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466740363] [2025-01-09 20:54:44,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:54:44,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:54:44,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:44,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:54:44,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:54:44,190 INFO L87 Difference]: Start difference. First operand 418 states and 612 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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:54:44,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:44,280 INFO L93 Difference]: Finished difference Result 836 states and 1224 transitions. [2025-01-09 20:54:44,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:54:44,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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 153 [2025-01-09 20:54:44,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:44,282 INFO L225 Difference]: With dead ends: 836 [2025-01-09 20:54:44,282 INFO L226 Difference]: Without dead ends: 421 [2025-01-09 20:54:44,283 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:54:44,284 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 105 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:54:44,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1659 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:54:44,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-01-09 20:54:44,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 418. [2025-01-09 20:54:44,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 399 states have (on average 1.4360902255639099) internal successors, (573), 409 states have internal predecessors, (573), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 20:54:44,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 605 transitions. [2025-01-09 20:54:44,307 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 605 transitions. Word has length 153 [2025-01-09 20:54:44,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:44,309 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 605 transitions. [2025-01-09 20:54:44,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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:54:44,310 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 605 transitions. [2025-01-09 20:54:44,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 20:54:44,312 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:44,312 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:54:44,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:54:44,315 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:44,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:44,316 INFO L85 PathProgramCache]: Analyzing trace with hash 374563925, now seen corresponding path program 1 times [2025-01-09 20:54:44,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:44,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696458008] [2025-01-09 20:54:44,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:44,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:44,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 20:54:44,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 20:54:44,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:44,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:44,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:54:44,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:44,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696458008] [2025-01-09 20:54:44,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696458008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:54:44,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:54:44,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:54:44,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69922032] [2025-01-09 20:54:44,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:54:44,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:54:44,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:44,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:54:44,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:54:44,648 INFO L87 Difference]: Start difference. First operand 418 states and 605 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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:54:44,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:44,697 INFO L93 Difference]: Finished difference Result 961 states and 1395 transitions. [2025-01-09 20:54:44,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:54:44,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 153 [2025-01-09 20:54:44,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:44,703 INFO L225 Difference]: With dead ends: 961 [2025-01-09 20:54:44,704 INFO L226 Difference]: Without dead ends: 546 [2025-01-09 20:54:44,705 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:54:44,706 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 134 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:54:44,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1199 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:54:44,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-01-09 20:54:44,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2025-01-09 20:54:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 527 states have (on average 1.4421252371916509) internal successors, (760), 537 states have internal predecessors, (760), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 20:54:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 792 transitions. [2025-01-09 20:54:44,732 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 792 transitions. Word has length 153 [2025-01-09 20:54:44,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:44,732 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 792 transitions. [2025-01-09 20:54:44,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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:54:44,733 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 792 transitions. [2025-01-09 20:54:44,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 20:54:44,736 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:44,736 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:54:44,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:54:44,737 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:44,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:44,738 INFO L85 PathProgramCache]: Analyzing trace with hash -125318649, now seen corresponding path program 1 times [2025-01-09 20:54:44,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:44,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829146140] [2025-01-09 20:54:44,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:44,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:44,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 20:54:44,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 20:54:44,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:44,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:45,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:54:45,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:45,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829146140] [2025-01-09 20:54:45,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829146140] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:54:45,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:54:45,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:54:45,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319871348] [2025-01-09 20:54:45,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:54:45,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:54:45,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:45,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:54:45,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:54:45,096 INFO L87 Difference]: Start difference. First operand 546 states and 792 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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:54:45,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:45,158 INFO L93 Difference]: Finished difference Result 919 states and 1328 transitions. [2025-01-09 20:54:45,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:54:45,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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 168 [2025-01-09 20:54:45,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:45,161 INFO L225 Difference]: With dead ends: 919 [2025-01-09 20:54:45,161 INFO L226 Difference]: Without dead ends: 504 [2025-01-09 20:54:45,161 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:54:45,162 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 33 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:54:45,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1487 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:54:45,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-01-09 20:54:45,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2025-01-09 20:54:45,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 485 states have (on average 1.4082474226804125) internal successors, (683), 495 states have internal predecessors, (683), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 20:54:45,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 715 transitions. [2025-01-09 20:54:45,172 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 715 transitions. Word has length 168 [2025-01-09 20:54:45,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:45,172 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 715 transitions. [2025-01-09 20:54:45,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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:54:45,172 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 715 transitions. [2025-01-09 20:54:45,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 20:54:45,174 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:45,174 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:54:45,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:54:45,174 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:45,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:45,174 INFO L85 PathProgramCache]: Analyzing trace with hash 138940535, now seen corresponding path program 1 times [2025-01-09 20:54:45,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:45,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917925510] [2025-01-09 20:54:45,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:45,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:45,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 20:54:45,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 20:54:45,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:45,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:45,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:54:45,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:45,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917925510] [2025-01-09 20:54:45,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917925510] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:54:45,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:54:45,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:54:45,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477594455] [2025-01-09 20:54:45,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:54:45,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:54:45,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:45,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:54:45,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:54:45,395 INFO L87 Difference]: Start difference. First operand 504 states and 715 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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:54:45,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:45,431 INFO L93 Difference]: Finished difference Result 877 states and 1240 transitions. [2025-01-09 20:54:45,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:54:45,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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 168 [2025-01-09 20:54:45,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:45,433 INFO L225 Difference]: With dead ends: 877 [2025-01-09 20:54:45,434 INFO L226 Difference]: Without dead ends: 504 [2025-01-09 20:54:45,434 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:54:45,435 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 2 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:54:45,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1008 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:54:45,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-01-09 20:54:45,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2025-01-09 20:54:45,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 485 states have (on average 1.402061855670103) internal successors, (680), 495 states have internal predecessors, (680), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 20:54:45,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 712 transitions. [2025-01-09 20:54:45,445 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 712 transitions. Word has length 168 [2025-01-09 20:54:45,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:45,446 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 712 transitions. [2025-01-09 20:54:45,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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:54:45,446 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 712 transitions. [2025-01-09 20:54:45,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 20:54:45,447 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:45,447 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:54:45,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:54:45,447 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:45,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:45,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1211482307, now seen corresponding path program 1 times [2025-01-09 20:54:45,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:45,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691593414] [2025-01-09 20:54:45,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:45,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:45,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 20:54:45,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 20:54:45,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:45,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:54:45,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:45,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691593414] [2025-01-09 20:54:45,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691593414] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:54:45,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:54:45,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:54:45,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110143254] [2025-01-09 20:54:45,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:54:45,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:54:45,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:45,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:54:45,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:54:45,632 INFO L87 Difference]: Start difference. First operand 504 states and 712 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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:54:45,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:45,677 INFO L93 Difference]: Finished difference Result 1022 states and 1428 transitions. [2025-01-09 20:54:45,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:54:45,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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 168 [2025-01-09 20:54:45,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:45,682 INFO L225 Difference]: With dead ends: 1022 [2025-01-09 20:54:45,682 INFO L226 Difference]: Without dead ends: 649 [2025-01-09 20:54:45,683 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:54:45,683 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 243 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:54:45,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 1032 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:54:45,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-01-09 20:54:45,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2025-01-09 20:54:45,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 627 states have (on average 1.3827751196172249) internal successors, (867), 637 states have internal predecessors, (867), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 20:54:45,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 905 transitions. [2025-01-09 20:54:45,699 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 905 transitions. Word has length 168 [2025-01-09 20:54:45,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:45,699 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 905 transitions. [2025-01-09 20:54:45,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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:54:45,700 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 905 transitions. [2025-01-09 20:54:45,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 20:54:45,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:45,701 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:45,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:54:45,701 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:45,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:45,702 INFO L85 PathProgramCache]: Analyzing trace with hash 983887421, now seen corresponding path program 1 times [2025-01-09 20:54:45,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:45,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719788393] [2025-01-09 20:54:45,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:45,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:45,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 20:54:45,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 20:54:45,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:45,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:45,963 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:54:45,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:45,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719788393] [2025-01-09 20:54:45,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719788393] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:54:45,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978977847] [2025-01-09 20:54:45,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:45,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:54:45,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:54:45,967 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:54:45,970 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:54:46,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 20:54:46,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 20:54:46,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:46,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:46,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 20:54:46,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:54:46,550 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:54:46,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:54:46,757 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:54:46,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978977847] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:54:46,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:54:46,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 20:54:46,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534004727] [2025-01-09 20:54:46,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:54:46,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:54:46,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:46,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:54:46,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:54:46,760 INFO L87 Difference]: Start difference. First operand 649 states and 905 transitions. Second operand has 7 states, 7 states have (on average 68.0) internal successors, (476), 7 states have internal predecessors, (476), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:54:46,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:46,885 INFO L93 Difference]: Finished difference Result 1421 states and 1977 transitions. [2025-01-09 20:54:46,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:54:46,886 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 68.0) internal successors, (476), 7 states have internal predecessors, (476), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 183 [2025-01-09 20:54:46,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:46,891 INFO L225 Difference]: With dead ends: 1421 [2025-01-09 20:54:46,891 INFO L226 Difference]: Without dead ends: 1392 [2025-01-09 20:54:46,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:54:46,892 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 2304 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2320 SdHoareTripleChecker+Valid, 2167 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:54:46,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2320 Valid, 2167 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:54:46,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2025-01-09 20:54:46,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1392. [2025-01-09 20:54:46,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1355 states have (on average 1.3712177121771219) internal successors, (1858), 1365 states have internal predecessors, (1858), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 25 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 20:54:46,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1926 transitions. [2025-01-09 20:54:46,920 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1926 transitions. Word has length 183 [2025-01-09 20:54:46,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:46,920 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 1926 transitions. [2025-01-09 20:54:46,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 68.0) internal successors, (476), 7 states have internal predecessors, (476), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:54:46,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1926 transitions. [2025-01-09 20:54:46,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2025-01-09 20:54:46,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:46,930 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:46,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 20:54:47,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:54:47,131 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:47,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:47,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1245768534, now seen corresponding path program 1 times [2025-01-09 20:54:47,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:47,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796583805] [2025-01-09 20:54:47,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:47,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:47,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 615 statements into 1 equivalence classes. [2025-01-09 20:54:47,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 615 of 615 statements. [2025-01-09 20:54:47,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:47,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:48,480 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:54:48,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:48,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796583805] [2025-01-09 20:54:48,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796583805] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:54:48,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509101380] [2025-01-09 20:54:48,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:48,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:54:48,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:54:48,487 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:54:48,491 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:54:48,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 615 statements into 1 equivalence classes. [2025-01-09 20:54:49,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 615 of 615 statements. [2025-01-09 20:54:49,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:49,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:49,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 3084 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 20:54:49,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:54:49,870 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:54:49,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:54:50,428 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:54:50,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509101380] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:54:50,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:54:50,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-09 20:54:50,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971394603] [2025-01-09 20:54:50,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:54:50,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 20:54:50,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:50,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 20:54:50,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 20:54:50,432 INFO L87 Difference]: Start difference. First operand 1392 states and 1926 transitions. Second operand has 13 states, 13 states have (on average 103.07692307692308) internal successors, (1340), 13 states have internal predecessors, (1340), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:54:50,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:50,826 INFO L93 Difference]: Finished difference Result 3461 states and 4794 transitions. [2025-01-09 20:54:50,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 20:54:50,827 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 103.07692307692308) internal successors, (1340), 13 states have internal predecessors, (1340), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 615 [2025-01-09 20:54:50,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:50,839 INFO L225 Difference]: With dead ends: 3461 [2025-01-09 20:54:50,839 INFO L226 Difference]: Without dead ends: 3432 [2025-01-09 20:54:50,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1235 GetRequests, 1224 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 20:54:50,841 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 4880 mSDsluCounter, 4787 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4932 SdHoareTripleChecker+Valid, 5434 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:54:50,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4932 Valid, 5434 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:54:50,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2025-01-09 20:54:50,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 3432. [2025-01-09 20:54:50,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3432 states, 3359 states have (on average 1.3694551949985114) internal successors, (4600), 3369 states have internal predecessors, (4600), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 61 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 20:54:50,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3432 states to 3432 states and 4740 transitions. [2025-01-09 20:54:50,923 INFO L78 Accepts]: Start accepts. Automaton has 3432 states and 4740 transitions. Word has length 615 [2025-01-09 20:54:50,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:50,924 INFO L471 AbstractCegarLoop]: Abstraction has 3432 states and 4740 transitions. [2025-01-09 20:54:50,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 103.07692307692308) internal successors, (1340), 13 states have internal predecessors, (1340), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:54:50,925 INFO L276 IsEmpty]: Start isEmpty. Operand 3432 states and 4740 transitions. [2025-01-09 20:54:50,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1480 [2025-01-09 20:54:50,970 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:50,971 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:50,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 20:54:51,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:54:51,172 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:51,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:51,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1769737336, now seen corresponding path program 2 times [2025-01-09 20:54:51,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:51,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795735412] [2025-01-09 20:54:51,174 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 20:54:51,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:51,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1479 statements into 2 equivalence classes.