./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_SAX_nondet_test1-1.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 fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:32:32,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:32:32,979 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 10:32:32,984 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:32:32,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:32:33,006 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:32:33,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:32:33,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:32:33,007 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:32:33,007 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:32:33,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:32:33,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:32:33,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:32:33,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:32:33,007 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:32:33,009 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:32:33,009 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:32:33,009 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:32:33,010 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:32:33,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:32:33,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:32:33,010 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:32:33,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:32:33,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:32:33,010 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:32:33,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:32:33,011 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:32:33,011 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:32:33,011 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:32:33,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:32:33,011 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:32:33,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:32:33,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:32:33,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:32:33,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:32:33,011 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:32:33,011 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:32:33,011 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:32:33,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:32:33,011 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:32:33,011 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:32:33,011 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:32:33,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:32:33,011 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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2025-03-17 10:32:33,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:32:33,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:32:33,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:32:33,241 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:32:33,241 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:32:33,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i [2025-03-17 10:32:34,357 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/457696c6d/efdb553403ce40c0822ab116da94afc8/FLAG0bea5a2f8 [2025-03-17 10:32:34,660 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:32:34,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i [2025-03-17 10:32:34,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/457696c6d/efdb553403ce40c0822ab116da94afc8/FLAG0bea5a2f8 [2025-03-17 10:32:34,928 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/457696c6d/efdb553403ce40c0822ab116da94afc8 [2025-03-17 10:32:34,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:32:34,930 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:32:34,931 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:32:34,931 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:32:34,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:32:34,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:32:34" (1/1) ... [2025-03-17 10:32:34,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ddbd360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:32:34, skipping insertion in model container [2025-03-17 10:32:34,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:32:34" (1/1) ... [2025-03-17 10:32:34,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:32:35,264 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_SAX_nondet_test1-1.i[33519,33532] [2025-03-17 10:32:35,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:32:35,344 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:32:35,372 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_SAX_nondet_test1-1.i[33519,33532] [2025-03-17 10:32:35,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:32:35,447 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:32:35,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:32:35 WrapperNode [2025-03-17 10:32:35,448 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:32:35,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:32:35,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:32:35,449 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:32:35,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:32:35" (1/1) ... [2025-03-17 10:32:35,468 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:32:35" (1/1) ... [2025-03-17 10:32:35,494 INFO L138 Inliner]: procedures = 176, calls = 169, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 771 [2025-03-17 10:32:35,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:32:35,499 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:32:35,499 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:32:35,499 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:32:35,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:32:35" (1/1) ... [2025-03-17 10:32:35,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:32:35" (1/1) ... [2025-03-17 10:32:35,518 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:32:35" (1/1) ... [2025-03-17 10:32:35,567 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2025-03-17 10:32:35,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:32:35" (1/1) ... [2025-03-17 10:32:35,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:32:35" (1/1) ... [2025-03-17 10:32:35,596 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:32:35" (1/1) ... [2025-03-17 10:32:35,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:32:35" (1/1) ... [2025-03-17 10:32:35,604 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:32:35" (1/1) ... [2025-03-17 10:32:35,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:32:35" (1/1) ... [2025-03-17 10:32:35,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:32:35,621 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:32:35,621 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:32:35,621 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:32:35,622 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:32:35" (1/1) ... [2025-03-17 10:32:35,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:32:35,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:32:35,645 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-17 10:32:35,647 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-17 10:32:35,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 10:32:35,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 10:32:35,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 10:32:35,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 10:32:35,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 10:32:35,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 10:32:35,663 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 10:32:35,663 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 10:32:35,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:32:35,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:32:35,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 10:32:35,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 10:32:35,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 10:32:35,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 10:32:35,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:32:35,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 10:32:35,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 10:32:35,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:32:35,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:32:35,802 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:32:35,804 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:32:36,628 INFO L? ?]: Removed 194 outVars from TransFormulas that were not future-live. [2025-03-17 10:32:36,629 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:32:36,661 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:32:36,662 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 10:32:36,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:32:36 BoogieIcfgContainer [2025-03-17 10:32:36,662 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:32:36,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:32:36,665 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:32:36,668 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:32:36,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:32:34" (1/3) ... [2025-03-17 10:32:36,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74824826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:32:36, skipping insertion in model container [2025-03-17 10:32:36,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:32:35" (2/3) ... [2025-03-17 10:32:36,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74824826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:32:36, skipping insertion in model container [2025-03-17 10:32:36,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:32:36" (3/3) ... [2025-03-17 10:32:36,671 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test1-1.i [2025-03-17 10:32:36,681 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:32:36,682 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_nondet_test1-1.i that has 3 procedures, 207 locations, 1 initial locations, 19 loop locations, and 1 error locations. [2025-03-17 10:32:36,716 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:32:36,724 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;@3580c1cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:32:36,724 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 10:32:36,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 203 states, 197 states have (on average 1.6091370558375635) internal successors, (317), 198 states have internal predecessors, (317), 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-17 10:32:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 10:32:36,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:32:36,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 10:32:36,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:32:36,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:32:36,736 INFO L85 PathProgramCache]: Analyzing trace with hash 348627126, now seen corresponding path program 1 times [2025-03-17 10:32:36,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:32:36,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199493441] [2025-03-17 10:32:36,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:32:36,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:32:36,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 10:32:36,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 10:32:36,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:32:36,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:32:36,889 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-17 10:32:36,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:32:36,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199493441] [2025-03-17 10:32:36,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199493441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:32:36,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:32:36,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:32:36,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945191552] [2025-03-17 10:32:36,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:32:36,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:32:36,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:32:36,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:32:36,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:32:36,913 INFO L87 Difference]: Start difference. First operand has 203 states, 197 states have (on average 1.6091370558375635) internal successors, (317), 198 states have internal predecessors, (317), 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 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-17 10:32:37,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:32:37,040 INFO L93 Difference]: Finished difference Result 596 states and 955 transitions. [2025-03-17 10:32:37,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:32:37,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2025-03-17 10:32:37,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:32:37,049 INFO L225 Difference]: With dead ends: 596 [2025-03-17 10:32:37,049 INFO L226 Difference]: Without dead ends: 391 [2025-03-17 10:32:37,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-17 10:32:37,057 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 271 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:32:37,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 529 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:32:37,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-17 10:32:37,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 201. [2025-03-17 10:32:37,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 196 states have (on average 1.4438775510204083) internal successors, (283), 196 states have internal predecessors, (283), 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-17 10:32:37,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 289 transitions. [2025-03-17 10:32:37,107 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 289 transitions. Word has length 5 [2025-03-17 10:32:37,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:32:37,107 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 289 transitions. [2025-03-17 10:32:37,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-17 10:32:37,107 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 289 transitions. [2025-03-17 10:32:37,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 10:32:37,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:32:37,110 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] [2025-03-17 10:32:37,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:32:37,110 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:32:37,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:32:37,113 INFO L85 PathProgramCache]: Analyzing trace with hash -421975164, now seen corresponding path program 1 times [2025-03-17 10:32:37,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:32:37,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899395835] [2025-03-17 10:32:37,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:32:37,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:32:37,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 10:32:37,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 10:32:37,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:32:37,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:32:37,477 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-17 10:32:37,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:32:37,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899395835] [2025-03-17 10:32:37,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899395835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:32:37,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:32:37,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:32:37,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096889561] [2025-03-17 10:32:37,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:32:37,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:32:37,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:32:37,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:32:37,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:32:37,480 INFO L87 Difference]: Start difference. First operand 201 states and 289 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-17 10:32:37,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:32:37,605 INFO L93 Difference]: Finished difference Result 403 states and 579 transitions. [2025-03-17 10:32:37,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:32:37,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 78 [2025-03-17 10:32:37,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:32:37,607 INFO L225 Difference]: With dead ends: 403 [2025-03-17 10:32:37,608 INFO L226 Difference]: Without dead ends: 204 [2025-03-17 10:32:37,609 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-17 10:32:37,610 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 106 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:32:37,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 633 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:32:37,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-17 10:32:37,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2025-03-17 10:32:37,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 196 states have (on average 1.4081632653061225) internal successors, (276), 196 states have internal predecessors, (276), 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-17 10:32:37,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 282 transitions. [2025-03-17 10:32:37,626 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 282 transitions. Word has length 78 [2025-03-17 10:32:37,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:32:37,626 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 282 transitions. [2025-03-17 10:32:37,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-17 10:32:37,626 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 282 transitions. [2025-03-17 10:32:37,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 10:32:37,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:32:37,628 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] [2025-03-17 10:32:37,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:32:37,629 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:32:37,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:32:37,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1550691445, now seen corresponding path program 1 times [2025-03-17 10:32:37,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:32:37,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607224316] [2025-03-17 10:32:37,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:32:37,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:32:37,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 10:32:37,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 10:32:37,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:32:37,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:32:37,822 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-17 10:32:37,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:32:37,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607224316] [2025-03-17 10:32:37,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607224316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:32:37,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:32:37,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:32:37,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178693352] [2025-03-17 10:32:37,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:32:37,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:32:37,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:32:37,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:32:37,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:32:37,824 INFO L87 Difference]: Start difference. First operand 201 states and 282 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-17 10:32:37,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:32:37,896 INFO L93 Difference]: Finished difference Result 406 states and 571 transitions. [2025-03-17 10:32:37,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:32:37,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2025-03-17 10:32:37,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:32:37,898 INFO L225 Difference]: With dead ends: 406 [2025-03-17 10:32:37,898 INFO L226 Difference]: Without dead ends: 207 [2025-03-17 10:32:37,898 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-03-17 10:32:37,899 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 2 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:32:37,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 484 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:32:37,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-17 10:32:37,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2025-03-17 10:32:37,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.396039603960396) internal successors, (282), 202 states have internal predecessors, (282), 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-17 10:32:37,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 288 transitions. [2025-03-17 10:32:37,927 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 288 transitions. Word has length 78 [2025-03-17 10:32:37,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:32:37,927 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 288 transitions. [2025-03-17 10:32:37,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-17 10:32:37,927 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 288 transitions. [2025-03-17 10:32:37,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 10:32:37,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:32:37,928 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] [2025-03-17 10:32:37,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:32:37,931 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:32:37,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:32:37,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2050883146, now seen corresponding path program 1 times [2025-03-17 10:32:37,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:32:37,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107357301] [2025-03-17 10:32:37,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:32:37,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:32:37,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 10:32:37,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 10:32:37,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:32:37,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:32:38,071 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-17 10:32:38,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:32:38,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107357301] [2025-03-17 10:32:38,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107357301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:32:38,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:32:38,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:32:38,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007855701] [2025-03-17 10:32:38,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:32:38,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:32:38,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:32:38,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:32:38,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:32:38,074 INFO L87 Difference]: Start difference. First operand 207 states and 288 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 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-17 10:32:38,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:32:38,175 INFO L93 Difference]: Finished difference Result 545 states and 767 transitions. [2025-03-17 10:32:38,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:32:38,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 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 78 [2025-03-17 10:32:38,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:32:38,176 INFO L225 Difference]: With dead ends: 545 [2025-03-17 10:32:38,176 INFO L226 Difference]: Without dead ends: 340 [2025-03-17 10:32:38,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-17 10:32:38,177 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 134 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 508 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-17 10:32:38,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 508 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:32:38,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-17 10:32:38,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2025-03-17 10:32:38,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 335 states have (on average 1.4149253731343283) internal successors, (474), 335 states have internal predecessors, (474), 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-17 10:32:38,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 480 transitions. [2025-03-17 10:32:38,193 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 480 transitions. Word has length 78 [2025-03-17 10:32:38,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:32:38,193 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 480 transitions. [2025-03-17 10:32:38,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 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-17 10:32:38,193 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 480 transitions. [2025-03-17 10:32:38,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 10:32:38,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:32:38,195 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] [2025-03-17 10:32:38,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:32:38,195 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:32:38,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:32:38,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1723861688, now seen corresponding path program 1 times [2025-03-17 10:32:38,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:32:38,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620158982] [2025-03-17 10:32:38,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:32:38,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:32:38,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 10:32:38,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 10:32:38,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:32:38,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:32:38,419 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-17 10:32:38,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:32:38,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620158982] [2025-03-17 10:32:38,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620158982] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:32:38,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997298269] [2025-03-17 10:32:38,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:32:38,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:32:38,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:32:38,422 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-17 10:32:38,424 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-17 10:32:38,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 10:32:38,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 10:32:38,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:32:38,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:32:38,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 10:32:38,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:32:38,789 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-17 10:32:38,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:32:38,899 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-17 10:32:38,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997298269] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:32:38,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:32:38,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 10:32:38,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45765477] [2025-03-17 10:32:38,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:32:38,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:32:38,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:32:38,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:32:38,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:32:38,902 INFO L87 Difference]: Start difference. First operand 340 states and 480 transitions. Second operand has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 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-17 10:32:39,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:32:39,075 INFO L93 Difference]: Finished difference Result 800 states and 1123 transitions. [2025-03-17 10:32:39,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:32:39,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 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 93 [2025-03-17 10:32:39,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:32:39,083 INFO L225 Difference]: With dead ends: 800 [2025-03-17 10:32:39,083 INFO L226 Difference]: Without dead ends: 796 [2025-03-17 10:32:39,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 183 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-17 10:32:39,085 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 1270 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:32:39,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1278 Valid, 1051 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:32:39,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-03-17 10:32:39,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 796. [2025-03-17 10:32:39,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 782 states have (on average 1.3964194373401535) internal successors, (1092), 782 states have internal predecessors, (1092), 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-17 10:32:39,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1116 transitions. [2025-03-17 10:32:39,119 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1116 transitions. Word has length 93 [2025-03-17 10:32:39,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:32:39,119 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1116 transitions. [2025-03-17 10:32:39,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 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-17 10:32:39,120 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1116 transitions. [2025-03-17 10:32:39,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-17 10:32:39,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:32:39,124 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] [2025-03-17 10:32:39,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 10:32:39,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:32:39,325 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:32:39,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:32:39,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1768638472, now seen corresponding path program 1 times [2025-03-17 10:32:39,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:32:39,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042026057] [2025-03-17 10:32:39,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:32:39,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:32:39,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-17 10:32:39,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-17 10:32:39,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:32:39,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:32:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 4 proven. 156 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-17 10:32:39,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:32:39,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042026057] [2025-03-17 10:32:39,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042026057] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:32:39,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271956079] [2025-03-17 10:32:39,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:32:39,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:32:39,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:32:39,876 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-17 10:32:39,877 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-17 10:32:40,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-17 10:32:40,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-17 10:32:40,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:32:40,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:32:40,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 1654 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 10:32:40,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:32:40,649 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-17 10:32:40,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:32:40,992 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-17 10:32:40,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271956079] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:32:40,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:32:40,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-03-17 10:32:40,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528042646] [2025-03-17 10:32:40,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:32:40,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 10:32:40,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:32:40,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 10:32:40,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-17 10:32:40,995 INFO L87 Difference]: Start difference. First operand 796 states and 1116 transitions. Second operand has 14 states, 14 states have (on average 52.857142857142854) internal successors, (740), 14 states have internal predecessors, (740), 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-17 10:32:42,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:32:42,102 INFO L93 Difference]: Finished difference Result 2362 states and 3332 transitions. [2025-03-17 10:32:42,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 10:32:42,103 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 52.857142857142854) internal successors, (740), 14 states have internal predecessors, (740), 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 312 [2025-03-17 10:32:42,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:32:42,113 INFO L225 Difference]: With dead ends: 2362 [2025-03-17 10:32:42,113 INFO L226 Difference]: Without dead ends: 1898 [2025-03-17 10:32:42,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 615 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=238, Invalid=412, Unknown=0, NotChecked=0, Total=650 [2025-03-17 10:32:42,116 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 6396 mSDsluCounter, 2193 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6396 SdHoareTripleChecker+Valid, 2633 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 10:32:42,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6396 Valid, 2633 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 10:32:42,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2025-03-17 10:32:42,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1898. [2025-03-17 10:32:42,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1884 states have (on average 1.4049893842887473) internal successors, (2647), 1884 states have internal predecessors, (2647), 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-17 10:32:42,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2671 transitions. [2025-03-17 10:32:42,168 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2671 transitions. Word has length 312 [2025-03-17 10:32:42,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:32:42,169 INFO L471 AbstractCegarLoop]: Abstraction has 1898 states and 2671 transitions. [2025-03-17 10:32:42,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 52.857142857142854) internal successors, (740), 14 states have internal predecessors, (740), 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-17 10:32:42,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2671 transitions. [2025-03-17 10:32:42,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 752 [2025-03-17 10:32:42,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:32:42,184 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] [2025-03-17 10:32:42,195 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-17 10:32:42,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 10:32:42,385 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:32:42,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:32:42,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1021842706, now seen corresponding path program 1 times [2025-03-17 10:32:42,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:32:42,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52335567] [2025-03-17 10:32:42,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:32:42,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:32:42,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 751 statements into 1 equivalence classes.