./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 05:58:50,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 05:58:51,053 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 05:58:51,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 05:58:51,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 05:58:51,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 05:58:51,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 05:58:51,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 05:58:51,088 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 05:58:51,088 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 05:58:51,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 05:58:51,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 05:58:51,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 05:58:51,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 05:58:51,090 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 05:58:51,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 05:58:51,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 05:58:51,090 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 05:58:51,090 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 05:58:51,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 05:58:51,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 05:58:51,090 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 05:58:51,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 05:58:51,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 05:58:51,091 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 05:58:51,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 05:58:51,091 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 05:58:51,091 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 05:58:51,091 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 05:58:51,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 05:58:51,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 05:58:51,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 05:58:51,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 05:58:51,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 05:58:51,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 05:58:51,092 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 05:58:51,092 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 05:58:51,092 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 05:58:51,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 05:58:51,092 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 05:58:51,092 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 05:58:51,092 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 05:58:51,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 05:58:51,092 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/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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2025-03-04 05:58:51,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 05:58:51,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 05:58:51,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 05:58:51,351 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 05:58:51,352 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 05:58:51,353 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-2.i [2025-03-04 05:58:52,517 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98210d352/956205f225b841febcc73c1f96f41b8f/FLAG81c1904af [2025-03-04 05:58:52,801 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 05:58:52,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-2.i [2025-03-04 05:58:52,814 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98210d352/956205f225b841febcc73c1f96f41b8f/FLAG81c1904af [2025-03-04 05:58:53,086 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98210d352/956205f225b841febcc73c1f96f41b8f [2025-03-04 05:58:53,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 05:58:53,088 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 05:58:53,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 05:58:53,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 05:58:53,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 05:58:53,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 05:58:53" (1/1) ... [2025-03-04 05:58:53,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5f9ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:53, skipping insertion in model container [2025-03-04 05:58:53,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 05:58:53" (1/1) ... [2025-03-04 05:58:53,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 05:58:53,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-2.i[33519,33532] [2025-03-04 05:58:53,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 05:58:53,483 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 05:58:53,508 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-2.i[33519,33532] [2025-03-04 05:58:53,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 05:58:53,585 INFO L204 MainTranslator]: Completed translation [2025-03-04 05:58:53,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:53 WrapperNode [2025-03-04 05:58:53,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 05:58:53,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 05:58:53,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 05:58:53,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 05:58:53,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:53" (1/1) ... [2025-03-04 05:58:53,612 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:53" (1/1) ... [2025-03-04 05:58:53,648 INFO L138 Inliner]: procedures = 176, calls = 220, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 930 [2025-03-04 05:58:53,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 05:58:53,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 05:58:53,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 05:58:53,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 05:58:53,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:53" (1/1) ... [2025-03-04 05:58:53,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:53" (1/1) ... [2025-03-04 05:58:53,660 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:53" (1/1) ... [2025-03-04 05:58:53,705 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50]. [2025-03-04 05:58:53,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:53" (1/1) ... [2025-03-04 05:58:53,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:53" (1/1) ... [2025-03-04 05:58:53,733 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:53" (1/1) ... [2025-03-04 05:58:53,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:53" (1/1) ... [2025-03-04 05:58:53,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:53" (1/1) ... [2025-03-04 05:58:53,747 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:53" (1/1) ... [2025-03-04 05:58:53,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 05:58:53,762 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 05:58:53,762 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 05:58:53,762 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 05:58:53,763 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:53" (1/1) ... [2025-03-04 05:58:53,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 05:58:53,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:58:53,789 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 05:58:53,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 05:58:53,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 05:58:53,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 05:58:53,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 05:58:53,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 05:58:53,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 05:58:53,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 05:58:53,809 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 05:58:53,809 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 05:58:53,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 05:58:53,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 05:58:53,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 05:58:53,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 05:58:53,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 05:58:53,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 05:58:53,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 05:58:53,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 05:58:53,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 05:58:53,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 05:58:53,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 05:58:53,977 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 05:58:53,978 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 05:58:54,765 INFO L? ?]: Removed 218 outVars from TransFormulas that were not future-live. [2025-03-04 05:58:54,766 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 05:58:54,814 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 05:58:54,814 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 05:58:54,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 05:58:54 BoogieIcfgContainer [2025-03-04 05:58:54,815 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 05:58:54,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 05:58:54,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 05:58:54,819 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 05:58:54,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 05:58:53" (1/3) ... [2025-03-04 05:58:54,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba6b927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 05:58:54, skipping insertion in model container [2025-03-04 05:58:54,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:53" (2/3) ... [2025-03-04 05:58:54,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba6b927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 05:58:54, skipping insertion in model container [2025-03-04 05:58:54,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 05:58:54" (3/3) ... [2025-03-04 05:58:54,821 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test1-2.i [2025-03-04 05:58:54,834 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 05:58:54,835 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_nondet_test1-2.i that has 3 procedures, 242 locations, 1 initial locations, 24 loop locations, and 1 error locations. [2025-03-04 05:58:54,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 05:58:54,891 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;@1ac4b8db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 05:58:54,892 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 05:58:54,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 238 states, 232 states have (on average 1.6077586206896552) internal successors, (373), 233 states have internal predecessors, (373), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 05:58:54,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 05:58:54,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:58:54,901 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 05:58:54,902 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:58:54,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:58:54,905 INFO L85 PathProgramCache]: Analyzing trace with hash -56827843, now seen corresponding path program 1 times [2025-03-04 05:58:54,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:58:54,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604030987] [2025-03-04 05:58:54,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:58:54,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:58:54,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 05:58:54,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 05:58:54,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:58:54,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:58:55,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 05:58:55,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:58:55,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604030987] [2025-03-04 05:58:55,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604030987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:58:55,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:58:55,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:58:55,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923741231] [2025-03-04 05:58:55,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:58:55,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:58:55,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:58:55,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:58:55,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:58:55,063 INFO L87 Difference]: Start difference. First operand has 238 states, 232 states have (on average 1.6077586206896552) internal successors, (373), 233 states have internal predecessors, (373), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 05:58:55,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:58:55,193 INFO L93 Difference]: Finished difference Result 665 states and 1066 transitions. [2025-03-04 05:58:55,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:58:55,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 05:58:55,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:58:55,201 INFO L225 Difference]: With dead ends: 665 [2025-03-04 05:58:55,201 INFO L226 Difference]: Without dead ends: 392 [2025-03-04 05:58:55,203 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-03-04 05:58:55,205 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 271 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:58:55,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 623 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:58:55,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-04 05:58:55,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 202. [2025-03-04 05:58:55,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 197 states have (on average 1.4416243654822336) internal successors, (284), 197 states have internal predecessors, (284), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 05:58:55,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 290 transitions. [2025-03-04 05:58:55,241 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 290 transitions. Word has length 6 [2025-03-04 05:58:55,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:58:55,242 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 290 transitions. [2025-03-04 05:58:55,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 05:58:55,242 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 290 transitions. [2025-03-04 05:58:55,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 05:58:55,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:58:55,246 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] [2025-03-04 05:58:55,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 05:58:55,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:58:55,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:58:55,248 INFO L85 PathProgramCache]: Analyzing trace with hash 564270677, now seen corresponding path program 1 times [2025-03-04 05:58:55,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:58:55,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564905914] [2025-03-04 05:58:55,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:58:55,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:58:55,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 05:58:55,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 05:58:55,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:58:55,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:58:55,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 05:58:55,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:58:55,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564905914] [2025-03-04 05:58:55,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564905914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:58:55,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:58:55,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:58:55,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736763229] [2025-03-04 05:58:55,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:58:55,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:58:55,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:58:55,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:58:55,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:58:55,621 INFO L87 Difference]: Start difference. First operand 202 states and 290 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 05:58:55,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:58:55,728 INFO L93 Difference]: Finished difference Result 404 states and 580 transitions. [2025-03-04 05:58:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:58:55,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-04 05:58:55,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:58:55,730 INFO L225 Difference]: With dead ends: 404 [2025-03-04 05:58:55,730 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 05:58:55,730 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-03-04 05:58:55,731 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 105 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:58:55,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 636 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:58:55,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 05:58:55,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2025-03-04 05:58:55,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 197 states have (on average 1.4060913705583757) internal successors, (277), 197 states have internal predecessors, (277), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 05:58:55,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 283 transitions. [2025-03-04 05:58:55,738 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 283 transitions. Word has length 79 [2025-03-04 05:58:55,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:58:55,738 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 283 transitions. [2025-03-04 05:58:55,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 05:58:55,738 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 283 transitions. [2025-03-04 05:58:55,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 05:58:55,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:58:55,743 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] [2025-03-04 05:58:55,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 05:58:55,743 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:58:55,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:58:55,744 INFO L85 PathProgramCache]: Analyzing trace with hash -564445604, now seen corresponding path program 1 times [2025-03-04 05:58:55,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:58:55,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262604006] [2025-03-04 05:58:55,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:58:55,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:58:55,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 05:58:55,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 05:58:55,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:58:55,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:58:55,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 05:58:55,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:58:55,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262604006] [2025-03-04 05:58:55,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262604006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:58:55,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:58:55,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:58:55,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715438859] [2025-03-04 05:58:55,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:58:55,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:58:55,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:58:55,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:58:55,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:58:55,921 INFO L87 Difference]: Start difference. First operand 202 states and 283 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 05:58:56,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:58:56,007 INFO L93 Difference]: Finished difference Result 528 states and 750 transitions. [2025-03-04 05:58:56,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:58:56,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-04 05:58:56,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:58:56,009 INFO L225 Difference]: With dead ends: 528 [2025-03-04 05:58:56,009 INFO L226 Difference]: Without dead ends: 329 [2025-03-04 05:58:56,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:58:56,010 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 134 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:58:56,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 510 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:58:56,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-04 05:58:56,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2025-03-04 05:58:56,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 324 states have (on average 1.4290123456790123) internal successors, (463), 324 states have internal predecessors, (463), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 05:58:56,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 469 transitions. [2025-03-04 05:58:56,021 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 469 transitions. Word has length 79 [2025-03-04 05:58:56,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:58:56,021 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 469 transitions. [2025-03-04 05:58:56,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 05:58:56,021 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 469 transitions. [2025-03-04 05:58:56,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 05:58:56,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:58:56,022 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] [2025-03-04 05:58:56,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 05:58:56,023 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:58:56,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:58:56,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1076255313, now seen corresponding path program 1 times [2025-03-04 05:58:56,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:58:56,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813620725] [2025-03-04 05:58:56,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:58:56,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:58:56,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 05:58:56,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 05:58:56,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:58:56,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:58:56,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 05:58:56,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:58:56,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813620725] [2025-03-04 05:58:56,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813620725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:58:56,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183154314] [2025-03-04 05:58:56,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:58:56,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:58:56,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:58:56,241 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:58:56,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 05:58:56,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 05:58:56,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 05:58:56,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:58:56,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:58:56,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 05:58:56,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:58:56,599 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 05:58:56,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 05:58:56,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 05:58:56,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183154314] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 05:58:56,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 05:58:56,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 05:58:56,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848277985] [2025-03-04 05:58:56,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 05:58:56,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 05:58:56,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:58:56,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 05:58:56,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:58:56,740 INFO L87 Difference]: Start difference. First operand 329 states and 469 transitions. Second operand has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 7 states have internal predecessors, (246), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 05:58:56,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:58:56,920 INFO L93 Difference]: Finished difference Result 777 states and 1100 transitions. [2025-03-04 05:58:56,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 05:58:56,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 7 states have internal predecessors, (246), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 94 [2025-03-04 05:58:56,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:58:56,924 INFO L225 Difference]: With dead ends: 777 [2025-03-04 05:58:56,924 INFO L226 Difference]: Without dead ends: 773 [2025-03-04 05:58:56,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 185 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-03-04 05:58:56,925 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 1188 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 1359 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:58:56,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 1359 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:58:56,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2025-03-04 05:58:56,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 773. [2025-03-04 05:58:56,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 759 states have (on average 1.4084321475625823) internal successors, (1069), 759 states have internal predecessors, (1069), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 05:58:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1093 transitions. [2025-03-04 05:58:56,968 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1093 transitions. Word has length 94 [2025-03-04 05:58:56,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:58:56,969 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 1093 transitions. [2025-03-04 05:58:56,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 7 states have internal predecessors, (246), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 05:58:56,969 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1093 transitions. [2025-03-04 05:58:56,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-04 05:58:56,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:58:56,977 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, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:58:56,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 05:58:57,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:58:57,178 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:58:57,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:58:57,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1868193078, now seen corresponding path program 1 times [2025-03-04 05:58:57,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:58:57,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218989049] [2025-03-04 05:58:57,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:58:57,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:58:57,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-04 05:58:57,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-04 05:58:57,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:58:57,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:58:57,973 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 4 proven. 317 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-03-04 05:58:57,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:58:57,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218989049] [2025-03-04 05:58:57,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218989049] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:58:57,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37200037] [2025-03-04 05:58:57,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:58:57,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:58:57,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:58:57,975 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:58:57,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 05:58:58,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-04 05:58:58,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-04 05:58:58,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:58:58,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:58:58,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 1654 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 05:58:58,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:58:58,857 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 436 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 05:58:58,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 05:58:59,218 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 436 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 05:58:59,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37200037] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 05:58:59,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 05:58:59,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-03-04 05:58:59,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024101909] [2025-03-04 05:58:59,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 05:58:59,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 05:58:59,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:58:59,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 05:58:59,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-04 05:58:59,221 INFO L87 Difference]: Start difference. First operand 773 states and 1093 transitions. Second operand has 16 states, 16 states have (on average 50.75) internal successors, (812), 16 states have internal predecessors, (812), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 05:59:00,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:00,484 INFO L93 Difference]: Finished difference Result 2291 states and 3261 transitions. [2025-03-04 05:59:00,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 05:59:00,485 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 50.75) internal successors, (812), 16 states have internal predecessors, (812), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 313 [2025-03-04 05:59:00,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:00,495 INFO L225 Difference]: With dead ends: 2291 [2025-03-04 05:59:00,495 INFO L226 Difference]: Without dead ends: 1839 [2025-03-04 05:59:00,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 616 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=312, Invalid=618, Unknown=0, NotChecked=0, Total=930 [2025-03-04 05:59:00,498 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 11081 mSDsluCounter, 2144 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11081 SdHoareTripleChecker+Valid, 2558 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:00,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11081 Valid, 2558 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 05:59:00,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2025-03-04 05:59:00,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1839. [2025-03-04 05:59:00,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1839 states, 1825 states have (on average 1.418082191780822) internal successors, (2588), 1825 states have internal predecessors, (2588), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 05:59:00,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2612 transitions. [2025-03-04 05:59:00,579 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2612 transitions. Word has length 313 [2025-03-04 05:59:00,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:00,580 INFO L471 AbstractCegarLoop]: Abstraction has 1839 states and 2612 transitions. [2025-03-04 05:59:00,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 50.75) internal successors, (812), 16 states have internal predecessors, (812), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 05:59:00,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2612 transitions. [2025-03-04 05:59:00,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2025-03-04 05:59:00,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:00,596 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, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:59:00,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 05:59:00,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:00,800 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:00,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:00,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1805775321, now seen corresponding path program 1 times [2025-03-04 05:59:00,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:00,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61330532] [2025-03-04 05:59:00,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:00,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:01,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 752 statements into 1 equivalence classes.