./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.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/loops/verisec_OpenSER_cases1_stripFullBoth_arr.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 c1599706a72281425c0fc51552af364ca390697b315c5af0e88e5d6de4e668c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:28:54,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:28:54,111 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:28:54,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:28:54,117 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:28:54,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:28:54,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:28:54,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:28:54,140 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:28:54,140 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:28:54,141 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:28:54,141 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:28:54,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:28:54,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:28:54,142 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:28:54,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:28:54,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:28:54,142 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:28:54,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:28:54,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:28:54,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:28:54,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:28:54,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:28:54,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:28:54,143 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:28:54,143 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:28:54,143 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:28:54,143 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:28:54,143 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:28:54,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:28:54,143 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:28:54,143 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:28:54,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:28:54,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:28:54,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:28:54,144 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:28:54,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:28:54,144 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:28:54,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:28:54,144 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:28:54,144 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:28:54,144 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:28:54,145 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:28:54,145 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 -> c1599706a72281425c0fc51552af364ca390697b315c5af0e88e5d6de4e668c6 [2025-03-03 13:28:54,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:28:54,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:28:54,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:28:54,339 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:28:54,339 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:28:54,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2025-03-03 13:28:55,469 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae63d796f/c7c212a2feaa4a9db4f3a190b70582b7/FLAGa2a0e6364 [2025-03-03 13:28:55,684 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:28:55,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2025-03-03 13:28:55,698 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae63d796f/c7c212a2feaa4a9db4f3a190b70582b7/FLAGa2a0e6364 [2025-03-03 13:28:56,027 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae63d796f/c7c212a2feaa4a9db4f3a190b70582b7 [2025-03-03 13:28:56,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:28:56,031 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:28:56,032 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:28:56,032 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:28:56,035 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:28:56,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:28:56" (1/1) ... [2025-03-03 13:28:56,036 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@651527df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:56, skipping insertion in model container [2025-03-03 13:28:56,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:28:56" (1/1) ... [2025-03-03 13:28:56,047 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:28:56,160 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/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i[882,895] [2025-03-03 13:28:56,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:28:56,206 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:28:56,213 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/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i[882,895] [2025-03-03 13:28:56,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:28:56,251 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:28:56,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:56 WrapperNode [2025-03-03 13:28:56,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:28:56,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:28:56,253 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:28:56,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:28:56,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:56" (1/1) ... [2025-03-03 13:28:56,266 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:56" (1/1) ... [2025-03-03 13:28:56,284 INFO L138 Inliner]: procedures = 42, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2025-03-03 13:28:56,285 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:28:56,285 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:28:56,285 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:28:56,285 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:28:56,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:56" (1/1) ... [2025-03-03 13:28:56,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:56" (1/1) ... [2025-03-03 13:28:56,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:56" (1/1) ... [2025-03-03 13:28:56,308 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 10, 1]. 77 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2025-03-03 13:28:56,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:56" (1/1) ... [2025-03-03 13:28:56,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:56" (1/1) ... [2025-03-03 13:28:56,314 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:56" (1/1) ... [2025-03-03 13:28:56,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:56" (1/1) ... [2025-03-03 13:28:56,319 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:56" (1/1) ... [2025-03-03 13:28:56,320 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:56" (1/1) ... [2025-03-03 13:28:56,321 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:28:56,323 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:28:56,323 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:28:56,323 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:28:56,324 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:56" (1/1) ... [2025-03-03 13:28:56,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:28:56,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:28:56,346 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-03 13:28:56,349 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-03 13:28:56,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:28:56,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 13:28:56,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 13:28:56,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 13:28:56,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 13:28:56,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 13:28:56,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 13:28:56,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 13:28:56,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:28:56,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 13:28:56,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 13:28:56,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:28:56,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:28:56,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 13:28:56,432 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:28:56,433 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:28:56,587 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L42: havoc r_strncpy_#t~nondet1#1.base, r_strncpy_#t~nondet1#1.offset; [2025-03-03 13:28:56,588 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L61: call ULTIMATE.dealloc(parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset);havoc parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset; [2025-03-03 13:28:56,588 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L86: call ULTIMATE.dealloc(main_~#A~0#1.base, main_~#A~0#1.offset);havoc main_~#A~0#1.base, main_~#A~0#1.offset; [2025-03-03 13:28:56,601 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2025-03-03 13:28:56,602 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:28:56,610 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:28:56,611 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:28:56,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:28:56 BoogieIcfgContainer [2025-03-03 13:28:56,611 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:28:56,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:28:56,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:28:56,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:28:56,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:28:56" (1/3) ... [2025-03-03 13:28:56,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33af0e7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:28:56, skipping insertion in model container [2025-03-03 13:28:56,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:28:56" (2/3) ... [2025-03-03 13:28:56,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33af0e7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:28:56, skipping insertion in model container [2025-03-03 13:28:56,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:28:56" (3/3) ... [2025-03-03 13:28:56,617 INFO L128 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2025-03-03 13:28:56,627 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:28:56,629 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i that has 1 procedures, 33 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-03 13:28:56,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:28:56,679 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;@1c3c2188, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:28:56,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:28:56,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 32 states have internal predecessors, (49), 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-03 13:28:56,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 13:28:56,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:28:56,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:28:56,688 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:28:56,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:28:56,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1330944189, now seen corresponding path program 1 times [2025-03-03 13:28:56,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:28:56,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597934204] [2025-03-03 13:28:56,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:28:56,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:28:56,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:28:56,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:28:56,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:28:56,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:28:56,883 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-03 13:28:56,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:28:56,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597934204] [2025-03-03 13:28:56,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597934204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:28:56,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:28:56,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:28:56,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187124255] [2025-03-03 13:28:56,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:28:56,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:28:56,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:28:56,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:28:56,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:28:56,904 INFO L87 Difference]: Start difference. First operand has 33 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 32 states have internal predecessors, (49), 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) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-03 13:28:56,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:28:56,926 INFO L93 Difference]: Finished difference Result 64 states and 96 transitions. [2025-03-03 13:28:56,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:28:56,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2025-03-03 13:28:56,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:28:56,932 INFO L225 Difference]: With dead ends: 64 [2025-03-03 13:28:56,934 INFO L226 Difference]: Without dead ends: 29 [2025-03-03 13:28:56,937 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-03 13:28:56,940 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:28:56,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:28:56,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-03 13:28:56,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-03 13:28:56,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 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-03 13:28:56,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2025-03-03 13:28:56,968 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 18 [2025-03-03 13:28:56,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:28:56,968 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2025-03-03 13:28:56,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-03 13:28:56,969 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2025-03-03 13:28:56,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 13:28:56,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:28:56,969 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] [2025-03-03 13:28:56,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:28:56,971 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:28:56,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:28:56,971 INFO L85 PathProgramCache]: Analyzing trace with hash 311251625, now seen corresponding path program 1 times [2025-03-03 13:28:56,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:28:56,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978950330] [2025-03-03 13:28:56,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:28:56,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:28:56,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 13:28:57,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:28:57,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:28:57,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:28:57,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:28:57,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:28:57,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978950330] [2025-03-03 13:28:57,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978950330] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:28:57,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587334903] [2025-03-03 13:28:57,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:28:57,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:28:57,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:28:57,072 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-03 13:28:57,074 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-03 13:28:57,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 13:28:57,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:28:57,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:28:57,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:28:57,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 13:28:57,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:28:57,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:28:57,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:28:57,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587334903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:28:57,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:28:57,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-03-03 13:28:57,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495087040] [2025-03-03 13:28:57,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:28:57,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:28:57,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:28:57,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:28:57,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:28:57,252 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-03 13:28:57,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:28:57,318 INFO L93 Difference]: Finished difference Result 64 states and 87 transitions. [2025-03-03 13:28:57,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:28:57,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2025-03-03 13:28:57,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:28:57,319 INFO L225 Difference]: With dead ends: 64 [2025-03-03 13:28:57,319 INFO L226 Difference]: Without dead ends: 40 [2025-03-03 13:28:57,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:28:57,320 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:28:57,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 102 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:28:57,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-03 13:28:57,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2025-03-03 13:28:57,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 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-03 13:28:57,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2025-03-03 13:28:57,323 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 23 [2025-03-03 13:28:57,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:28:57,323 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2025-03-03 13:28:57,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-03 13:28:57,323 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2025-03-03 13:28:57,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 13:28:57,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:28:57,324 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] [2025-03-03 13:28:57,330 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-03 13:28:57,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:28:57,524 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:28:57,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:28:57,525 INFO L85 PathProgramCache]: Analyzing trace with hash 340804297, now seen corresponding path program 1 times [2025-03-03 13:28:57,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:28:57,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616177593] [2025-03-03 13:28:57,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:28:57,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:28:57,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 13:28:57,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:28:57,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:28:57,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:28:57,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:28:57,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:28:57,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616177593] [2025-03-03 13:28:57,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616177593] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:28:57,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865700994] [2025-03-03 13:28:57,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:28:57,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:28:57,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:28:57,617 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-03 13:28:57,618 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-03 13:28:57,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 13:28:57,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:28:57,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:28:57,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:28:57,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 13:28:57,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:28:57,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:28:57,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:28:57,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:28:57,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865700994] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:28:57,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:28:57,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 13:28:57,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453107274] [2025-03-03 13:28:57,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:28:57,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 13:28:57,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:28:57,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 13:28:57,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:28:57,715 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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-03 13:28:57,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:28:57,726 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2025-03-03 13:28:57,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:28:57,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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 23 [2025-03-03 13:28:57,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:28:57,727 INFO L225 Difference]: With dead ends: 65 [2025-03-03 13:28:57,727 INFO L226 Difference]: Without dead ends: 36 [2025-03-03 13:28:57,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 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-03 13:28:57,727 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:28:57,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:28:57,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-03 13:28:57,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-03 13:28:57,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 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-03 13:28:57,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2025-03-03 13:28:57,735 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 23 [2025-03-03 13:28:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:28:57,735 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2025-03-03 13:28:57,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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-03 13:28:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2025-03-03 13:28:57,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 13:28:57,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:28:57,736 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:28:57,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 13:28:57,940 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,SelfDestructingSolverStorable2 [2025-03-03 13:28:57,940 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:28:57,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:28:57,940 INFO L85 PathProgramCache]: Analyzing trace with hash 960024205, now seen corresponding path program 2 times [2025-03-03 13:28:57,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:28:57,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095101733] [2025-03-03 13:28:57,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:28:57,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:28:57,950 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-03 13:28:57,958 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 26 statements. [2025-03-03 13:28:57,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 13:28:57,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:28:58,113 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 13:28:58,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:28:58,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095101733] [2025-03-03 13:28:58,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095101733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:28:58,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:28:58,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 13:28:58,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13741856] [2025-03-03 13:28:58,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:28:58,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 13:28:58,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:28:58,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 13:28:58,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:28:58,116 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-03 13:28:58,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:28:58,233 INFO L93 Difference]: Finished difference Result 115 states and 151 transitions. [2025-03-03 13:28:58,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:28:58,233 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 26 [2025-03-03 13:28:58,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:28:58,234 INFO L225 Difference]: With dead ends: 115 [2025-03-03 13:28:58,234 INFO L226 Difference]: Without dead ends: 68 [2025-03-03 13:28:58,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:28:58,235 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 51 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:28:58,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 149 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:28:58,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-03 13:28:58,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 43. [2025-03-03 13:28:58,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 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-03 13:28:58,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2025-03-03 13:28:58,240 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 26 [2025-03-03 13:28:58,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:28:58,241 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2025-03-03 13:28:58,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-03 13:28:58,241 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2025-03-03 13:28:58,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 13:28:58,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:28:58,241 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:28:58,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 13:28:58,241 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:28:58,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:28:58,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1089106924, now seen corresponding path program 1 times [2025-03-03 13:28:58,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:28:58,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241021724] [2025-03-03 13:28:58,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:28:58,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:28:58,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 13:28:58,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:28:58,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:28:58,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:28:58,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 13:28:58,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:28:58,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241021724] [2025-03-03 13:28:58,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241021724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:28:58,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:28:58,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:28:58,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172041728] [2025-03-03 13:28:58,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:28:58,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:28:58,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:28:58,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:28:58,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:28:58,422 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-03 13:28:58,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:28:58,480 INFO L93 Difference]: Finished difference Result 78 states and 99 transitions. [2025-03-03 13:28:58,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:28:58,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 26 [2025-03-03 13:28:58,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:28:58,482 INFO L225 Difference]: With dead ends: 78 [2025-03-03 13:28:58,482 INFO L226 Difference]: Without dead ends: 76 [2025-03-03 13:28:58,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:28:58,483 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 27 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 97 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.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:28:58,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 97 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:28:58,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-03 13:28:58,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2025-03-03 13:28:58,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 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-03 13:28:58,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2025-03-03 13:28:58,488 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 26 [2025-03-03 13:28:58,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:28:58,488 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2025-03-03 13:28:58,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-03 13:28:58,488 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2025-03-03 13:28:58,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 13:28:58,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:28:58,489 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:28:58,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 13:28:58,489 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:28:58,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:28:58,489 INFO L85 PathProgramCache]: Analyzing trace with hash 642016522, now seen corresponding path program 1 times [2025-03-03 13:28:58,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:28:58,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393655002] [2025-03-03 13:28:58,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:28:58,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:28:58,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 13:28:58,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 13:28:58,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:28:58,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:28:58,567 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:28:58,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:28:58,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393655002] [2025-03-03 13:28:58,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393655002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:28:58,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042809778] [2025-03-03 13:28:58,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:28:58,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:28:58,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:28:58,569 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:28:58,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 13:28:58,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 13:28:58,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 13:28:58,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:28:58,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:28:58,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 13:28:58,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:28:58,649 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:28:58,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:28:58,685 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:28:58,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042809778] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:28:58,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:28:58,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-03-03 13:28:58,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617213494] [2025-03-03 13:28:58,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:28:58,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 13:28:58,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:28:58,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 13:28:58,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:28:58,687 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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-03 13:28:58,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:28:58,702 INFO L93 Difference]: Finished difference Result 126 states and 166 transitions. [2025-03-03 13:28:58,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 13:28:58,703 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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 28 [2025-03-03 13:28:58,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:28:58,703 INFO L225 Difference]: With dead ends: 126 [2025-03-03 13:28:58,703 INFO L226 Difference]: Without dead ends: 68 [2025-03-03 13:28:58,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:28:58,704 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:28:58,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:28:58,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-03 13:28:58,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-03 13:28:58,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 67 states have internal predecessors, (87), 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-03 13:28:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2025-03-03 13:28:58,712 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 28 [2025-03-03 13:28:58,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:28:58,713 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2025-03-03 13:28:58,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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-03 13:28:58,713 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2025-03-03 13:28:58,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 13:28:58,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:28:58,713 INFO L218 NwaCegarLoop]: trace histogram [7, 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-03 13:28:58,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 13:28:58,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:28:58,914 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:28:58,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:28:58,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1383109574, now seen corresponding path program 2 times [2025-03-03 13:28:58,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:28:58,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18751946] [2025-03-03 13:28:58,914 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:28:58,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:28:58,925 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-03 13:28:58,929 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 31 statements. [2025-03-03 13:28:58,929 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 13:28:58,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:28:58,993 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 13:28:58,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:28:58,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18751946] [2025-03-03 13:28:58,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18751946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:28:58,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:28:58,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:28:58,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394642598] [2025-03-03 13:28:58,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:28:58,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:28:58,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:28:58,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:28:58,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:28:58,996 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-03 13:28:59,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:28:59,048 INFO L93 Difference]: Finished difference Result 125 states and 157 transitions. [2025-03-03 13:28:59,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:28:59,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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 31 [2025-03-03 13:28:59,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:28:59,049 INFO L225 Difference]: With dead ends: 125 [2025-03-03 13:28:59,049 INFO L226 Difference]: Without dead ends: 85 [2025-03-03 13:28:59,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:28:59,052 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 25 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:28:59,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 133 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:28:59,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-03 13:28:59,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 71. [2025-03-03 13:28:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 70 states have internal predecessors, (90), 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-03 13:28:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2025-03-03 13:28:59,057 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 31 [2025-03-03 13:28:59,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:28:59,057 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2025-03-03 13:28:59,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-03 13:28:59,057 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2025-03-03 13:28:59,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 13:28:59,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:28:59,058 INFO L218 NwaCegarLoop]: trace histogram [7, 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] [2025-03-03 13:28:59,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 13:28:59,058 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:28:59,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:28:59,058 INFO L85 PathProgramCache]: Analyzing trace with hash -94470746, now seen corresponding path program 1 times [2025-03-03 13:28:59,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:28:59,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169335620] [2025-03-03 13:28:59,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:28:59,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:28:59,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 13:28:59,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 13:28:59,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:28:59,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:28:59,199 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 13:28:59,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:28:59,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169335620] [2025-03-03 13:28:59,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169335620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:28:59,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:28:59,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 13:28:59,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478684712] [2025-03-03 13:28:59,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:28:59,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 13:28:59,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:28:59,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 13:28:59,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:28:59,200 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-03 13:28:59,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:28:59,296 INFO L93 Difference]: Finished difference Result 135 states and 173 transitions. [2025-03-03 13:28:59,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:28:59,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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 33 [2025-03-03 13:28:59,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:28:59,297 INFO L225 Difference]: With dead ends: 135 [2025-03-03 13:28:59,297 INFO L226 Difference]: Without dead ends: 102 [2025-03-03 13:28:59,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:28:59,299 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 49 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:28:59,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 171 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:28:59,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-03 13:28:59,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 82. [2025-03-03 13:28:59,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.308641975308642) internal successors, (106), 81 states have internal predecessors, (106), 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-03 13:28:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2025-03-03 13:28:59,306 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 33 [2025-03-03 13:28:59,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:28:59,306 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2025-03-03 13:28:59,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-03 13:28:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2025-03-03 13:28:59,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 13:28:59,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:28:59,307 INFO L218 NwaCegarLoop]: trace histogram [7, 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] [2025-03-03 13:28:59,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 13:28:59,307 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:28:59,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:28:59,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1390209092, now seen corresponding path program 1 times [2025-03-03 13:28:59,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:28:59,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029043141] [2025-03-03 13:28:59,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:28:59,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:28:59,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 13:28:59,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 13:28:59,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:28:59,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:28:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 13:28:59,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:28:59,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029043141] [2025-03-03 13:28:59,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029043141] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:28:59,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134082208] [2025-03-03 13:28:59,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:28:59,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:28:59,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:28:59,417 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:28:59,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 13:28:59,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 13:28:59,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 13:28:59,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:28:59,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:28:59,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 13:28:59,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:28:59,522 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 13:28:59,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:28:59,554 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 13:28:59,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134082208] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:28:59,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:28:59,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2025-03-03 13:28:59,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671848929] [2025-03-03 13:28:59,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:28:59,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 13:28:59,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:28:59,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 13:28:59,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:28:59,555 INFO L87 Difference]: Start difference. First operand 82 states and 106 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-03 13:28:59,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:28:59,624 INFO L93 Difference]: Finished difference Result 190 states and 241 transitions. [2025-03-03 13:28:59,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 13:28:59,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 35 [2025-03-03 13:28:59,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:28:59,625 INFO L225 Difference]: With dead ends: 190 [2025-03-03 13:28:59,625 INFO L226 Difference]: Without dead ends: 137 [2025-03-03 13:28:59,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-03 13:28:59,626 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 59 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:28:59,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 151 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:28:59,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-03 13:28:59,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 114. [2025-03-03 13:28:59,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.2743362831858407) internal successors, (144), 113 states have internal predecessors, (144), 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-03 13:28:59,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 144 transitions. [2025-03-03 13:28:59,642 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 144 transitions. Word has length 35 [2025-03-03 13:28:59,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:28:59,642 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 144 transitions. [2025-03-03 13:28:59,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-03 13:28:59,642 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 144 transitions. [2025-03-03 13:28:59,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 13:28:59,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:28:59,643 INFO L218 NwaCegarLoop]: trace histogram [7, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:28:59,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 13:28:59,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:28:59,843 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:28:59,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:28:59,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1467961375, now seen corresponding path program 2 times [2025-03-03 13:28:59,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:28:59,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876412501] [2025-03-03 13:28:59,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:28:59,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:28:59,855 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-03 13:28:59,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:28:59,867 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:28:59,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:29:00,025 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 13:29:00,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:29:00,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876412501] [2025-03-03 13:29:00,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876412501] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:29:00,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877915671] [2025-03-03 13:29:00,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:29:00,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:00,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:29:00,027 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:29:00,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 13:29:00,080 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-03 13:29:00,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:29:00,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:29:00,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:29:00,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 13:29:00,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:29:00,259 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 13:29:00,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:29:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 13:29:00,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877915671] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:29:00,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:29:00,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 20 [2025-03-03 13:29:00,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090763499] [2025-03-03 13:29:00,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:29:00,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 13:29:00,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:29:00,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 13:29:00,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2025-03-03 13:29:00,345 INFO L87 Difference]: Start difference. First operand 114 states and 144 transitions. Second operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 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-03 13:29:00,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:29:00,884 INFO L93 Difference]: Finished difference Result 378 states and 501 transitions. [2025-03-03 13:29:00,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 13:29:00,884 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 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 39 [2025-03-03 13:29:00,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:29:00,885 INFO L225 Difference]: With dead ends: 378 [2025-03-03 13:29:00,885 INFO L226 Difference]: Without dead ends: 209 [2025-03-03 13:29:00,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=297, Invalid=1035, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 13:29:00,886 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 536 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:29:00,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 573 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:29:00,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-03 13:29:00,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 133. [2025-03-03 13:29:00,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.2954545454545454) internal successors, (171), 132 states have internal predecessors, (171), 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-03 13:29:00,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 171 transitions. [2025-03-03 13:29:00,891 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 171 transitions. Word has length 39 [2025-03-03 13:29:00,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:29:00,892 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 171 transitions. [2025-03-03 13:29:00,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 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-03 13:29:00,892 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 171 transitions. [2025-03-03 13:29:00,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 13:29:00,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:29:00,893 INFO L218 NwaCegarLoop]: trace histogram [7, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:29:00,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 13:29:01,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 13:29:01,093 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:29:01,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:29:01,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1973520000, now seen corresponding path program 1 times [2025-03-03 13:29:01,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:29:01,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9791437] [2025-03-03 13:29:01,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:29:01,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:29:01,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 13:29:01,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:29:01,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:29:01,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:29:01,227 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 13:29:01,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:29:01,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9791437] [2025-03-03 13:29:01,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9791437] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:29:01,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587730387] [2025-03-03 13:29:01,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:29:01,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:01,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:29:01,230 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:29:01,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 13:29:01,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 13:29:01,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:29:01,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:29:01,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:29:01,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 13:29:01,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:29:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 13:29:01,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:29:01,631 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 13:29:01,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587730387] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:29:01,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:29:01,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-03 13:29:01,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007214344] [2025-03-03 13:29:01,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:29:01,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 13:29:01,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:29:01,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 13:29:01,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2025-03-03 13:29:01,633 INFO L87 Difference]: Start difference. First operand 133 states and 171 transitions. Second operand has 22 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 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-03 13:29:01,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:29:01,994 INFO L93 Difference]: Finished difference Result 245 states and 306 transitions. [2025-03-03 13:29:01,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 13:29:01,995 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 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 39 [2025-03-03 13:29:01,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:29:01,996 INFO L225 Difference]: With dead ends: 245 [2025-03-03 13:29:01,996 INFO L226 Difference]: Without dead ends: 243 [2025-03-03 13:29:01,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=271, Invalid=919, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 13:29:01,997 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 283 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:29:01,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 375 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:29:01,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-03 13:29:02,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 153. [2025-03-03 13:29:02,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.3289473684210527) internal successors, (202), 152 states have internal predecessors, (202), 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-03 13:29:02,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 202 transitions. [2025-03-03 13:29:02,005 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 202 transitions. Word has length 39 [2025-03-03 13:29:02,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:29:02,005 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 202 transitions. [2025-03-03 13:29:02,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 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-03 13:29:02,005 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 202 transitions. [2025-03-03 13:29:02,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 13:29:02,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:29:02,006 INFO L218 NwaCegarLoop]: trace histogram [7, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:29:02,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 13:29:02,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:02,206 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:29:02,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:29:02,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1972596479, now seen corresponding path program 1 times [2025-03-03 13:29:02,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:29:02,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762926500] [2025-03-03 13:29:02,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:29:02,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:29:02,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 13:29:02,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:29:02,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:29:02,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 13:29:02,237 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 13:29:02,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 13:29:02,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:29:02,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:29:02,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 13:29:02,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 13:29:02,273 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 13:29:02,273 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 13:29:02,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 13:29:02,277 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-03 13:29:02,308 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 13:29:02,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 01:29:02 BoogieIcfgContainer [2025-03-03 13:29:02,311 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 13:29:02,311 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 13:29:02,311 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 13:29:02,311 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 13:29:02,312 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:28:56" (3/4) ... [2025-03-03 13:29:02,313 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 13:29:02,314 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 13:29:02,315 INFO L158 Benchmark]: Toolchain (without parser) took 6283.76ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 111.2MB in the beginning and 65.0MB in the end (delta: 46.2MB). Peak memory consumption was 78.1MB. Max. memory is 16.1GB. [2025-03-03 13:29:02,315 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:29:02,316 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.19ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 99.0MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:29:02,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.60ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.5MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:29:02,317 INFO L158 Benchmark]: Boogie Preprocessor took 37.64ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 95.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:29:02,317 INFO L158 Benchmark]: IcfgBuilder took 287.80ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 79.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 13:29:02,317 INFO L158 Benchmark]: TraceAbstraction took 5698.31ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 78.7MB in the beginning and 65.1MB in the end (delta: 13.7MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2025-03-03 13:29:02,317 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 176.2MB. Free memory was 65.1MB in the beginning and 65.0MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:29:02,318 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.19ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 99.0MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.60ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.5MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.64ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 95.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 287.80ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 79.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5698.31ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 78.7MB in the beginning and 65.1MB in the end (delta: 13.7MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 176.2MB. Free memory was 65.1MB in the beginning and 65.0MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 16]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of strncpy at line 42. Possible FailurePath: [L86] char A [2 + 2 + 4 +1]; [L87] int i = 0; VAL [A={10:0}, i=0] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=1] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=2] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=3] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=4] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=5] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=6] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=7] [L87] COND FALSE !(i<2 + 2 + 4 -1) [L90] A[2 + 2 + 4] = 0 [L91] CALL parse_expression_list (A) [L60] int start=0, i=-1, j=-1; [L61] char str2[2]; VAL [i=-1, start=0, str2={7:0}, str={10:0}] [L62] COND FALSE !(!str) VAL [i=-1, start=0, str2={7:0}, str={10:0}] [L81] COND TRUE str[i] != 0 [L64] i++ [L65] str[i] [L66] case 0: VAL [i=0, start=0, str2={7:0}, str={10:0}] [L66] case 0: [L81] EXPR str[i] [L81] COND TRUE str[i] != 0 [L81] COND TRUE str[i] != 0 [L64] i++ [L65] str[i] [L66] case 0: VAL [i=1, start=0, str2={7:0}, str={10:0}] [L66] case 0: [L81] EXPR str[i] [L81] COND TRUE str[i] != 0 [L81] COND TRUE str[i] != 0 [L64] i++ [L65] str[i] [L66] case 0: VAL [i=2, start=0, str2={7:0}, str={10:0}] [L66] case 0: [L67] COND TRUE (str[start] == ' ') || (str[start] == '\t') [L67] EXPR str[start] [L67] (str[start] == ' ') || (str[start] == '\t') VAL [i=2, start=0, str2={7:0}, str={10:0}] [L67] (str[start] == ' ') || (str[start] == '\t') [L67] EXPR str[start] [L67] (str[start] == ' ') || (str[start] == '\t') VAL [i=2, start=0, str2={7:0}, str={10:0}] [L67] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) [L68] str[start] [L66] case 0: [L69] j = i-1 VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L70] COND TRUE (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) [L70] EXPR str[j] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') [L70] EXPR str[j] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L70] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) [L71] (0 < j) && (str[j] == '"') VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L66] case 0: [L71] EXPR str[j] [L71] (0 < j) && (str[j] == '"') VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L66] case 0: [L66] case 0: [L73] CALL r_strncpy(str2, str+start, j-start+1) [L42] return strncpy(dest,src,n); [L73] RET r_strncpy(str2, str+start, j-start+1) [L74] CALL __VERIFIER_assert(j - start + 1 < 2) [L15] COND TRUE !(cond) [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 12, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1040 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1040 mSDsluCounter, 2085 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1681 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1622 IncrementalHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 404 mSDtfsCounter, 1622 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 455 GetRequests, 320 SyntacticMatches, 12 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=11, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 266 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 547 NumberOfCodeBlocks, 536 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 650 ConstructedInterpolants, 0 QuantifiedInterpolants, 1875 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1071 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 331/419 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 13:29:02,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 c1599706a72281425c0fc51552af364ca390697b315c5af0e88e5d6de4e668c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:29:04,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:29:04,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 13:29:04,271 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:29:04,272 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:29:04,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:29:04,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:29:04,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:29:04,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:29:04,300 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:29:04,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:29:04,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:29:04,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:29:04,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:29:04,301 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:29:04,301 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:29:04,301 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:29:04,301 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:29:04,301 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:29:04,301 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:29:04,301 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:29:04,301 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:29:04,301 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:29:04,301 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 13:29:04,302 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 13:29:04,302 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 13:29:04,302 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:29:04,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:29:04,302 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:29:04,302 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:29:04,302 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:29:04,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:29:04,302 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:29:04,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:29:04,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:29:04,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:29:04,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:29:04,302 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:29:04,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:29:04,302 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 13:29:04,302 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 13:29:04,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:29:04,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:29:04,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:29:04,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:29:04,302 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 -> c1599706a72281425c0fc51552af364ca390697b315c5af0e88e5d6de4e668c6 [2025-03-03 13:29:04,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:29:04,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:29:04,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:29:04,538 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:29:04,538 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:29:04,539 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2025-03-03 13:29:05,716 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b92422093/300e4a3d31b54f2e8e359a147734c00d/FLAGc6b1859fd [2025-03-03 13:29:05,920 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:29:05,921 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2025-03-03 13:29:05,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b92422093/300e4a3d31b54f2e8e359a147734c00d/FLAGc6b1859fd [2025-03-03 13:29:06,288 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b92422093/300e4a3d31b54f2e8e359a147734c00d [2025-03-03 13:29:06,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:29:06,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:29:06,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:29:06,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:29:06,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:29:06,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:29:06" (1/1) ... [2025-03-03 13:29:06,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66bbab53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:29:06, skipping insertion in model container [2025-03-03 13:29:06,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:29:06" (1/1) ... [2025-03-03 13:29:06,306 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:29:06,401 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/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i[882,895] [2025-03-03 13:29:06,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:29:06,433 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:29:06,440 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/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i[882,895] [2025-03-03 13:29:06,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:29:06,469 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:29:06,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:29:06 WrapperNode [2025-03-03 13:29:06,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:29:06,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:29:06,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:29:06,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:29:06,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:29:06" (1/1) ... [2025-03-03 13:29:06,483 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:29:06" (1/1) ... [2025-03-03 13:29:06,501 INFO L138 Inliner]: procedures = 42, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2025-03-03 13:29:06,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:29:06,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:29:06,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:29:06,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:29:06,510 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:29:06" (1/1) ... [2025-03-03 13:29:06,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:29:06" (1/1) ... [2025-03-03 13:29:06,512 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:29:06" (1/1) ... [2025-03-03 13:29:06,523 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 10, 1]. 77 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2025-03-03 13:29:06,523 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:29:06" (1/1) ... [2025-03-03 13:29:06,523 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:29:06" (1/1) ... [2025-03-03 13:29:06,527 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:29:06" (1/1) ... [2025-03-03 13:29:06,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:29:06" (1/1) ... [2025-03-03 13:29:06,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:29:06" (1/1) ... [2025-03-03 13:29:06,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:29:06" (1/1) ... [2025-03-03 13:29:06,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:29:06,534 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:29:06,534 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:29:06,534 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:29:06,534 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:29:06" (1/1) ... [2025-03-03 13:29:06,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:29:06,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:29:06,560 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-03 13:29:06,562 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-03 13:29:06,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:29:06,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-03 13:29:06,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-03 13:29:06,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-03 13:29:06,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 13:29:06,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-03 13:29:06,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-03 13:29:06,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 13:29:06,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:29:06,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:29:06,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-03 13:29:06,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-03 13:29:06,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-03 13:29:06,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 13:29:06,638 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:29:06,639 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:29:06,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L42: havoc r_strncpy_#t~nondet1#1.base, r_strncpy_#t~nondet1#1.offset; [2025-03-03 13:29:06,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L61: call ULTIMATE.dealloc(parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset);havoc parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset; [2025-03-03 13:29:06,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L86: call ULTIMATE.dealloc(main_~#A~0#1.base, main_~#A~0#1.offset);havoc main_~#A~0#1.base, main_~#A~0#1.offset; [2025-03-03 13:29:06,847 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-03-03 13:29:06,847 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:29:06,853 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:29:06,853 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:29:06,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:29:06 BoogieIcfgContainer [2025-03-03 13:29:06,853 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:29:06,856 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:29:06,856 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:29:06,859 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:29:06,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:29:06" (1/3) ... [2025-03-03 13:29:06,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2402783d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:29:06, skipping insertion in model container [2025-03-03 13:29:06,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:29:06" (2/3) ... [2025-03-03 13:29:06,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2402783d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:29:06, skipping insertion in model container [2025-03-03 13:29:06,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:29:06" (3/3) ... [2025-03-03 13:29:06,861 INFO L128 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2025-03-03 13:29:06,870 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:29:06,871 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i that has 1 procedures, 33 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-03 13:29:06,904 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:29:06,911 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;@6890ae54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:29:06,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:29:06,914 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 32 states have internal predecessors, (49), 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-03 13:29:06,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 13:29:06,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:29:06,920 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:29:06,920 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:29:06,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:29:06,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1330944189, now seen corresponding path program 1 times [2025-03-03 13:29:06,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 13:29:06,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [835126838] [2025-03-03 13:29:06,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:29:06,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:06,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:29:06,933 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-03 13:29:06,934 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-03 13:29:07,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:29:07,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:29:07,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:29:07,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:29:07,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 13:29:07,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:29:07,045 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-03 13:29:07,046 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:29:07,046 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 13:29:07,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835126838] [2025-03-03 13:29:07,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835126838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:29:07,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:29:07,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 13:29:07,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439538957] [2025-03-03 13:29:07,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:29:07,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 13:29:07,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 13:29:07,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 13:29:07,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:29:07,065 INFO L87 Difference]: Start difference. First operand has 33 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 32 states have internal predecessors, (49), 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) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-03 13:29:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:29:07,074 INFO L93 Difference]: Finished difference Result 62 states and 92 transitions. [2025-03-03 13:29:07,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 13:29:07,076 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 18 [2025-03-03 13:29:07,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:29:07,079 INFO L225 Difference]: With dead ends: 62 [2025-03-03 13:29:07,080 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 13:29:07,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:29:07,083 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:29:07,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:29:07,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 13:29:07,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-03 13:29:07,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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-03 13:29:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2025-03-03 13:29:07,102 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 18 [2025-03-03 13:29:07,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:29:07,102 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2025-03-03 13:29:07,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-03 13:29:07,102 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2025-03-03 13:29:07,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 13:29:07,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:29:07,103 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] [2025-03-03 13:29:07,135 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-03 13:29:07,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:07,304 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:29:07,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:29:07,304 INFO L85 PathProgramCache]: Analyzing trace with hash -69669011, now seen corresponding path program 1 times [2025-03-03 13:29:07,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 13:29:07,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1618927031] [2025-03-03 13:29:07,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:29:07,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:07,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:29:07,307 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-03 13:29:07,308 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-03 13:29:07,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 13:29:07,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 13:29:07,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:29:07,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:29:07,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 13:29:07,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:29:07,465 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-03 13:29:07,466 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:29:07,466 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 13:29:07,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618927031] [2025-03-03 13:29:07,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618927031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:29:07,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:29:07,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:29:07,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092820929] [2025-03-03 13:29:07,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:29:07,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:29:07,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 13:29:07,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:29:07,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:29:07,468 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-03 13:29:07,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:29:07,553 INFO L93 Difference]: Finished difference Result 63 states and 86 transitions. [2025-03-03 13:29:07,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:29:07,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2025-03-03 13:29:07,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:29:07,555 INFO L225 Difference]: With dead ends: 63 [2025-03-03 13:29:07,555 INFO L226 Difference]: Without dead ends: 39 [2025-03-03 13:29:07,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:29:07,556 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:29:07,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 102 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:29:07,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-03 13:29:07,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2025-03-03 13:29:07,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 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-03 13:29:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2025-03-03 13:29:07,560 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 22 [2025-03-03 13:29:07,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:29:07,560 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-03-03 13:29:07,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-03 13:29:07,560 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2025-03-03 13:29:07,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 13:29:07,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:29:07,561 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] [2025-03-03 13:29:07,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 13:29:07,761 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 [2025-03-03 13:29:07,761 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:29:07,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:29:07,762 INFO L85 PathProgramCache]: Analyzing trace with hash -40116339, now seen corresponding path program 1 times [2025-03-03 13:29:07,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 13:29:07,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1694063985] [2025-03-03 13:29:07,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:29:07,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:07,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:29:07,764 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:29:07,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 13:29:07,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 13:29:07,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 13:29:07,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:29:07,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:29:07,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 13:29:07,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:29:07,844 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-03 13:29:07,844 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:29:07,845 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 13:29:07,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694063985] [2025-03-03 13:29:07,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694063985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:29:07,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:29:07,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:29:07,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21725262] [2025-03-03 13:29:07,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:29:07,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:29:07,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 13:29:07,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:29:07,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:29:07,846 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-03 13:29:07,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:29:07,854 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2025-03-03 13:29:07,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:29:07,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2025-03-03 13:29:07,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:29:07,856 INFO L225 Difference]: With dead ends: 62 [2025-03-03 13:29:07,856 INFO L226 Difference]: Without dead ends: 33 [2025-03-03 13:29:07,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-03 13:29:07,857 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:29:07,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:29:07,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-03 13:29:07,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-03 13:29:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 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-03 13:29:07,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2025-03-03 13:29:07,862 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 22 [2025-03-03 13:29:07,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:29:07,863 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2025-03-03 13:29:07,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-03 13:29:07,863 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2025-03-03 13:29:07,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 13:29:07,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:29:07,863 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] [2025-03-03 13:29:07,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 13:29:08,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:08,064 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:29:08,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:29:08,064 INFO L85 PathProgramCache]: Analyzing trace with hash 340804297, now seen corresponding path program 1 times [2025-03-03 13:29:08,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 13:29:08,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [509805653] [2025-03-03 13:29:08,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:29:08,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:08,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:29:08,067 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:29:08,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 13:29:08,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 13:29:08,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:29:08,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:29:08,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:29:08,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 13:29:08,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:29:08,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:29:08,257 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:29:08,257 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 13:29:08,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509805653] [2025-03-03 13:29:08,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509805653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:29:08,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:29:08,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:29:08,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247441449] [2025-03-03 13:29:08,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:29:08,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:29:08,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 13:29:08,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:29:08,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:29:08,258 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-03 13:29:08,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:29:08,407 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2025-03-03 13:29:08,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:29:08,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 23 [2025-03-03 13:29:08,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:29:08,409 INFO L225 Difference]: With dead ends: 130 [2025-03-03 13:29:08,409 INFO L226 Difference]: Without dead ends: 97 [2025-03-03 13:29:08,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:29:08,410 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 69 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:29:08,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 156 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:29:08,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-03 13:29:08,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 54. [2025-03-03 13:29:08,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 53 states have internal predecessors, (73), 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-03 13:29:08,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2025-03-03 13:29:08,418 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 23 [2025-03-03 13:29:08,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:29:08,418 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2025-03-03 13:29:08,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-03 13:29:08,418 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2025-03-03 13:29:08,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 13:29:08,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:29:08,418 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] [2025-03-03 13:29:08,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 13:29:08,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:08,623 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:29:08,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:29:08,623 INFO L85 PathProgramCache]: Analyzing trace with hash 469887016, now seen corresponding path program 1 times [2025-03-03 13:29:08,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 13:29:08,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [789078410] [2025-03-03 13:29:08,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:29:08,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:08,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:29:08,625 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:29:08,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 13:29:08,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 13:29:08,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:29:08,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:29:08,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:29:08,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 13:29:08,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:29:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:29:08,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:29:08,787 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 13:29:08,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789078410] [2025-03-03 13:29:08,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789078410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:29:08,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:29:08,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:29:08,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506864300] [2025-03-03 13:29:08,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:29:08,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:29:08,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 13:29:08,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:29:08,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:29:08,790 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-03 13:29:08,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:29:08,880 INFO L93 Difference]: Finished difference Result 117 states and 155 transitions. [2025-03-03 13:29:08,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:29:08,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2025-03-03 13:29:08,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:29:08,881 INFO L225 Difference]: With dead ends: 117 [2025-03-03 13:29:08,881 INFO L226 Difference]: Without dead ends: 84 [2025-03-03 13:29:08,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:29:08,882 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 41 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:29:08,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 118 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:29:08,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-03 13:29:08,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 54. [2025-03-03 13:29:08,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 53 states have internal predecessors, (73), 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-03 13:29:08,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2025-03-03 13:29:08,887 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 23 [2025-03-03 13:29:08,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:29:08,887 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2025-03-03 13:29:08,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-03 13:29:08,887 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2025-03-03 13:29:08,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 13:29:08,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:29:08,888 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] [2025-03-03 13:29:08,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 13:29:09,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:09,088 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:29:09,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:29:09,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1217269593, now seen corresponding path program 1 times [2025-03-03 13:29:09,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 13:29:09,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1350324744] [2025-03-03 13:29:09,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:29:09,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:09,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:29:09,091 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:29:09,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 13:29:09,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 13:29:09,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:29:09,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:29:09,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:29:09,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 13:29:09,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:29:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:29:09,184 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:29:09,184 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 13:29:09,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350324744] [2025-03-03 13:29:09,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350324744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:29:09,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:29:09,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:29:09,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503176173] [2025-03-03 13:29:09,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:29:09,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:29:09,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 13:29:09,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:29:09,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:29:09,185 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-03 13:29:09,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:29:09,259 INFO L93 Difference]: Finished difference Result 103 states and 135 transitions. [2025-03-03 13:29:09,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:29:09,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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 25 [2025-03-03 13:29:09,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:29:09,260 INFO L225 Difference]: With dead ends: 103 [2025-03-03 13:29:09,260 INFO L226 Difference]: Without dead ends: 64 [2025-03-03 13:29:09,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:29:09,260 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 31 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:29:09,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 134 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:29:09,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-03 13:29:09,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 51. [2025-03-03 13:29:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 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-03 13:29:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2025-03-03 13:29:09,267 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 25 [2025-03-03 13:29:09,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:29:09,267 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2025-03-03 13:29:09,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-03 13:29:09,267 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2025-03-03 13:29:09,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 13:29:09,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:29:09,268 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:29:09,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 13:29:09,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:09,468 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:29:09,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:29:09,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1528204888, now seen corresponding path program 1 times [2025-03-03 13:29:09,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 13:29:09,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1702345140] [2025-03-03 13:29:09,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:29:09,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:09,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:29:09,471 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:29:09,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 13:29:09,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 13:29:09,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:29:09,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:29:09,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:29:09,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 13:29:09,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:29:09,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:29:09,642 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:29:09,642 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 13:29:09,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702345140] [2025-03-03 13:29:09,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702345140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:29:09,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:29:09,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 13:29:09,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485470991] [2025-03-03 13:29:09,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:29:09,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 13:29:09,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 13:29:09,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 13:29:09,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:29:09,643 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-03 13:29:09,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:29:09,729 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2025-03-03 13:29:09,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:29:09,729 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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 26 [2025-03-03 13:29:09,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:29:09,731 INFO L225 Difference]: With dead ends: 80 [2025-03-03 13:29:09,731 INFO L226 Difference]: Without dead ends: 35 [2025-03-03 13:29:09,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:29:09,732 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:29:09,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 146 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:29:09,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-03 13:29:09,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-03 13:29:09,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 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-03 13:29:09,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2025-03-03 13:29:09,734 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 26 [2025-03-03 13:29:09,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:29:09,734 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2025-03-03 13:29:09,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-03 13:29:09,735 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2025-03-03 13:29:09,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 13:29:09,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:29:09,735 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:29:09,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 13:29:09,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:09,936 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:29:09,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:29:09,936 INFO L85 PathProgramCache]: Analyzing trace with hash 101581862, now seen corresponding path program 1 times [2025-03-03 13:29:09,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 13:29:09,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [200331300] [2025-03-03 13:29:09,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:29:09,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:09,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:29:09,938 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:29:09,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 13:29:09,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 13:29:09,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 13:29:09,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:29:09,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:29:09,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 13:29:09,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:29:10,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:29:10,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:29:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:29:10,339 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 13:29:10,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200331300] [2025-03-03 13:29:10,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200331300] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:29:10,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:29:10,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2025-03-03 13:29:10,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631754115] [2025-03-03 13:29:10,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:29:10,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 13:29:10,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 13:29:10,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 13:29:10,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-03 13:29:10,340 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 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-03 13:29:11,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:29:11,510 INFO L93 Difference]: Finished difference Result 294 states and 386 transitions. [2025-03-03 13:29:11,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 13:29:11,510 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 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 27 [2025-03-03 13:29:11,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:29:11,511 INFO L225 Difference]: With dead ends: 294 [2025-03-03 13:29:11,511 INFO L226 Difference]: Without dead ends: 248 [2025-03-03 13:29:11,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=220, Invalid=482, Unknown=0, NotChecked=0, Total=702 [2025-03-03 13:29:11,512 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 480 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 13:29:11,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 423 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 13:29:11,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-03 13:29:11,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 79. [2025-03-03 13:29:11,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.358974358974359) internal successors, (106), 78 states have internal predecessors, (106), 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-03 13:29:11,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 106 transitions. [2025-03-03 13:29:11,519 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 106 transitions. Word has length 27 [2025-03-03 13:29:11,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:29:11,519 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 106 transitions. [2025-03-03 13:29:11,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 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-03 13:29:11,519 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 106 transitions. [2025-03-03 13:29:11,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 13:29:11,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:29:11,520 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:29:11,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 13:29:11,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:11,721 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:29:11,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:29:11,721 INFO L85 PathProgramCache]: Analyzing trace with hash 230664581, now seen corresponding path program 1 times [2025-03-03 13:29:11,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 13:29:11,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [465045574] [2025-03-03 13:29:11,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:29:11,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:11,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:29:11,723 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:29:11,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 13:29:11,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 13:29:11,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 13:29:11,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:29:11,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:29:11,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 13:29:11,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:29:11,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:29:11,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:29:12,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:29:12,254 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 13:29:12,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465045574] [2025-03-03 13:29:12,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465045574] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:29:12,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:29:12,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2025-03-03 13:29:12,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797039497] [2025-03-03 13:29:12,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:29:12,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 13:29:12,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 13:29:12,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 13:29:12,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-03 13:29:12,256 INFO L87 Difference]: Start difference. First operand 79 states and 106 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 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-03 13:29:14,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:29:14,037 INFO L93 Difference]: Finished difference Result 303 states and 398 transitions. [2025-03-03 13:29:14,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 13:29:14,038 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 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 27 [2025-03-03 13:29:14,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:29:14,039 INFO L225 Difference]: With dead ends: 303 [2025-03-03 13:29:14,039 INFO L226 Difference]: Without dead ends: 254 [2025-03-03 13:29:14,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 13:29:14,040 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 381 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 13:29:14,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 350 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 13:29:14,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-03 13:29:14,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 92. [2025-03-03 13:29:14,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 91 states have internal predecessors, (120), 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-03 13:29:14,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 120 transitions. [2025-03-03 13:29:14,051 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 120 transitions. Word has length 27 [2025-03-03 13:29:14,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:29:14,051 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 120 transitions. [2025-03-03 13:29:14,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 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-03 13:29:14,051 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2025-03-03 13:29:14,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 13:29:14,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:29:14,052 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] [2025-03-03 13:29:14,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 13:29:14,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:14,252 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:29:14,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:29:14,253 INFO L85 PathProgramCache]: Analyzing trace with hash 417363081, now seen corresponding path program 1 times [2025-03-03 13:29:14,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 13:29:14,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1197089288] [2025-03-03 13:29:14,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:29:14,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:14,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:29:14,255 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:29:14,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 13:29:14,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 13:29:14,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 13:29:14,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:29:14,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:29:14,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 13:29:14,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:29:14,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:29:14,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:29:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:29:14,412 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 13:29:14,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197089288] [2025-03-03 13:29:14,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197089288] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:29:14,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:29:14,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2025-03-03 13:29:14,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504860434] [2025-03-03 13:29:14,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:29:14,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 13:29:14,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 13:29:14,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 13:29:14,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-03 13:29:14,413 INFO L87 Difference]: Start difference. First operand 92 states and 120 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 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-03 13:29:14,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:29:14,503 INFO L93 Difference]: Finished difference Result 192 states and 248 transitions. [2025-03-03 13:29:14,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:29:14,504 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 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 32 [2025-03-03 13:29:14,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:29:14,505 INFO L225 Difference]: With dead ends: 192 [2025-03-03 13:29:14,505 INFO L226 Difference]: Without dead ends: 126 [2025-03-03 13:29:14,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:29:14,505 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 41 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:29:14,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 239 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:29:14,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-03 13:29:14,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 106. [2025-03-03 13:29:14,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.3238095238095238) internal successors, (139), 105 states have internal predecessors, (139), 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-03 13:29:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 139 transitions. [2025-03-03 13:29:14,511 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 139 transitions. Word has length 32 [2025-03-03 13:29:14,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:29:14,511 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 139 transitions. [2025-03-03 13:29:14,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 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-03 13:29:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 139 transitions. [2025-03-03 13:29:14,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 13:29:14,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:29:14,512 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:29:14,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 13:29:14,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:14,713 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:29:14,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:29:14,713 INFO L85 PathProgramCache]: Analyzing trace with hash -351185311, now seen corresponding path program 1 times [2025-03-03 13:29:14,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 13:29:14,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [927088057] [2025-03-03 13:29:14,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:29:14,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:14,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:29:14,715 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:29:14,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 13:29:14,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 13:29:14,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 13:29:14,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:29:14,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:29:14,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 13:29:14,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:29:14,791 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 13:29:14,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:29:14,805 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 13:29:14,805 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 13:29:14,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927088057] [2025-03-03 13:29:14,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927088057] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:29:14,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:29:14,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-03-03 13:29:14,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925196418] [2025-03-03 13:29:14,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:29:14,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:29:14,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 13:29:14,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:29:14,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:29:14,806 INFO L87 Difference]: Start difference. First operand 106 states and 139 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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-03 13:29:14,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:29:14,826 INFO L93 Difference]: Finished difference Result 211 states and 279 transitions. [2025-03-03 13:29:14,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:29:14,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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 33 [2025-03-03 13:29:14,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:29:14,828 INFO L225 Difference]: With dead ends: 211 [2025-03-03 13:29:14,828 INFO L226 Difference]: Without dead ends: 109 [2025-03-03 13:29:14,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:29:14,828 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:29:14,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:29:14,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-03 13:29:14,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-03 13:29:14,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.3148148148148149) internal successors, (142), 108 states have internal predecessors, (142), 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-03 13:29:14,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 142 transitions. [2025-03-03 13:29:14,833 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 142 transitions. Word has length 33 [2025-03-03 13:29:14,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:29:14,834 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 142 transitions. [2025-03-03 13:29:14,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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-03 13:29:14,834 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 142 transitions. [2025-03-03 13:29:14,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 13:29:14,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:29:14,834 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:29:14,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-03 13:29:15,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:15,035 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:29:15,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:29:15,035 INFO L85 PathProgramCache]: Analyzing trace with hash 975240485, now seen corresponding path program 2 times [2025-03-03 13:29:15,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 13:29:15,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1044703992] [2025-03-03 13:29:15,036 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:29:15,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:15,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:29:15,037 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:29:15,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 13:29:15,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-03 13:29:15,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:29:15,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:29:15,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:29:15,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 13:29:15,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:29:15,226 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 13:29:15,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:29:15,387 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 13:29:15,387 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 13:29:15,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044703992] [2025-03-03 13:29:15,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044703992] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:29:15,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:29:15,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2025-03-03 13:29:15,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897366821] [2025-03-03 13:29:15,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:29:15,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 13:29:15,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 13:29:15,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 13:29:15,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-03 13:29:15,388 INFO L87 Difference]: Start difference. First operand 109 states and 142 transitions. Second operand has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 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-03 13:29:16,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:29:16,496 INFO L93 Difference]: Finished difference Result 505 states and 660 transitions. [2025-03-03 13:29:16,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 13:29:16,497 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 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 36 [2025-03-03 13:29:16,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:29:16,501 INFO L225 Difference]: With dead ends: 505 [2025-03-03 13:29:16,502 INFO L226 Difference]: Without dead ends: 397 [2025-03-03 13:29:16,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2025-03-03 13:29:16,502 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 671 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 13:29:16,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 673 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 13:29:16,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-03 13:29:16,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 236. [2025-03-03 13:29:16,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.3361702127659574) internal successors, (314), 235 states have internal predecessors, (314), 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-03 13:29:16,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 314 transitions. [2025-03-03 13:29:16,513 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 314 transitions. Word has length 36 [2025-03-03 13:29:16,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:29:16,513 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 314 transitions. [2025-03-03 13:29:16,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 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-03 13:29:16,513 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 314 transitions. [2025-03-03 13:29:16,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 13:29:16,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:29:16,514 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:29:16,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 13:29:16,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:16,718 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:29:16,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:29:16,718 INFO L85 PathProgramCache]: Analyzing trace with hash 976164006, now seen corresponding path program 1 times [2025-03-03 13:29:16,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 13:29:16,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [723070607] [2025-03-03 13:29:16,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:29:16,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:16,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:29:16,721 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:29:16,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 13:29:16,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 13:29:16,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:29:16,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:29:16,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:29:16,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 13:29:16,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:29:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 13:29:16,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:29:17,118 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 13:29:17,119 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 13:29:17,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723070607] [2025-03-03 13:29:17,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723070607] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:29:17,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:29:17,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2025-03-03 13:29:17,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66118868] [2025-03-03 13:29:17,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:29:17,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 13:29:17,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 13:29:17,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 13:29:17,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-03 13:29:17,120 INFO L87 Difference]: Start difference. First operand 236 states and 314 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 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-03 13:29:18,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:29:18,945 INFO L93 Difference]: Finished difference Result 651 states and 863 transitions. [2025-03-03 13:29:18,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-03 13:29:18,946 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 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 36 [2025-03-03 13:29:18,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:29:18,948 INFO L225 Difference]: With dead ends: 651 [2025-03-03 13:29:18,948 INFO L226 Difference]: Without dead ends: 649 [2025-03-03 13:29:18,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=252, Invalid=1008, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 13:29:18,949 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 689 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:29:18,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 885 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 13:29:18,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-03-03 13:29:18,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 277. [2025-03-03 13:29:18,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.355072463768116) internal successors, (374), 276 states have internal predecessors, (374), 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-03 13:29:18,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 374 transitions. [2025-03-03 13:29:18,961 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 374 transitions. Word has length 36 [2025-03-03 13:29:18,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:29:18,961 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 374 transitions. [2025-03-03 13:29:18,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 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-03 13:29:18,961 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 374 transitions. [2025-03-03 13:29:18,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 13:29:18,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:29:18,962 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:29:18,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-03 13:29:19,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:19,162 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:29:19,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:29:19,163 INFO L85 PathProgramCache]: Analyzing trace with hash 469681860, now seen corresponding path program 1 times [2025-03-03 13:29:19,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 13:29:19,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2102074079] [2025-03-03 13:29:19,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:29:19,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:19,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:29:19,165 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:29:19,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 13:29:19,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 13:29:19,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:29:19,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:29:19,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:29:19,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 13:29:19,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:29:19,359 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 13:29:19,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:29:19,538 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 13:29:19,538 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 13:29:19,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102074079] [2025-03-03 13:29:19,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102074079] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:29:19,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:29:19,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2025-03-03 13:29:19,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56949211] [2025-03-03 13:29:19,538 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:29:19,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 13:29:19,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 13:29:19,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 13:29:19,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-03-03 13:29:19,539 INFO L87 Difference]: Start difference. First operand 277 states and 374 transitions. Second operand has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 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-03 13:29:22,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:29:22,587 INFO L93 Difference]: Finished difference Result 788 states and 1045 transitions. [2025-03-03 13:29:22,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-03 13:29:22,587 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 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 36 [2025-03-03 13:29:22,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:29:22,589 INFO L225 Difference]: With dead ends: 788 [2025-03-03 13:29:22,589 INFO L226 Difference]: Without dead ends: 786 [2025-03-03 13:29:22,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=380, Invalid=1782, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 13:29:22,590 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 617 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:29:22,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 1108 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 13:29:22,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2025-03-03 13:29:22,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 322. [2025-03-03 13:29:22,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 321 states have (on average 1.3894080996884735) internal successors, (446), 321 states have internal predecessors, (446), 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-03 13:29:22,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 446 transitions. [2025-03-03 13:29:22,606 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 446 transitions. Word has length 36 [2025-03-03 13:29:22,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:29:22,606 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 446 transitions. [2025-03-03 13:29:22,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 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-03 13:29:22,606 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 446 transitions. [2025-03-03 13:29:22,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 13:29:22,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:29:22,607 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:29:22,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-03 13:29:22,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:22,807 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:29:22,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:29:22,808 INFO L85 PathProgramCache]: Analyzing trace with hash 470605381, now seen corresponding path program 1 times [2025-03-03 13:29:22,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 13:29:22,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2066507018] [2025-03-03 13:29:22,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:29:22,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:22,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:29:22,810 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:29:22,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 13:29:22,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 13:29:22,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:29:22,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:29:22,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:29:22,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 13:29:22,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:29:22,895 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 13:29:22,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:29:22,932 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 13:29:22,932 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 13:29:22,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066507018] [2025-03-03 13:29:22,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066507018] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:29:22,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:29:22,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-03 13:29:22,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776053182] [2025-03-03 13:29:22,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:29:22,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 13:29:22,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 13:29:22,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 13:29:22,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:29:22,933 INFO L87 Difference]: Start difference. First operand 322 states and 446 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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-03 13:29:22,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:29:22,974 INFO L93 Difference]: Finished difference Result 640 states and 890 transitions. [2025-03-03 13:29:22,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 13:29:22,975 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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 36 [2025-03-03 13:29:22,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:29:22,976 INFO L225 Difference]: With dead ends: 640 [2025-03-03 13:29:22,976 INFO L226 Difference]: Without dead ends: 325 [2025-03-03 13:29:22,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:29:22,977 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:29:22,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:29:22,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-03 13:29:22,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2025-03-03 13:29:22,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.3858024691358024) internal successors, (449), 324 states have internal predecessors, (449), 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-03 13:29:22,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 449 transitions. [2025-03-03 13:29:22,999 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 449 transitions. Word has length 36 [2025-03-03 13:29:22,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:29:23,000 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 449 transitions. [2025-03-03 13:29:23,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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-03 13:29:23,000 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 449 transitions. [2025-03-03 13:29:23,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 13:29:23,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:29:23,000 INFO L218 NwaCegarLoop]: trace histogram [7, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:29:23,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-03 13:29:23,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:23,201 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:29:23,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:29:23,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1972596479, now seen corresponding path program 2 times [2025-03-03 13:29:23,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 13:29:23,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1469317827] [2025-03-03 13:29:23,201 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:29:23,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:23,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:29:23,203 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:29:23,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 13:29:23,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-03 13:29:23,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:29:23,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:29:23,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 13:29:23,431 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 13:29:23,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 13:29:23,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:29:23,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:29:23,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 13:29:23,677 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-03 13:29:23,677 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 13:29:23,677 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 13:29:23,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-03 13:29:23,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:29:23,881 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:29:23,901 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 13:29:23,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 01:29:23 BoogieIcfgContainer [2025-03-03 13:29:23,903 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 13:29:23,903 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 13:29:23,903 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 13:29:23,903 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 13:29:23,904 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:29:06" (3/4) ... [2025-03-03 13:29:23,905 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 13:29:23,905 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 13:29:23,906 INFO L158 Benchmark]: Toolchain (without parser) took 17615.48ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 62.7MB in the end (delta: 29.3MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2025-03-03 13:29:23,906 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory was 62.0MB in the beginning and 62.0MB in the end (delta: 37.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:29:23,906 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.79ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 79.3MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:29:23,906 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.41ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 77.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:29:23,907 INFO L158 Benchmark]: Boogie Preprocessor took 29.93ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 75.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:29:23,907 INFO L158 Benchmark]: IcfgBuilder took 319.57ms. Allocated memory is still 117.4MB. Free memory was 75.7MB in the beginning and 58.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 13:29:23,907 INFO L158 Benchmark]: TraceAbstraction took 17047.28ms. Allocated memory is still 117.4MB. Free memory was 57.6MB in the beginning and 62.7MB in the end (delta: -5.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:29:23,907 INFO L158 Benchmark]: Witness Printer took 2.28ms. Allocated memory is still 117.4MB. Free memory is still 62.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:29:23,908 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory was 62.0MB in the beginning and 62.0MB in the end (delta: 37.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.79ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 79.3MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.41ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 77.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.93ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 75.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 319.57ms. Allocated memory is still 117.4MB. Free memory was 75.7MB in the beginning and 58.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17047.28ms. Allocated memory is still 117.4MB. Free memory was 57.6MB in the beginning and 62.7MB in the end (delta: -5.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.28ms. Allocated memory is still 117.4MB. Free memory is still 62.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 16]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of strncpy at line 42. Possible FailurePath: [L86] char A [2 + 2 + 4 +1]; [L87] int i = 0; VAL [A={268435459:0}, i=0] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={268435459:0}, i=1] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={268435459:0}, i=2] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={268435459:0}, i=3] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={268435459:0}, i=4] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={268435459:0}, i=5] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={268435459:0}, i=6] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={268435459:0}, i=7] [L87] COND FALSE !(i<2 + 2 + 4 -1) [L90] A[2 + 2 + 4] = 0 [L91] CALL parse_expression_list (A) [L60] int start=0, i=-1, j=-1; [L61] char str2[2]; VAL [i=-1, start=0, str2={4:0}, str={268435459:0}] [L62] COND FALSE !(!str) VAL [i=-1, start=0, str2={4:0}, str={268435459:0}] [L81] COND TRUE str[i] != 0 [L64] i++ [L65] str[i] [L66] case 0: VAL [i=0, start=0, str2={4:0}, str={268435459:0}] [L66] case 0: [L81] EXPR str[i] [L81] COND TRUE str[i] != 0 [L81] COND TRUE str[i] != 0 [L64] i++ [L65] str[i] [L66] case 0: VAL [i=1, start=0, str2={4:0}, str={268435459:0}] [L66] case 0: [L81] EXPR str[i] [L81] COND TRUE str[i] != 0 [L81] COND TRUE str[i] != 0 [L64] i++ [L65] str[i] [L66] case 0: VAL [i=2, start=0, str2={4:0}, str={268435459:0}] [L66] case 0: [L67] COND TRUE (str[start] == ' ') || (str[start] == '\t') [L67] EXPR str[start] [L67] (str[start] == ' ') || (str[start] == '\t') VAL [i=2, start=0, str2={4:0}, str={268435459:0}] [L67] (str[start] == ' ') || (str[start] == '\t') [L67] EXPR str[start] [L67] (str[start] == ' ') || (str[start] == '\t') VAL [i=2, start=0, str2={4:0}, str={268435459:0}] [L67] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) [L68] str[start] [L66] case 0: [L69] j = i-1 VAL [i=2, j=1, start=0, str2={4:0}, str={268435459:0}] [L70] COND TRUE (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [i=2, j=1, start=0, str2={4:0}, str={268435459:0}] [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) [L70] EXPR str[j] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [i=2, j=1, start=0, str2={4:0}, str={268435459:0}] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') [L70] EXPR str[j] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [i=2, j=1, start=0, str2={4:0}, str={268435459:0}] [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [i=2, j=1, start=0, str2={4:0}, str={268435459:0}] [L70] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) [L71] (0 < j) && (str[j] == '"') VAL [i=2, j=1, start=0, str2={4:0}, str={268435459:0}] [L66] case 0: [L71] EXPR str[j] [L71] (0 < j) && (str[j] == '"') VAL [i=2, j=1, start=0, str2={4:0}, str={268435459:0}] [L66] case 0: [L66] case 0: [L73] CALL r_strncpy(str2, str+start, j-start+1) [L42] return strncpy(dest,src,n); [L73] RET r_strncpy(str2, str+start, j-start+1) [L74] CALL __VERIFIER_assert(j - start + 1 < 2) [L15] COND TRUE !(cond) [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.0s, OverallIterations: 16, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3031 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3031 mSDsluCounter, 4945 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4238 mSDsCounter, 229 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4017 IncrementalHoareTripleChecker+Invalid, 4246 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 229 mSolverCounterUnsat, 707 mSDtfsCounter, 4017 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 768 GetRequests, 550 SyntacticMatches, 1 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=15, InterpolantAutomatonStates: 201, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 1441 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 461 NumberOfCodeBlocks, 461 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 662 ConstructedInterpolants, 0 QuantifiedInterpolants, 2885 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1398 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 23 InterpolantComputations, 7 PerfectInterpolantSequences, 111/193 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 13:29:23,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample