./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c --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/bitvector/soft_float_1-3a.c.cil.c -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 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:44:08,183 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:44:08,220 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:44:08,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:44:08,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:44:08,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:44:08,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:44:08,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:44:08,253 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:44:08,253 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:44:08,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:44:08,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:44:08,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:44:08,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:44:08,253 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:44:08,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:44:08,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:44:08,254 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:44:08,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:44:08,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:44:08,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:44:08,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:44:08,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:44:08,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:44:08,254 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:44:08,254 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:44:08,254 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:44:08,254 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:44:08,254 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:44:08,254 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:44:08,255 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:44:08,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:44:08,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:44:08,255 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:44:08,255 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:44:08,255 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:44:08,255 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:44:08,255 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:44:08,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:44:08,255 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:44:08,255 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:44:08,255 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:44:08,255 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:44:08,255 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 -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2025-03-03 09:44:08,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:44:08,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:44:08,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:44:08,493 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:44:08,494 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:44:08,494 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2025-03-03 09:44:09,686 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd059dadb/8566eaf8caea4169944b2eb032b55cf5/FLAGc21022335 [2025-03-03 09:44:09,928 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:44:09,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2025-03-03 09:44:09,938 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd059dadb/8566eaf8caea4169944b2eb032b55cf5/FLAGc21022335 [2025-03-03 09:44:09,952 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd059dadb/8566eaf8caea4169944b2eb032b55cf5 [2025-03-03 09:44:09,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:44:09,955 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:44:09,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:44:09,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:44:09,959 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:44:09,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:44:09" (1/1) ... [2025-03-03 09:44:09,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ac8e18f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:09, skipping insertion in model container [2025-03-03 09:44:09,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:44:09" (1/1) ... [2025-03-03 09:44:09,977 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:44:10,081 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/bitvector/soft_float_1-3a.c.cil.c[730,743] [2025-03-03 09:44:10,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:44:10,144 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:44:10,153 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/bitvector/soft_float_1-3a.c.cil.c[730,743] [2025-03-03 09:44:10,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:44:10,200 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:44:10,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:10 WrapperNode [2025-03-03 09:44:10,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:44:10,203 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:44:10,203 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:44:10,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:44:10,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:10" (1/1) ... [2025-03-03 09:44:10,216 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:10" (1/1) ... [2025-03-03 09:44:10,240 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 189 [2025-03-03 09:44:10,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:44:10,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:44:10,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:44:10,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:44:10,249 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:10" (1/1) ... [2025-03-03 09:44:10,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:10" (1/1) ... [2025-03-03 09:44:10,251 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:10" (1/1) ... [2025-03-03 09:44:10,261 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 09:44:10,262 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:10" (1/1) ... [2025-03-03 09:44:10,262 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:10" (1/1) ... [2025-03-03 09:44:10,265 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:10" (1/1) ... [2025-03-03 09:44:10,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:10" (1/1) ... [2025-03-03 09:44:10,266 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:10" (1/1) ... [2025-03-03 09:44:10,267 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:10" (1/1) ... [2025-03-03 09:44:10,268 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:44:10,269 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:44:10,269 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:44:10,269 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:44:10,273 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:10" (1/1) ... [2025-03-03 09:44:10,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:44:10,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:10,297 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 09:44:10,299 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 09:44:10,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:44:10,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:44:10,316 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-03-03 09:44:10,316 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-03-03 09:44:10,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:44:10,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:44:10,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 09:44:10,316 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 09:44:10,362 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:44:10,363 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:44:10,747 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2025-03-03 09:44:10,747 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:44:10,777 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:44:10,777 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-03 09:44:10,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:44:10 BoogieIcfgContainer [2025-03-03 09:44:10,777 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:44:10,779 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:44:10,779 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:44:10,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:44:10,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:44:09" (1/3) ... [2025-03-03 09:44:10,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1541dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:44:10, skipping insertion in model container [2025-03-03 09:44:10,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:10" (2/3) ... [2025-03-03 09:44:10,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1541dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:44:10, skipping insertion in model container [2025-03-03 09:44:10,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:44:10" (3/3) ... [2025-03-03 09:44:10,787 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2025-03-03 09:44:10,797 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:44:10,799 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_1-3a.c.cil.c that has 3 procedures, 96 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 09:44:10,844 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:44:10,852 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;@26b19145, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:44:10,852 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:44:10,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 83 states have (on average 1.5542168674698795) internal successors, (129), 86 states have internal predecessors, (129), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 09:44:10,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 09:44:10,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:10,865 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:10,865 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:10,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:10,870 INFO L85 PathProgramCache]: Analyzing trace with hash 358100066, now seen corresponding path program 1 times [2025-03-03 09:44:10,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:10,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957806123] [2025-03-03 09:44:10,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:10,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:10,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 09:44:10,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 09:44:10,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:10,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:11,360 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:44:11,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:11,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957806123] [2025-03-03 09:44:11,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957806123] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:11,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899743632] [2025-03-03 09:44:11,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:11,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:11,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:11,363 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 09:44:11,365 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 09:44:11,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 09:44:11,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 09:44:11,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:11,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:11,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 09:44:11,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:11,500 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:44:11,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:11,637 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:44:11,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899743632] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:11,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:44:11,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2025-03-03 09:44:11,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244862746] [2025-03-03 09:44:11,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:11,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:44:11,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:11,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:44:11,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:44:11,663 INFO L87 Difference]: Start difference. First operand has 96 states, 83 states have (on average 1.5542168674698795) internal successors, (129), 86 states have internal predecessors, (129), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 11 states have internal predecessors, (39), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 09:44:11,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:11,988 INFO L93 Difference]: Finished difference Result 271 states and 444 transitions. [2025-03-03 09:44:11,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:44:11,993 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 11 states have internal predecessors, (39), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) Word has length 36 [2025-03-03 09:44:11,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:12,002 INFO L225 Difference]: With dead ends: 271 [2025-03-03 09:44:12,002 INFO L226 Difference]: Without dead ends: 172 [2025-03-03 09:44:12,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:44:12,008 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 126 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:12,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1041 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:44:12,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-03 09:44:12,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 163. [2025-03-03 09:44:12,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 141 states have (on average 1.4397163120567376) internal successors, (203), 142 states have internal predecessors, (203), 18 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (24), 20 states have call predecessors, (24), 17 states have call successors, (24) [2025-03-03 09:44:12,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2025-03-03 09:44:12,050 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 36 [2025-03-03 09:44:12,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:12,050 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2025-03-03 09:44:12,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 11 states have internal predecessors, (39), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 09:44:12,050 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2025-03-03 09:44:12,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 09:44:12,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:12,052 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:12,059 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 09:44:12,257 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,SelfDestructingSolverStorable0 [2025-03-03 09:44:12,257 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:12,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:12,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1310618847, now seen corresponding path program 1 times [2025-03-03 09:44:12,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:12,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543794910] [2025-03-03 09:44:12,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:12,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:12,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 09:44:12,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 09:44:12,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:12,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:12,414 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:44:12,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:12,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543794910] [2025-03-03 09:44:12,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543794910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:12,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:12,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 09:44:12,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782470162] [2025-03-03 09:44:12,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:12,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 09:44:12,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:12,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 09:44:12,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:44:12,416 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:12,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:12,546 INFO L93 Difference]: Finished difference Result 332 states and 500 transitions. [2025-03-03 09:44:12,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:44:12,546 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2025-03-03 09:44:12,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:12,548 INFO L225 Difference]: With dead ends: 332 [2025-03-03 09:44:12,548 INFO L226 Difference]: Without dead ends: 227 [2025-03-03 09:44:12,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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 09:44:12,549 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 32 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:12,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 684 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:12,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-03 09:44:12,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2025-03-03 09:44:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 199 states have (on average 1.4120603015075377) internal successors, (281), 198 states have internal predecessors, (281), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (28), 28 states have call predecessors, (28), 21 states have call successors, (28) [2025-03-03 09:44:12,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 331 transitions. [2025-03-03 09:44:12,573 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 331 transitions. Word has length 40 [2025-03-03 09:44:12,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:12,574 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 331 transitions. [2025-03-03 09:44:12,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:12,574 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 331 transitions. [2025-03-03 09:44:12,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 09:44:12,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:12,576 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:12,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:44:12,577 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:12,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:12,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1948736198, now seen corresponding path program 1 times [2025-03-03 09:44:12,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:12,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437256867] [2025-03-03 09:44:12,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:12,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:12,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 09:44:12,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 09:44:12,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:12,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:12,653 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:44:12,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:12,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437256867] [2025-03-03 09:44:12,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437256867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:12,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:12,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:44:12,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16979319] [2025-03-03 09:44:12,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:12,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:44:12,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:12,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:44:12,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:44:12,655 INFO L87 Difference]: Start difference. First operand 225 states and 331 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:12,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:12,706 INFO L93 Difference]: Finished difference Result 388 states and 572 transitions. [2025-03-03 09:44:12,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:44:12,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2025-03-03 09:44:12,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:12,709 INFO L225 Difference]: With dead ends: 388 [2025-03-03 09:44:12,710 INFO L226 Difference]: Without dead ends: 322 [2025-03-03 09:44:12,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:44:12,711 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 38 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:12,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 421 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:12,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-03-03 09:44:12,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2025-03-03 09:44:12,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 290 states have (on average 1.3793103448275863) internal successors, (400), 289 states have internal predecessors, (400), 28 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (34), 34 states have call predecessors, (34), 27 states have call successors, (34) [2025-03-03 09:44:12,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 462 transitions. [2025-03-03 09:44:12,740 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 462 transitions. Word has length 43 [2025-03-03 09:44:12,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:12,740 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 462 transitions. [2025-03-03 09:44:12,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:12,740 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 462 transitions. [2025-03-03 09:44:12,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 09:44:12,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:12,742 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:12,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:44:12,742 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:12,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:12,742 INFO L85 PathProgramCache]: Analyzing trace with hash -863286540, now seen corresponding path program 1 times [2025-03-03 09:44:12,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:12,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120427057] [2025-03-03 09:44:12,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:12,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:12,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 09:44:12,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 09:44:12,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:12,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:12,825 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 09:44:12,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:12,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120427057] [2025-03-03 09:44:12,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120427057] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:12,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397392837] [2025-03-03 09:44:12,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:12,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:12,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:12,831 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 09:44:12,834 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 09:44:12,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 09:44:12,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 09:44:12,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:12,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:12,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:44:12,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:12,895 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:44:12,896 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:12,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397392837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:12,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:44:12,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:44:12,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502449503] [2025-03-03 09:44:12,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:12,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:44:12,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:12,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:44:12,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:44:12,897 INFO L87 Difference]: Start difference. First operand 322 states and 462 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:12,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:12,933 INFO L93 Difference]: Finished difference Result 416 states and 603 transitions. [2025-03-03 09:44:12,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:44:12,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2025-03-03 09:44:12,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:12,935 INFO L225 Difference]: With dead ends: 416 [2025-03-03 09:44:12,935 INFO L226 Difference]: Without dead ends: 350 [2025-03-03 09:44:12,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:44:12,936 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 40 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:12,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 278 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:12,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-03-03 09:44:12,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2025-03-03 09:44:12,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 319 states have (on average 1.3573667711598747) internal successors, (433), 316 states have internal predecessors, (433), 27 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (33), 33 states have call predecessors, (33), 26 states have call successors, (33) [2025-03-03 09:44:12,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 493 transitions. [2025-03-03 09:44:12,956 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 493 transitions. Word has length 43 [2025-03-03 09:44:12,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:12,956 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 493 transitions. [2025-03-03 09:44:12,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:12,957 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 493 transitions. [2025-03-03 09:44:12,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:44:12,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:12,960 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:12,966 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 09:44:13,164 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,SelfDestructingSolverStorable3 [2025-03-03 09:44:13,165 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:13,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:13,166 INFO L85 PathProgramCache]: Analyzing trace with hash -650183892, now seen corresponding path program 1 times [2025-03-03 09:44:13,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:13,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208577974] [2025-03-03 09:44:13,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:13,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:13,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:44:13,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:44:13,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:13,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:13,214 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:44:13,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:13,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208577974] [2025-03-03 09:44:13,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208577974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:13,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:13,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:44:13,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700701041] [2025-03-03 09:44:13,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:13,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:44:13,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:13,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:44:13,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:44:13,215 INFO L87 Difference]: Start difference. First operand 350 states and 493 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:13,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:13,243 INFO L93 Difference]: Finished difference Result 361 states and 505 transitions. [2025-03-03 09:44:13,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:44:13,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-03-03 09:44:13,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:13,244 INFO L225 Difference]: With dead ends: 361 [2025-03-03 09:44:13,244 INFO L226 Difference]: Without dead ends: 354 [2025-03-03 09:44:13,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:44:13,245 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:13,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 378 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:13,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-03 09:44:13,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-03-03 09:44:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 323 states have (on average 1.3529411764705883) internal successors, (437), 320 states have internal predecessors, (437), 27 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (33), 33 states have call predecessors, (33), 26 states have call successors, (33) [2025-03-03 09:44:13,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 497 transitions. [2025-03-03 09:44:13,259 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 497 transitions. Word has length 44 [2025-03-03 09:44:13,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:13,259 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 497 transitions. [2025-03-03 09:44:13,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:13,259 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 497 transitions. [2025-03-03 09:44:13,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:44:13,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:13,260 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:13,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 09:44:13,260 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:13,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:13,260 INFO L85 PathProgramCache]: Analyzing trace with hash 237319789, now seen corresponding path program 1 times [2025-03-03 09:44:13,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:13,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310788637] [2025-03-03 09:44:13,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:13,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:13,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:44:13,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:44:13,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:13,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:44:13,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:13,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310788637] [2025-03-03 09:44:13,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310788637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:13,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:13,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 09:44:13,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160981724] [2025-03-03 09:44:13,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:13,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:44:13,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:13,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:44:13,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:44:13,317 INFO L87 Difference]: Start difference. First operand 354 states and 497 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:13,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:13,374 INFO L93 Difference]: Finished difference Result 361 states and 503 transitions. [2025-03-03 09:44:13,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:44:13,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-03-03 09:44:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:13,376 INFO L225 Difference]: With dead ends: 361 [2025-03-03 09:44:13,376 INFO L226 Difference]: Without dead ends: 354 [2025-03-03 09:44:13,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 09:44:13,377 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 3 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:13,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 502 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:13,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-03 09:44:13,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 350. [2025-03-03 09:44:13,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 319 states have (on average 1.347962382445141) internal successors, (430), 316 states have internal predecessors, (430), 27 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (33), 33 states have call predecessors, (33), 26 states have call successors, (33) [2025-03-03 09:44:13,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 490 transitions. [2025-03-03 09:44:13,391 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 490 transitions. Word has length 44 [2025-03-03 09:44:13,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:13,391 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 490 transitions. [2025-03-03 09:44:13,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:13,391 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 490 transitions. [2025-03-03 09:44:13,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:44:13,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:13,393 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:13,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 09:44:13,393 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:13,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:13,393 INFO L85 PathProgramCache]: Analyzing trace with hash -655789113, now seen corresponding path program 1 times [2025-03-03 09:44:13,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:13,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996245686] [2025-03-03 09:44:13,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:13,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:13,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:44:13,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:44:13,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:13,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:13,593 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:44:13,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:13,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996245686] [2025-03-03 09:44:13,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996245686] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:13,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907499454] [2025-03-03 09:44:13,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:13,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:13,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:13,596 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 09:44:13,597 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 09:44:13,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:44:13,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:44:13,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:13,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:13,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 09:44:13,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:44:13,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:13,879 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:44:13,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907499454] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:13,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:44:13,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 19 [2025-03-03 09:44:13,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289245139] [2025-03-03 09:44:13,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:13,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 09:44:13,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:13,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 09:44:13,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:44:13,881 INFO L87 Difference]: Start difference. First operand 350 states and 490 transitions. Second operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 15 states have internal predecessors, (49), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 09:44:14,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:14,065 INFO L93 Difference]: Finished difference Result 509 states and 719 transitions. [2025-03-03 09:44:14,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 09:44:14,065 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 15 states have internal predecessors, (49), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 44 [2025-03-03 09:44:14,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:14,067 INFO L225 Difference]: With dead ends: 509 [2025-03-03 09:44:14,067 INFO L226 Difference]: Without dead ends: 380 [2025-03-03 09:44:14,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:44:14,068 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 9 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:14,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1580 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:44:14,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-03 09:44:14,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 368. [2025-03-03 09:44:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 336 states have (on average 1.3333333333333333) internal successors, (448), 332 states have internal predecessors, (448), 27 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (40), 35 states have call predecessors, (40), 26 states have call successors, (40) [2025-03-03 09:44:14,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 515 transitions. [2025-03-03 09:44:14,100 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 515 transitions. Word has length 44 [2025-03-03 09:44:14,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:14,100 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 515 transitions. [2025-03-03 09:44:14,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 15 states have internal predecessors, (49), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 09:44:14,100 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 515 transitions. [2025-03-03 09:44:14,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:44:14,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:14,101 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:14,108 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 09:44:14,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:14,303 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:14,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:14,304 INFO L85 PathProgramCache]: Analyzing trace with hash -362386106, now seen corresponding path program 1 times [2025-03-03 09:44:14,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:14,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776769923] [2025-03-03 09:44:14,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:14,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:14,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:44:14,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:44:14,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:14,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:14,450 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:44:14,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:14,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776769923] [2025-03-03 09:44:14,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776769923] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:14,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033334786] [2025-03-03 09:44:14,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:14,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:14,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:14,454 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 09:44:14,456 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 09:44:14,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:44:14,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:44:14,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:14,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:14,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 09:44:14,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:14,598 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:44:14,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:14,695 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:44:14,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033334786] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:14,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:44:14,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 11] total 16 [2025-03-03 09:44:14,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002972985] [2025-03-03 09:44:14,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:14,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:44:14,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:14,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:44:14,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:44:14,696 INFO L87 Difference]: Start difference. First operand 368 states and 515 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:14,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:14,804 INFO L93 Difference]: Finished difference Result 599 states and 839 transitions. [2025-03-03 09:44:14,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:44:14,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-03-03 09:44:14,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:14,806 INFO L225 Difference]: With dead ends: 599 [2025-03-03 09:44:14,806 INFO L226 Difference]: Without dead ends: 457 [2025-03-03 09:44:14,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:44:14,807 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 88 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:14,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 424 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:14,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-03-03 09:44:14,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 380. [2025-03-03 09:44:14,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 348 states have (on average 1.3218390804597702) internal successors, (460), 344 states have internal predecessors, (460), 27 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (40), 35 states have call predecessors, (40), 26 states have call successors, (40) [2025-03-03 09:44:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 527 transitions. [2025-03-03 09:44:14,822 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 527 transitions. Word has length 44 [2025-03-03 09:44:14,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:14,822 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 527 transitions. [2025-03-03 09:44:14,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:14,822 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 527 transitions. [2025-03-03 09:44:14,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:44:14,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:14,823 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:14,829 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 09:44:15,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:15,024 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:15,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:15,025 INFO L85 PathProgramCache]: Analyzing trace with hash -309987251, now seen corresponding path program 1 times [2025-03-03 09:44:15,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:15,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954562768] [2025-03-03 09:44:15,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:15,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:15,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:44:15,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:44:15,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:15,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:15,082 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 09:44:15,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:15,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954562768] [2025-03-03 09:44:15,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954562768] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:15,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156523813] [2025-03-03 09:44:15,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:15,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:15,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:15,084 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 09:44:15,086 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 09:44:15,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:44:15,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:44:15,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:15,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:15,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:44:15,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:44:15,141 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:15,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156523813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:15,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:44:15,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 09:44:15,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013382929] [2025-03-03 09:44:15,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:15,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:44:15,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:15,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:44:15,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:44:15,143 INFO L87 Difference]: Start difference. First operand 380 states and 527 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:44:15,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:15,195 INFO L93 Difference]: Finished difference Result 734 states and 1031 transitions. [2025-03-03 09:44:15,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:44:15,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2025-03-03 09:44:15,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:15,198 INFO L225 Difference]: With dead ends: 734 [2025-03-03 09:44:15,198 INFO L226 Difference]: Without dead ends: 396 [2025-03-03 09:44:15,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:44:15,200 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 16 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:15,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 341 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:15,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-03 09:44:15,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 386. [2025-03-03 09:44:15,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 353 states have (on average 1.3229461756373937) internal successors, (467), 350 states have internal predecessors, (467), 27 states have call successors, (27), 2 states have call predecessors, (27), 5 states have return successors, (46), 35 states have call predecessors, (46), 26 states have call successors, (46) [2025-03-03 09:44:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 540 transitions. [2025-03-03 09:44:15,215 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 540 transitions. Word has length 44 [2025-03-03 09:44:15,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:15,215 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 540 transitions. [2025-03-03 09:44:15,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:44:15,216 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 540 transitions. [2025-03-03 09:44:15,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 09:44:15,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:15,217 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:15,223 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 09:44:15,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:15,421 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:15,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:15,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1696238108, now seen corresponding path program 1 times [2025-03-03 09:44:15,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:15,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676948451] [2025-03-03 09:44:15,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:15,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:15,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 09:44:15,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 09:44:15,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:15,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:44:15,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:15,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676948451] [2025-03-03 09:44:15,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676948451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:15,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:15,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:44:15,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18597449] [2025-03-03 09:44:15,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:15,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:44:15,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:15,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:44:15,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:44:15,459 INFO L87 Difference]: Start difference. First operand 386 states and 540 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:15,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:15,492 INFO L93 Difference]: Finished difference Result 615 states and 859 transitions. [2025-03-03 09:44:15,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:44:15,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2025-03-03 09:44:15,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:15,498 INFO L225 Difference]: With dead ends: 615 [2025-03-03 09:44:15,499 INFO L226 Difference]: Without dead ends: 575 [2025-03-03 09:44:15,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:44:15,499 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 51 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:15,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 446 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:15,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-03-03 09:44:15,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 427. [2025-03-03 09:44:15,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 391 states have (on average 1.3273657289002558) internal successors, (519), 388 states have internal predecessors, (519), 30 states have call successors, (30), 2 states have call predecessors, (30), 5 states have return successors, (49), 38 states have call predecessors, (49), 29 states have call successors, (49) [2025-03-03 09:44:15,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 598 transitions. [2025-03-03 09:44:15,518 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 598 transitions. Word has length 45 [2025-03-03 09:44:15,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:15,519 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 598 transitions. [2025-03-03 09:44:15,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:15,519 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 598 transitions. [2025-03-03 09:44:15,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 09:44:15,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:15,520 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:15,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 09:44:15,520 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:15,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:15,521 INFO L85 PathProgramCache]: Analyzing trace with hash -2037940667, now seen corresponding path program 1 times [2025-03-03 09:44:15,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:15,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331054802] [2025-03-03 09:44:15,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:15,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:15,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 09:44:15,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 09:44:15,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:15,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:15,554 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:44:15,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:15,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331054802] [2025-03-03 09:44:15,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331054802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:15,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:15,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:44:15,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994885711] [2025-03-03 09:44:15,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:15,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:44:15,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:15,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:44:15,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:44:15,556 INFO L87 Difference]: Start difference. First operand 427 states and 598 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:15,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:15,598 INFO L93 Difference]: Finished difference Result 845 states and 1191 transitions. [2025-03-03 09:44:15,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:44:15,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-03-03 09:44:15,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:15,601 INFO L225 Difference]: With dead ends: 845 [2025-03-03 09:44:15,601 INFO L226 Difference]: Without dead ends: 433 [2025-03-03 09:44:15,603 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 09:44:15,603 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 10 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:15,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 233 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:15,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-03-03 09:44:15,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 428. [2025-03-03 09:44:15,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 392 states have (on average 1.3265306122448979) internal successors, (520), 389 states have internal predecessors, (520), 30 states have call successors, (30), 2 states have call predecessors, (30), 5 states have return successors, (49), 38 states have call predecessors, (49), 29 states have call successors, (49) [2025-03-03 09:44:15,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 599 transitions. [2025-03-03 09:44:15,619 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 599 transitions. Word has length 47 [2025-03-03 09:44:15,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:15,619 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 599 transitions. [2025-03-03 09:44:15,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:15,620 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 599 transitions. [2025-03-03 09:44:15,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 09:44:15,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:15,621 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:15,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 09:44:15,621 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:15,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:15,622 INFO L85 PathProgramCache]: Analyzing trace with hash -310496050, now seen corresponding path program 1 times [2025-03-03 09:44:15,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:15,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401460663] [2025-03-03 09:44:15,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:15,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:15,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 09:44:15,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 09:44:15,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:15,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:15,675 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 09:44:15,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:15,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401460663] [2025-03-03 09:44:15,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401460663] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:15,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581678081] [2025-03-03 09:44:15,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:15,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:15,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:15,677 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 09:44:15,679 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 09:44:15,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 09:44:15,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 09:44:15,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:15,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:15,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:44:15,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:44:15,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:15,827 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 09:44:15,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581678081] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:15,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:44:15,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-03 09:44:15,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50069098] [2025-03-03 09:44:15,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:15,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:44:15,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:15,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:44:15,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:44:15,828 INFO L87 Difference]: Start difference. First operand 428 states and 599 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 09:44:15,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:15,937 INFO L93 Difference]: Finished difference Result 914 states and 1308 transitions. [2025-03-03 09:44:15,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:44:15,938 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2025-03-03 09:44:15,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:15,940 INFO L225 Difference]: With dead ends: 914 [2025-03-03 09:44:15,940 INFO L226 Difference]: Without dead ends: 489 [2025-03-03 09:44:15,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:44:15,941 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 82 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:15,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 690 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:15,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-03 09:44:15,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 452. [2025-03-03 09:44:15,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 414 states have (on average 1.3333333333333333) internal successors, (552), 413 states have internal predecessors, (552), 30 states have call successors, (30), 2 states have call predecessors, (30), 7 states have return successors, (61), 38 states have call predecessors, (61), 29 states have call successors, (61) [2025-03-03 09:44:15,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 643 transitions. [2025-03-03 09:44:15,954 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 643 transitions. Word has length 47 [2025-03-03 09:44:15,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:15,954 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 643 transitions. [2025-03-03 09:44:15,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 09:44:15,954 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 643 transitions. [2025-03-03 09:44:15,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 09:44:15,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:15,955 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:15,962 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 09:44:16,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:16,156 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:16,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:16,156 INFO L85 PathProgramCache]: Analyzing trace with hash 626338640, now seen corresponding path program 1 times [2025-03-03 09:44:16,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:16,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186450326] [2025-03-03 09:44:16,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:16,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:16,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 09:44:16,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:44:16,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:16,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:16,282 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:44:16,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:16,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186450326] [2025-03-03 09:44:16,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186450326] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:16,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586141152] [2025-03-03 09:44:16,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:16,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:16,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:16,285 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 09:44:16,286 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 09:44:16,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 09:44:16,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:44:16,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:16,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:16,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 09:44:16,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:16,409 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:44:16,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:16,479 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:44:16,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586141152] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:16,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:44:16,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 11] total 15 [2025-03-03 09:44:16,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702039802] [2025-03-03 09:44:16,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:16,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 09:44:16,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:16,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 09:44:16,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:44:16,481 INFO L87 Difference]: Start difference. First operand 452 states and 643 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:16,610 INFO L93 Difference]: Finished difference Result 646 states and 919 transitions. [2025-03-03 09:44:16,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:44:16,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-03-03 09:44:16,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:16,613 INFO L225 Difference]: With dead ends: 646 [2025-03-03 09:44:16,613 INFO L226 Difference]: Without dead ends: 610 [2025-03-03 09:44:16,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:44:16,614 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 48 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:16,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 505 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:16,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-03-03 09:44:16,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 554. [2025-03-03 09:44:16,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 506 states have (on average 1.3241106719367588) internal successors, (670), 506 states have internal predecessors, (670), 40 states have call successors, (40), 2 states have call predecessors, (40), 7 states have return successors, (71), 48 states have call predecessors, (71), 39 states have call successors, (71) [2025-03-03 09:44:16,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 781 transitions. [2025-03-03 09:44:16,637 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 781 transitions. Word has length 48 [2025-03-03 09:44:16,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:16,637 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 781 transitions. [2025-03-03 09:44:16,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:16,637 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 781 transitions. [2025-03-03 09:44:16,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 09:44:16,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:16,639 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:16,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:16,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:16,843 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:16,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:16,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1170612719, now seen corresponding path program 1 times [2025-03-03 09:44:16,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:16,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294842257] [2025-03-03 09:44:16,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:16,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:16,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 09:44:16,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:44:16,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:16,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:16,873 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:44:16,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:16,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294842257] [2025-03-03 09:44:16,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294842257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:16,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:16,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:44:16,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195364182] [2025-03-03 09:44:16,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:16,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:44:16,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:16,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:44:16,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:44:16,874 INFO L87 Difference]: Start difference. First operand 554 states and 781 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:16,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:16,902 INFO L93 Difference]: Finished difference Result 569 states and 797 transitions. [2025-03-03 09:44:16,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:44:16,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-03-03 09:44:16,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:16,905 INFO L225 Difference]: With dead ends: 569 [2025-03-03 09:44:16,905 INFO L226 Difference]: Without dead ends: 513 [2025-03-03 09:44:16,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:44:16,906 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:16,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 375 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:16,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-03-03 09:44:16,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2025-03-03 09:44:16,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 465 states have (on average 1.3333333333333333) internal successors, (620), 467 states have internal predecessors, (620), 40 states have call successors, (40), 2 states have call predecessors, (40), 7 states have return successors, (67), 46 states have call predecessors, (67), 39 states have call successors, (67) [2025-03-03 09:44:16,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 727 transitions. [2025-03-03 09:44:16,924 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 727 transitions. Word has length 48 [2025-03-03 09:44:16,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:16,924 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 727 transitions. [2025-03-03 09:44:16,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:16,924 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 727 transitions. [2025-03-03 09:44:16,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 09:44:16,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:16,925 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:16,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 09:44:16,925 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:16,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:16,926 INFO L85 PathProgramCache]: Analyzing trace with hash -133363688, now seen corresponding path program 1 times [2025-03-03 09:44:16,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:16,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285611132] [2025-03-03 09:44:16,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:16,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:16,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 09:44:16,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:44:16,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:16,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:16,953 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:44:16,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:16,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285611132] [2025-03-03 09:44:16,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285611132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:16,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:16,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:44:16,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266950652] [2025-03-03 09:44:16,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:16,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:44:16,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:16,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:44:16,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:44:16,954 INFO L87 Difference]: Start difference. First operand 513 states and 727 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:17,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:17,000 INFO L93 Difference]: Finished difference Result 1018 states and 1451 transitions. [2025-03-03 09:44:17,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:44:17,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-03-03 09:44:17,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:17,003 INFO L225 Difference]: With dead ends: 1018 [2025-03-03 09:44:17,003 INFO L226 Difference]: Without dead ends: 518 [2025-03-03 09:44:17,004 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 09:44:17,004 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 5 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:17,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 237 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:17,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-03 09:44:17,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 514. [2025-03-03 09:44:17,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 466 states have (on average 1.3304721030042919) internal successors, (620), 468 states have internal predecessors, (620), 40 states have call successors, (40), 2 states have call predecessors, (40), 7 states have return successors, (67), 46 states have call predecessors, (67), 39 states have call successors, (67) [2025-03-03 09:44:17,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 727 transitions. [2025-03-03 09:44:17,024 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 727 transitions. Word has length 48 [2025-03-03 09:44:17,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:17,024 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 727 transitions. [2025-03-03 09:44:17,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:17,024 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 727 transitions. [2025-03-03 09:44:17,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 09:44:17,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:17,026 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:17,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 09:44:17,026 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:17,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:17,026 INFO L85 PathProgramCache]: Analyzing trace with hash -960959902, now seen corresponding path program 1 times [2025-03-03 09:44:17,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:17,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072357220] [2025-03-03 09:44:17,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:17,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:17,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 09:44:17,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:44:17,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:17,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:17,135 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:44:17,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:17,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072357220] [2025-03-03 09:44:17,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072357220] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:17,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792997161] [2025-03-03 09:44:17,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:17,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:17,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:17,137 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 09:44:17,138 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 09:44:17,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 09:44:17,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:44:17,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:17,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:17,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 09:44:17,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:17,246 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:44:17,246 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:17,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792997161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:17,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:44:17,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 10 [2025-03-03 09:44:17,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205511748] [2025-03-03 09:44:17,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:17,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 09:44:17,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:17,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 09:44:17,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:44:17,247 INFO L87 Difference]: Start difference. First operand 514 states and 727 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:44:17,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:17,487 INFO L93 Difference]: Finished difference Result 1168 states and 1667 transitions. [2025-03-03 09:44:17,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 09:44:17,487 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2025-03-03 09:44:17,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:17,491 INFO L225 Difference]: With dead ends: 1168 [2025-03-03 09:44:17,491 INFO L226 Difference]: Without dead ends: 910 [2025-03-03 09:44:17,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:44:17,493 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 163 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:17,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1274 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:44:17,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2025-03-03 09:44:17,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 692. [2025-03-03 09:44:17,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 629 states have (on average 1.3370429252782194) internal successors, (841), 626 states have internal predecessors, (841), 55 states have call successors, (55), 2 states have call predecessors, (55), 7 states have return successors, (92), 66 states have call predecessors, (92), 54 states have call successors, (92) [2025-03-03 09:44:17,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 988 transitions. [2025-03-03 09:44:17,522 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 988 transitions. Word has length 48 [2025-03-03 09:44:17,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:17,522 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 988 transitions. [2025-03-03 09:44:17,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:44:17,523 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 988 transitions. [2025-03-03 09:44:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 09:44:17,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:17,527 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:17,533 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 09:44:17,731 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,SelfDestructingSolverStorable15 [2025-03-03 09:44:17,731 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:17,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:17,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1157473407, now seen corresponding path program 1 times [2025-03-03 09:44:17,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:17,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809016985] [2025-03-03 09:44:17,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:17,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:17,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 09:44:17,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:44:17,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:17,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:17,892 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:44:17,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:17,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809016985] [2025-03-03 09:44:17,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809016985] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:17,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129883857] [2025-03-03 09:44:17,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:17,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:17,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:17,895 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 09:44:17,897 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 09:44:17,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 09:44:17,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:44:17,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:17,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:17,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 09:44:17,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:18,072 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:44:18,073 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:18,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129883857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:18,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:44:18,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 15 [2025-03-03 09:44:18,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453647248] [2025-03-03 09:44:18,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:18,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 09:44:18,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:18,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 09:44:18,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:44:18,074 INFO L87 Difference]: Start difference. First operand 692 states and 988 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:44:18,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:18,417 INFO L93 Difference]: Finished difference Result 834 states and 1179 transitions. [2025-03-03 09:44:18,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:44:18,418 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2025-03-03 09:44:18,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:18,421 INFO L225 Difference]: With dead ends: 834 [2025-03-03 09:44:18,421 INFO L226 Difference]: Without dead ends: 832 [2025-03-03 09:44:18,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:44:18,422 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 135 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1959 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:18,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1959 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:44:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-03-03 09:44:18,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 714. [2025-03-03 09:44:18,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 648 states have (on average 1.3333333333333333) internal successors, (864), 647 states have internal predecessors, (864), 57 states have call successors, (57), 3 states have call predecessors, (57), 8 states have return successors, (94), 66 states have call predecessors, (94), 56 states have call successors, (94) [2025-03-03 09:44:18,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1015 transitions. [2025-03-03 09:44:18,442 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1015 transitions. Word has length 48 [2025-03-03 09:44:18,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:18,443 INFO L471 AbstractCegarLoop]: Abstraction has 714 states and 1015 transitions. [2025-03-03 09:44:18,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:44:18,443 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1015 transitions. [2025-03-03 09:44:18,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 09:44:18,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:18,444 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:18,451 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 09:44:18,649 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,SelfDestructingSolverStorable16 [2025-03-03 09:44:18,649 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:18,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:18,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1532802410, now seen corresponding path program 1 times [2025-03-03 09:44:18,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:18,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422503729] [2025-03-03 09:44:18,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:18,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:18,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 09:44:18,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 09:44:18,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:18,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:44:18,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:18,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422503729] [2025-03-03 09:44:18,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422503729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:18,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:18,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:44:18,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787080369] [2025-03-03 09:44:18,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:18,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:44:18,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:18,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:44:18,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:44:18,694 INFO L87 Difference]: Start difference. First operand 714 states and 1015 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:18,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:18,755 INFO L93 Difference]: Finished difference Result 1411 states and 2009 transitions. [2025-03-03 09:44:18,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:44:18,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-03-03 09:44:18,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:18,758 INFO L225 Difference]: With dead ends: 1411 [2025-03-03 09:44:18,758 INFO L226 Difference]: Without dead ends: 718 [2025-03-03 09:44:18,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:44:18,760 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 9 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:18,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 360 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:18,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2025-03-03 09:44:18,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 713. [2025-03-03 09:44:18,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 647 states have (on average 1.3323029366306027) internal successors, (862), 646 states have internal predecessors, (862), 57 states have call successors, (57), 3 states have call predecessors, (57), 8 states have return successors, (94), 66 states have call predecessors, (94), 56 states have call successors, (94) [2025-03-03 09:44:18,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1013 transitions. [2025-03-03 09:44:18,779 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1013 transitions. Word has length 49 [2025-03-03 09:44:18,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:18,779 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 1013 transitions. [2025-03-03 09:44:18,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:18,779 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1013 transitions. [2025-03-03 09:44:18,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 09:44:18,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:18,781 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:18,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 09:44:18,781 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:18,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:18,781 INFO L85 PathProgramCache]: Analyzing trace with hash 277526038, now seen corresponding path program 1 times [2025-03-03 09:44:18,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:18,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892584161] [2025-03-03 09:44:18,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:18,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:18,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 09:44:18,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 09:44:18,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:18,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:18,863 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:44:18,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:18,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892584161] [2025-03-03 09:44:18,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892584161] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:18,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40493940] [2025-03-03 09:44:18,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:18,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:18,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:18,866 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 09:44:18,867 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 09:44:18,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 09:44:18,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 09:44:18,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:18,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:18,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 09:44:18,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:44:19,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:19,669 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:44:19,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40493940] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:19,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:44:19,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 26 [2025-03-03 09:44:19,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129736652] [2025-03-03 09:44:19,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:19,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 09:44:19,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:19,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 09:44:19,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2025-03-03 09:44:19,671 INFO L87 Difference]: Start difference. First operand 713 states and 1013 transitions. Second operand has 26 states, 25 states have (on average 2.8) internal successors, (70), 22 states have internal predecessors, (70), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 09:44:20,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:20,299 INFO L93 Difference]: Finished difference Result 779 states and 1094 transitions. [2025-03-03 09:44:20,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 09:44:20,299 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.8) internal successors, (70), 22 states have internal predecessors, (70), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 49 [2025-03-03 09:44:20,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:20,302 INFO L225 Difference]: With dead ends: 779 [2025-03-03 09:44:20,302 INFO L226 Difference]: Without dead ends: 699 [2025-03-03 09:44:20,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=955, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 09:44:20,303 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 94 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:20,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1797 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:44:20,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-03 09:44:20,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 653. [2025-03-03 09:44:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 593 states have (on average 1.3288364249578415) internal successors, (788), 592 states have internal predecessors, (788), 51 states have call successors, (51), 3 states have call predecessors, (51), 8 states have return successors, (88), 60 states have call predecessors, (88), 50 states have call successors, (88) [2025-03-03 09:44:20,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 927 transitions. [2025-03-03 09:44:20,319 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 927 transitions. Word has length 49 [2025-03-03 09:44:20,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:20,319 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 927 transitions. [2025-03-03 09:44:20,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.8) internal successors, (70), 22 states have internal predecessors, (70), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 09:44:20,320 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 927 transitions. [2025-03-03 09:44:20,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 09:44:20,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:20,321 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:20,327 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 09:44:20,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:20,525 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:20,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:20,525 INFO L85 PathProgramCache]: Analyzing trace with hash 702679225, now seen corresponding path program 1 times [2025-03-03 09:44:20,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:20,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86341258] [2025-03-03 09:44:20,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:20,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:20,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 09:44:20,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 09:44:20,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:20,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:20,642 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:44:20,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:20,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86341258] [2025-03-03 09:44:20,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86341258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:20,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:20,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 09:44:20,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410299107] [2025-03-03 09:44:20,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:20,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 09:44:20,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:20,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 09:44:20,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 09:44:20,643 INFO L87 Difference]: Start difference. First operand 653 states and 927 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:20,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:20,904 INFO L93 Difference]: Finished difference Result 880 states and 1259 transitions. [2025-03-03 09:44:20,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:44:20,904 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2025-03-03 09:44:20,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:20,907 INFO L225 Difference]: With dead ends: 880 [2025-03-03 09:44:20,907 INFO L226 Difference]: Without dead ends: 858 [2025-03-03 09:44:20,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 09:44:20,909 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 63 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:20,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 926 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:44:20,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2025-03-03 09:44:20,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 706. [2025-03-03 09:44:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 642 states have (on average 1.3317757009345794) internal successors, (855), 641 states have internal predecessors, (855), 55 states have call successors, (55), 3 states have call predecessors, (55), 8 states have return successors, (92), 64 states have call predecessors, (92), 54 states have call successors, (92) [2025-03-03 09:44:20,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1002 transitions. [2025-03-03 09:44:20,931 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1002 transitions. Word has length 50 [2025-03-03 09:44:20,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:20,931 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 1002 transitions. [2025-03-03 09:44:20,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:20,932 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1002 transitions. [2025-03-03 09:44:20,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 09:44:20,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:20,934 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:20,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 09:44:20,934 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:20,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:20,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1428878830, now seen corresponding path program 1 times [2025-03-03 09:44:20,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:20,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176667485] [2025-03-03 09:44:20,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:20,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:20,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 09:44:20,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 09:44:20,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:20,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:20,963 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:44:20,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:20,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176667485] [2025-03-03 09:44:20,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176667485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:20,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:20,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:44:20,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478293871] [2025-03-03 09:44:20,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:20,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:44:20,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:20,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:44:20,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:44:20,964 INFO L87 Difference]: Start difference. First operand 706 states and 1002 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:20,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:20,997 INFO L93 Difference]: Finished difference Result 737 states and 1041 transitions. [2025-03-03 09:44:20,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:44:20,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2025-03-03 09:44:20,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:21,000 INFO L225 Difference]: With dead ends: 737 [2025-03-03 09:44:21,000 INFO L226 Difference]: Without dead ends: 706 [2025-03-03 09:44:21,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:44:21,000 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 50 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:21,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 378 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:21,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2025-03-03 09:44:21,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 702. [2025-03-03 09:44:21,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 638 states have (on average 1.3103448275862069) internal successors, (836), 637 states have internal predecessors, (836), 55 states have call successors, (55), 3 states have call predecessors, (55), 8 states have return successors, (92), 64 states have call predecessors, (92), 54 states have call successors, (92) [2025-03-03 09:44:21,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 983 transitions. [2025-03-03 09:44:21,019 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 983 transitions. Word has length 50 [2025-03-03 09:44:21,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:21,020 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 983 transitions. [2025-03-03 09:44:21,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:21,020 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 983 transitions. [2025-03-03 09:44:21,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 09:44:21,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:21,021 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:21,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 09:44:21,021 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:21,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:21,021 INFO L85 PathProgramCache]: Analyzing trace with hash -609177459, now seen corresponding path program 1 times [2025-03-03 09:44:21,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:21,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295826785] [2025-03-03 09:44:21,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:21,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:21,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 09:44:21,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 09:44:21,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:21,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:21,071 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:44:21,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:21,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295826785] [2025-03-03 09:44:21,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295826785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:21,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:21,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 09:44:21,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192105668] [2025-03-03 09:44:21,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:21,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:44:21,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:21,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:44:21,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:44:21,072 INFO L87 Difference]: Start difference. First operand 702 states and 983 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:21,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:21,183 INFO L93 Difference]: Finished difference Result 902 states and 1248 transitions. [2025-03-03 09:44:21,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:44:21,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2025-03-03 09:44:21,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:21,186 INFO L225 Difference]: With dead ends: 902 [2025-03-03 09:44:21,187 INFO L226 Difference]: Without dead ends: 868 [2025-03-03 09:44:21,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 09:44:21,188 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 46 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:21,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 562 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:21,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2025-03-03 09:44:21,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 854. [2025-03-03 09:44:21,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 775 states have (on average 1.3148387096774194) internal successors, (1019), 775 states have internal predecessors, (1019), 70 states have call successors, (70), 3 states have call predecessors, (70), 8 states have return successors, (107), 79 states have call predecessors, (107), 69 states have call successors, (107) [2025-03-03 09:44:21,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1196 transitions. [2025-03-03 09:44:21,213 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1196 transitions. Word has length 50 [2025-03-03 09:44:21,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:21,213 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 1196 transitions. [2025-03-03 09:44:21,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:21,213 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1196 transitions. [2025-03-03 09:44:21,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 09:44:21,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:21,216 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:21,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 09:44:21,217 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:21,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:21,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1389742506, now seen corresponding path program 1 times [2025-03-03 09:44:21,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:21,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745474210] [2025-03-03 09:44:21,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:21,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:21,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 09:44:21,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 09:44:21,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:21,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:21,380 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:44:21,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:21,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745474210] [2025-03-03 09:44:21,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745474210] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:21,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919494908] [2025-03-03 09:44:21,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:21,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:21,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:21,383 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 09:44:21,384 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 09:44:21,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 09:44:21,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 09:44:21,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:21,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:21,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 09:44:21,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:21,530 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:44:21,530 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:21,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919494908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:21,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:44:21,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 20 [2025-03-03 09:44:21,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099245066] [2025-03-03 09:44:21,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:21,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:44:21,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:21,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:44:21,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:44:21,531 INFO L87 Difference]: Start difference. First operand 854 states and 1196 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:21,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:21,778 INFO L93 Difference]: Finished difference Result 1620 states and 2258 transitions. [2025-03-03 09:44:21,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:44:21,778 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2025-03-03 09:44:21,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:21,783 INFO L225 Difference]: With dead ends: 1620 [2025-03-03 09:44:21,783 INFO L226 Difference]: Without dead ends: 1339 [2025-03-03 09:44:21,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2025-03-03 09:44:21,784 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 118 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:21,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1200 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:44:21,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2025-03-03 09:44:21,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1184. [2025-03-03 09:44:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1075 states have (on average 1.3134883720930233) internal successors, (1412), 1075 states have internal predecessors, (1412), 100 states have call successors, (100), 3 states have call predecessors, (100), 8 states have return successors, (136), 112 states have call predecessors, (136), 98 states have call successors, (136) [2025-03-03 09:44:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1648 transitions. [2025-03-03 09:44:21,817 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1648 transitions. Word has length 52 [2025-03-03 09:44:21,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:21,817 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1648 transitions. [2025-03-03 09:44:21,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:21,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1648 transitions. [2025-03-03 09:44:21,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 09:44:21,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:21,819 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:21,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:22,019 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,SelfDestructingSolverStorable22 [2025-03-03 09:44:22,020 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:22,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:22,020 INFO L85 PathProgramCache]: Analyzing trace with hash -502238825, now seen corresponding path program 1 times [2025-03-03 09:44:22,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:22,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858883988] [2025-03-03 09:44:22,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:22,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:22,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 09:44:22,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 09:44:22,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:22,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:22,046 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:44:22,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:22,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858883988] [2025-03-03 09:44:22,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858883988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:22,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:22,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:44:22,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119266995] [2025-03-03 09:44:22,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:22,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:44:22,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:22,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:44:22,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:44:22,047 INFO L87 Difference]: Start difference. First operand 1184 states and 1648 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:22,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:22,084 INFO L93 Difference]: Finished difference Result 1193 states and 1656 transitions. [2025-03-03 09:44:22,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:44:22,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2025-03-03 09:44:22,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:22,088 INFO L225 Difference]: With dead ends: 1193 [2025-03-03 09:44:22,089 INFO L226 Difference]: Without dead ends: 1143 [2025-03-03 09:44:22,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:44:22,090 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:22,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 369 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:22,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2025-03-03 09:44:22,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1122. [2025-03-03 09:44:22,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1017 states have (on average 1.3146509341199606) internal successors, (1337), 1017 states have internal predecessors, (1337), 96 states have call successors, (96), 3 states have call predecessors, (96), 8 states have return successors, (128), 106 states have call predecessors, (128), 94 states have call successors, (128) [2025-03-03 09:44:22,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1561 transitions. [2025-03-03 09:44:22,118 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1561 transitions. Word has length 52 [2025-03-03 09:44:22,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:22,118 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1561 transitions. [2025-03-03 09:44:22,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:22,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1561 transitions. [2025-03-03 09:44:22,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 09:44:22,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:22,120 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:22,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 09:44:22,120 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:22,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:22,120 INFO L85 PathProgramCache]: Analyzing trace with hash 975478811, now seen corresponding path program 1 times [2025-03-03 09:44:22,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:22,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229801198] [2025-03-03 09:44:22,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:22,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:22,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 09:44:22,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 09:44:22,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:22,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:22,225 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:44:22,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:22,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229801198] [2025-03-03 09:44:22,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229801198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:22,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:22,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 09:44:22,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138592776] [2025-03-03 09:44:22,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:22,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 09:44:22,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:22,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 09:44:22,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:44:22,226 INFO L87 Difference]: Start difference. First operand 1122 states and 1561 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:22,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:22,442 INFO L93 Difference]: Finished difference Result 1470 states and 2054 transitions. [2025-03-03 09:44:22,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:44:22,443 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2025-03-03 09:44:22,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:22,447 INFO L225 Difference]: With dead ends: 1470 [2025-03-03 09:44:22,447 INFO L226 Difference]: Without dead ends: 1400 [2025-03-03 09:44:22,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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 09:44:22,448 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 52 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:22,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 586 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:44:22,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2025-03-03 09:44:22,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1142. [2025-03-03 09:44:22,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 1029 states have (on average 1.3236151603498543) internal successors, (1362), 1031 states have internal predecessors, (1362), 104 states have call successors, (104), 3 states have call predecessors, (104), 8 states have return successors, (131), 111 states have call predecessors, (131), 101 states have call successors, (131) [2025-03-03 09:44:22,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1597 transitions. [2025-03-03 09:44:22,486 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1597 transitions. Word has length 52 [2025-03-03 09:44:22,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:22,486 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1597 transitions. [2025-03-03 09:44:22,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:22,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1597 transitions. [2025-03-03 09:44:22,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 09:44:22,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:22,488 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:22,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 09:44:22,489 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:22,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:22,489 INFO L85 PathProgramCache]: Analyzing trace with hash 292743809, now seen corresponding path program 1 times [2025-03-03 09:44:22,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:22,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934638455] [2025-03-03 09:44:22,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:22,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:22,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 09:44:22,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 09:44:22,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:22,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:22,513 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 09:44:22,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:22,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934638455] [2025-03-03 09:44:22,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934638455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:22,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:22,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:44:22,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317986818] [2025-03-03 09:44:22,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:22,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:44:22,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:22,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:44:22,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:44:22,515 INFO L87 Difference]: Start difference. First operand 1142 states and 1597 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:22,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:22,553 INFO L93 Difference]: Finished difference Result 1380 states and 1918 transitions. [2025-03-03 09:44:22,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:44:22,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2025-03-03 09:44:22,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:22,557 INFO L225 Difference]: With dead ends: 1380 [2025-03-03 09:44:22,557 INFO L226 Difference]: Without dead ends: 1214 [2025-03-03 09:44:22,558 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 09:44:22,558 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 49 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:22,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 297 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:22,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2025-03-03 09:44:22,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1096. [2025-03-03 09:44:22,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 987 states have (on average 1.3242147922998986) internal successors, (1307), 990 states have internal predecessors, (1307), 100 states have call successors, (100), 3 states have call predecessors, (100), 8 states have return successors, (123), 106 states have call predecessors, (123), 97 states have call successors, (123) [2025-03-03 09:44:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1530 transitions. [2025-03-03 09:44:22,592 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1530 transitions. Word has length 52 [2025-03-03 09:44:22,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:22,592 INFO L471 AbstractCegarLoop]: Abstraction has 1096 states and 1530 transitions. [2025-03-03 09:44:22,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:22,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1530 transitions. [2025-03-03 09:44:22,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 09:44:22,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:22,594 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:22,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 09:44:22,595 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:22,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:22,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1712652971, now seen corresponding path program 1 times [2025-03-03 09:44:22,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:22,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102192561] [2025-03-03 09:44:22,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:22,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:22,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 09:44:22,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 09:44:22,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:22,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:22,762 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:44:22,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:22,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102192561] [2025-03-03 09:44:22,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102192561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:22,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:22,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 09:44:22,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318912790] [2025-03-03 09:44:22,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:22,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 09:44:22,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:22,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 09:44:22,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:44:22,763 INFO L87 Difference]: Start difference. First operand 1096 states and 1530 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:22,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:22,961 INFO L93 Difference]: Finished difference Result 1333 states and 1852 transitions. [2025-03-03 09:44:22,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 09:44:22,961 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2025-03-03 09:44:22,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:22,966 INFO L225 Difference]: With dead ends: 1333 [2025-03-03 09:44:22,966 INFO L226 Difference]: Without dead ends: 1182 [2025-03-03 09:44:22,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:44:22,967 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 110 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:22,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1112 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:22,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2025-03-03 09:44:23,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1096. [2025-03-03 09:44:23,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 987 states have (on average 1.32016210739615) internal successors, (1303), 990 states have internal predecessors, (1303), 100 states have call successors, (100), 3 states have call predecessors, (100), 8 states have return successors, (123), 106 states have call predecessors, (123), 97 states have call successors, (123) [2025-03-03 09:44:23,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1526 transitions. [2025-03-03 09:44:23,016 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1526 transitions. Word has length 53 [2025-03-03 09:44:23,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:23,016 INFO L471 AbstractCegarLoop]: Abstraction has 1096 states and 1526 transitions. [2025-03-03 09:44:23,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:23,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1526 transitions. [2025-03-03 09:44:23,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 09:44:23,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:23,018 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:23,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 09:44:23,018 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:23,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:23,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1909166476, now seen corresponding path program 1 times [2025-03-03 09:44:23,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:23,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230229976] [2025-03-03 09:44:23,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:23,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:23,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 09:44:23,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 09:44:23,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:23,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:23,116 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:44:23,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:23,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230229976] [2025-03-03 09:44:23,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230229976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:23,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:23,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 09:44:23,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129133236] [2025-03-03 09:44:23,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:23,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 09:44:23,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:23,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 09:44:23,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 09:44:23,117 INFO L87 Difference]: Start difference. First operand 1096 states and 1526 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:23,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:23,230 INFO L93 Difference]: Finished difference Result 1354 states and 1878 transitions. [2025-03-03 09:44:23,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:44:23,230 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2025-03-03 09:44:23,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:23,234 INFO L225 Difference]: With dead ends: 1354 [2025-03-03 09:44:23,234 INFO L226 Difference]: Without dead ends: 1128 [2025-03-03 09:44:23,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:44:23,234 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 77 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:23,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 813 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:23,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2025-03-03 09:44:23,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1096. [2025-03-03 09:44:23,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 987 states have (on average 1.3130699088145896) internal successors, (1296), 990 states have internal predecessors, (1296), 100 states have call successors, (100), 3 states have call predecessors, (100), 8 states have return successors, (123), 106 states have call predecessors, (123), 97 states have call successors, (123) [2025-03-03 09:44:23,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1519 transitions. [2025-03-03 09:44:23,266 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1519 transitions. Word has length 53 [2025-03-03 09:44:23,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:23,266 INFO L471 AbstractCegarLoop]: Abstraction has 1096 states and 1519 transitions. [2025-03-03 09:44:23,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:23,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1519 transitions. [2025-03-03 09:44:23,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 09:44:23,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:23,269 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:23,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 09:44:23,269 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:23,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:23,269 INFO L85 PathProgramCache]: Analyzing trace with hash 631184190, now seen corresponding path program 1 times [2025-03-03 09:44:23,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:23,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933967287] [2025-03-03 09:44:23,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:23,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:23,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 09:44:23,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 09:44:23,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:23,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:23,350 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:44:23,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:23,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933967287] [2025-03-03 09:44:23,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933967287] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:23,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152399890] [2025-03-03 09:44:23,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:23,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:23,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:23,352 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 09:44:23,354 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 09:44:23,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 09:44:23,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 09:44:23,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:23,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:23,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 09:44:23,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:23,417 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:44:23,417 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:23,530 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:44:23,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152399890] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:23,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:44:23,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 13 [2025-03-03 09:44:23,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334296748] [2025-03-03 09:44:23,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:23,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 09:44:23,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:23,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 09:44:23,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:44:23,531 INFO L87 Difference]: Start difference. First operand 1096 states and 1519 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 09:44:23,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:23,689 INFO L93 Difference]: Finished difference Result 1313 states and 1814 transitions. [2025-03-03 09:44:23,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 09:44:23,689 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2025-03-03 09:44:23,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:23,693 INFO L225 Difference]: With dead ends: 1313 [2025-03-03 09:44:23,693 INFO L226 Difference]: Without dead ends: 1118 [2025-03-03 09:44:23,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:44:23,694 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 168 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:23,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 1018 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:23,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2025-03-03 09:44:23,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1041. [2025-03-03 09:44:23,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 938 states have (on average 1.3059701492537314) internal successors, (1225), 941 states have internal predecessors, (1225), 94 states have call successors, (94), 3 states have call predecessors, (94), 8 states have return successors, (117), 100 states have call predecessors, (117), 91 states have call successors, (117) [2025-03-03 09:44:23,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1436 transitions. [2025-03-03 09:44:23,721 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1436 transitions. Word has length 53 [2025-03-03 09:44:23,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:23,721 INFO L471 AbstractCegarLoop]: Abstraction has 1041 states and 1436 transitions. [2025-03-03 09:44:23,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 09:44:23,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1436 transitions. [2025-03-03 09:44:23,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 09:44:23,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:23,722 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:23,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-03 09:44:23,923 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,SelfDestructingSolverStorable28 [2025-03-03 09:44:23,923 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:23,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:23,923 INFO L85 PathProgramCache]: Analyzing trace with hash 434670685, now seen corresponding path program 1 times [2025-03-03 09:44:23,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:23,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494026618] [2025-03-03 09:44:23,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:23,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:23,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 09:44:23,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 09:44:23,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:23,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:24,011 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:44:24,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:24,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494026618] [2025-03-03 09:44:24,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494026618] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:24,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123588240] [2025-03-03 09:44:24,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:24,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:24,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:24,015 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 09:44:24,016 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 09:44:24,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 09:44:24,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 09:44:24,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:24,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:24,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 09:44:24,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:24,128 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:44:24,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:44:24,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123588240] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:24,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:44:24,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 19 [2025-03-03 09:44:24,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540335925] [2025-03-03 09:44:24,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:24,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 09:44:24,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:24,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 09:44:24,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:44:24,243 INFO L87 Difference]: Start difference. First operand 1041 states and 1436 transitions. Second operand has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 16 states have internal predecessors, (67), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 09:44:24,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:24,573 INFO L93 Difference]: Finished difference Result 1556 states and 2133 transitions. [2025-03-03 09:44:24,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 09:44:24,574 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 16 states have internal predecessors, (67), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) Word has length 53 [2025-03-03 09:44:24,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:24,577 INFO L225 Difference]: With dead ends: 1556 [2025-03-03 09:44:24,577 INFO L226 Difference]: Without dead ends: 1122 [2025-03-03 09:44:24,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2025-03-03 09:44:24,579 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 117 mSDsluCounter, 1457 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:24,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1584 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:44:24,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2025-03-03 09:44:24,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1048. [2025-03-03 09:44:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 945 states have (on average 1.2952380952380953) internal successors, (1224), 948 states have internal predecessors, (1224), 94 states have call successors, (94), 3 states have call predecessors, (94), 8 states have return successors, (117), 100 states have call predecessors, (117), 91 states have call successors, (117) [2025-03-03 09:44:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1435 transitions. [2025-03-03 09:44:24,628 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1435 transitions. Word has length 53 [2025-03-03 09:44:24,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:24,628 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1435 transitions. [2025-03-03 09:44:24,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 16 states have internal predecessors, (67), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 09:44:24,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1435 transitions. [2025-03-03 09:44:24,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 09:44:24,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:24,630 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:24,636 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 09:44:24,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:24,831 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:24,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:24,831 INFO L85 PathProgramCache]: Analyzing trace with hash -736195940, now seen corresponding path program 1 times [2025-03-03 09:44:24,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:24,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920579412] [2025-03-03 09:44:24,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:24,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:24,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 09:44:24,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 09:44:24,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:24,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:25,017 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:44:25,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:25,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920579412] [2025-03-03 09:44:25,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920579412] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:25,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14134728] [2025-03-03 09:44:25,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:25,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:25,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:25,020 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 09:44:25,020 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 09:44:25,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 09:44:25,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 09:44:25,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:25,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:25,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 09:44:25,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:25,133 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:44:25,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 09:44:25,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14134728] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:25,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:44:25,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 10] total 19 [2025-03-03 09:44:25,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906745422] [2025-03-03 09:44:25,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:25,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 09:44:25,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:25,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 09:44:25,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:44:25,209 INFO L87 Difference]: Start difference. First operand 1048 states and 1435 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:25,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:25,343 INFO L93 Difference]: Finished difference Result 1146 states and 1552 transitions. [2025-03-03 09:44:25,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:44:25,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2025-03-03 09:44:25,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:25,347 INFO L225 Difference]: With dead ends: 1146 [2025-03-03 09:44:25,347 INFO L226 Difference]: Without dead ends: 1086 [2025-03-03 09:44:25,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-03-03 09:44:25,349 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 50 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:25,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 458 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:25,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2025-03-03 09:44:25,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 998. [2025-03-03 09:44:25,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 903 states have (on average 1.2691029900332227) internal successors, (1146), 907 states have internal predecessors, (1146), 86 states have call successors, (86), 3 states have call predecessors, (86), 8 states have return successors, (109), 91 states have call predecessors, (109), 83 states have call successors, (109) [2025-03-03 09:44:25,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1341 transitions. [2025-03-03 09:44:25,376 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1341 transitions. Word has length 54 [2025-03-03 09:44:25,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:25,377 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1341 transitions. [2025-03-03 09:44:25,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:25,377 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1341 transitions. [2025-03-03 09:44:25,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 09:44:25,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:25,378 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:25,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:25,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:25,582 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:25,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:25,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1239567848, now seen corresponding path program 1 times [2025-03-03 09:44:25,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:25,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738747555] [2025-03-03 09:44:25,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:25,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:25,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 09:44:25,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 09:44:25,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:25,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:25,825 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:44:25,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:25,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738747555] [2025-03-03 09:44:25,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738747555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:25,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:25,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 09:44:25,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101098548] [2025-03-03 09:44:25,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:25,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 09:44:25,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:25,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 09:44:25,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:44:25,826 INFO L87 Difference]: Start difference. First operand 998 states and 1341 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:26,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:26,058 INFO L93 Difference]: Finished difference Result 1123 states and 1509 transitions. [2025-03-03 09:44:26,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 09:44:26,058 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2025-03-03 09:44:26,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:26,062 INFO L225 Difference]: With dead ends: 1123 [2025-03-03 09:44:26,062 INFO L226 Difference]: Without dead ends: 1121 [2025-03-03 09:44:26,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:44:26,063 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 114 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:26,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1581 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:44:26,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2025-03-03 09:44:26,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1014. [2025-03-03 09:44:26,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 915 states have (on average 1.2655737704918033) internal successors, (1158), 922 states have internal predecessors, (1158), 89 states have call successors, (89), 4 states have call predecessors, (89), 9 states have return successors, (112), 91 states have call predecessors, (112), 86 states have call successors, (112) [2025-03-03 09:44:26,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1359 transitions. [2025-03-03 09:44:26,092 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1359 transitions. Word has length 55 [2025-03-03 09:44:26,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:26,092 INFO L471 AbstractCegarLoop]: Abstraction has 1014 states and 1359 transitions. [2025-03-03 09:44:26,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:26,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1359 transitions. [2025-03-03 09:44:26,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 09:44:26,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:26,094 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:26,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 09:44:26,094 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:26,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:26,094 INFO L85 PathProgramCache]: Analyzing trace with hash -131605043, now seen corresponding path program 1 times [2025-03-03 09:44:26,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:26,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773572281] [2025-03-03 09:44:26,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:26,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:26,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 09:44:26,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 09:44:26,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:26,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:26,322 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:44:26,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:26,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773572281] [2025-03-03 09:44:26,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773572281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:26,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:26,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 09:44:26,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742979197] [2025-03-03 09:44:26,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:26,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:44:26,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:26,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:44:26,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:44:26,324 INFO L87 Difference]: Start difference. First operand 1014 states and 1359 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:26,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:26,514 INFO L93 Difference]: Finished difference Result 1055 states and 1409 transitions. [2025-03-03 09:44:26,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 09:44:26,515 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2025-03-03 09:44:26,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:26,518 INFO L225 Difference]: With dead ends: 1055 [2025-03-03 09:44:26,518 INFO L226 Difference]: Without dead ends: 1053 [2025-03-03 09:44:26,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:44:26,519 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 85 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:26,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1158 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:26,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2025-03-03 09:44:26,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1018. [2025-03-03 09:44:26,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 918 states have (on average 1.2647058823529411) internal successors, (1161), 925 states have internal predecessors, (1161), 89 states have call successors, (89), 5 states have call predecessors, (89), 10 states have return successors, (112), 91 states have call predecessors, (112), 86 states have call successors, (112) [2025-03-03 09:44:26,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1362 transitions. [2025-03-03 09:44:26,547 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1362 transitions. Word has length 55 [2025-03-03 09:44:26,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:26,547 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1362 transitions. [2025-03-03 09:44:26,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:26,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1362 transitions. [2025-03-03 09:44:26,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 09:44:26,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:26,549 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:26,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 09:44:26,549 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:26,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:26,550 INFO L85 PathProgramCache]: Analyzing trace with hash -283535738, now seen corresponding path program 1 times [2025-03-03 09:44:26,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:26,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765559502] [2025-03-03 09:44:26,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:26,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:26,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 09:44:26,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 09:44:26,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:26,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 09:44:26,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:26,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765559502] [2025-03-03 09:44:26,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765559502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:26,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:26,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 09:44:26,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982848222] [2025-03-03 09:44:26,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:26,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 09:44:26,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:26,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 09:44:26,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:44:26,599 INFO L87 Difference]: Start difference. First operand 1018 states and 1362 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:26,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:26,656 INFO L93 Difference]: Finished difference Result 1052 states and 1397 transitions. [2025-03-03 09:44:26,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:44:26,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2025-03-03 09:44:26,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:26,659 INFO L225 Difference]: With dead ends: 1052 [2025-03-03 09:44:26,659 INFO L226 Difference]: Without dead ends: 1050 [2025-03-03 09:44:26,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 09:44:26,660 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 19 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:26,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 692 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:26,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2025-03-03 09:44:26,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 1024. [2025-03-03 09:44:26,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 922 states have (on average 1.2635574837310195) internal successors, (1165), 930 states have internal predecessors, (1165), 90 states have call successors, (90), 6 states have call predecessors, (90), 11 states have return successors, (113), 91 states have call predecessors, (113), 87 states have call successors, (113) [2025-03-03 09:44:26,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1368 transitions. [2025-03-03 09:44:26,687 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1368 transitions. Word has length 56 [2025-03-03 09:44:26,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:26,687 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1368 transitions. [2025-03-03 09:44:26,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:26,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1368 transitions. [2025-03-03 09:44:26,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 09:44:26,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:26,689 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:26,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 09:44:26,689 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:26,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:26,690 INFO L85 PathProgramCache]: Analyzing trace with hash -254906587, now seen corresponding path program 1 times [2025-03-03 09:44:26,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:26,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456155186] [2025-03-03 09:44:26,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:26,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:26,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 09:44:26,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 09:44:26,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:26,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:26,737 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 09:44:26,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:26,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456155186] [2025-03-03 09:44:26,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456155186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:26,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:26,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 09:44:26,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774644003] [2025-03-03 09:44:26,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:26,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 09:44:26,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:26,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 09:44:26,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:44:26,738 INFO L87 Difference]: Start difference. First operand 1024 states and 1368 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:26,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:26,804 INFO L93 Difference]: Finished difference Result 1034 states and 1377 transitions. [2025-03-03 09:44:26,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:44:26,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2025-03-03 09:44:26,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:26,810 INFO L225 Difference]: With dead ends: 1034 [2025-03-03 09:44:26,812 INFO L226 Difference]: Without dead ends: 1032 [2025-03-03 09:44:26,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 09:44:26,813 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 8 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:26,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 605 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:26,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2025-03-03 09:44:26,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1028. [2025-03-03 09:44:26,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 925 states have (on average 1.2627027027027027) internal successors, (1168), 933 states have internal predecessors, (1168), 90 states have call successors, (90), 7 states have call predecessors, (90), 12 states have return successors, (113), 91 states have call predecessors, (113), 87 states have call successors, (113) [2025-03-03 09:44:26,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1371 transitions. [2025-03-03 09:44:26,855 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1371 transitions. Word has length 56 [2025-03-03 09:44:26,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:26,855 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1371 transitions. [2025-03-03 09:44:26,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:26,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1371 transitions. [2025-03-03 09:44:26,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 09:44:26,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:26,857 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:26,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 09:44:26,857 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:26,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:26,858 INFO L85 PathProgramCache]: Analyzing trace with hash 428325285, now seen corresponding path program 1 times [2025-03-03 09:44:26,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:26,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127221843] [2025-03-03 09:44:26,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:26,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:26,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:44:26,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:44:26,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:26,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:44:26,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:26,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127221843] [2025-03-03 09:44:26,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127221843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:26,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:26,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 09:44:26,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353200761] [2025-03-03 09:44:26,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:26,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 09:44:26,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:26,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 09:44:26,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 09:44:26,992 INFO L87 Difference]: Start difference. First operand 1028 states and 1371 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:27,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:27,224 INFO L93 Difference]: Finished difference Result 1287 states and 1702 transitions. [2025-03-03 09:44:27,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:44:27,225 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 57 [2025-03-03 09:44:27,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:27,231 INFO L225 Difference]: With dead ends: 1287 [2025-03-03 09:44:27,231 INFO L226 Difference]: Without dead ends: 1221 [2025-03-03 09:44:27,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:44:27,232 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 122 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:27,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 793 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:44:27,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2025-03-03 09:44:27,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1005. [2025-03-03 09:44:27,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 906 states have (on average 1.260485651214128) internal successors, (1142), 914 states have internal predecessors, (1142), 86 states have call successors, (86), 7 states have call predecessors, (86), 12 states have return successors, (106), 86 states have call predecessors, (106), 83 states have call successors, (106) [2025-03-03 09:44:27,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1334 transitions. [2025-03-03 09:44:27,262 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1334 transitions. Word has length 57 [2025-03-03 09:44:27,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:27,262 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1334 transitions. [2025-03-03 09:44:27,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:27,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1334 transitions. [2025-03-03 09:44:27,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 09:44:27,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:27,264 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:27,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 09:44:27,264 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:27,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:27,264 INFO L85 PathProgramCache]: Analyzing trace with hash 566737177, now seen corresponding path program 1 times [2025-03-03 09:44:27,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:27,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880294559] [2025-03-03 09:44:27,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:27,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:27,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 09:44:27,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 09:44:27,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:27,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:44:27,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:27,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880294559] [2025-03-03 09:44:27,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880294559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:27,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:27,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 09:44:27,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638731649] [2025-03-03 09:44:27,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:27,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:44:27,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:27,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:44:27,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:44:27,594 INFO L87 Difference]: Start difference. First operand 1005 states and 1334 transitions. Second operand has 14 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-03 09:44:27,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:27,967 INFO L93 Difference]: Finished difference Result 1192 states and 1576 transitions. [2025-03-03 09:44:27,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 09:44:27,968 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 58 [2025-03-03 09:44:27,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:27,971 INFO L225 Difference]: With dead ends: 1192 [2025-03-03 09:44:27,971 INFO L226 Difference]: Without dead ends: 1094 [2025-03-03 09:44:27,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:44:27,975 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 172 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:27,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1272 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:44:27,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2025-03-03 09:44:28,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1010. [2025-03-03 09:44:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 909 states have (on average 1.2574257425742574) internal successors, (1143), 916 states have internal predecessors, (1143), 87 states have call successors, (87), 8 states have call predecessors, (87), 13 states have return successors, (107), 88 states have call predecessors, (107), 84 states have call successors, (107) [2025-03-03 09:44:28,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1337 transitions. [2025-03-03 09:44:28,010 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1337 transitions. Word has length 58 [2025-03-03 09:44:28,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:28,010 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1337 transitions. [2025-03-03 09:44:28,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-03 09:44:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1337 transitions. [2025-03-03 09:44:28,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 09:44:28,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:28,012 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:28,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 09:44:28,012 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:28,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:28,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1735127636, now seen corresponding path program 1 times [2025-03-03 09:44:28,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:28,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969862468] [2025-03-03 09:44:28,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:28,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:28,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 09:44:28,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 09:44:28,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:28,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 09:44:28,045 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 09:44:28,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 09:44:28,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 09:44:28,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:28,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 09:44:28,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 09:44:28,100 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 09:44:28,101 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 09:44:28,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 09:44:28,105 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:28,138 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 09:44:28,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:44:28 BoogieIcfgContainer [2025-03-03 09:44:28,143 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 09:44:28,143 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 09:44:28,143 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 09:44:28,144 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 09:44:28,144 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:44:10" (3/4) ... [2025-03-03 09:44:28,145 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 09:44:28,146 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 09:44:28,147 INFO L158 Benchmark]: Toolchain (without parser) took 18191.31ms. Allocated memory was 167.8MB in the beginning and 520.1MB in the end (delta: 352.3MB). Free memory was 122.8MB in the beginning and 335.6MB in the end (delta: -212.9MB). Peak memory consumption was 139.3MB. Max. memory is 16.1GB. [2025-03-03 09:44:28,147 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:44:28,147 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.09ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 108.7MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 09:44:28,147 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.24ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 106.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:44:28,147 INFO L158 Benchmark]: Boogie Preprocessor took 25.74ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 104.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:44:28,147 INFO L158 Benchmark]: IcfgBuilder took 508.74ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 80.7MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 09:44:28,147 INFO L158 Benchmark]: TraceAbstraction took 17363.76ms. Allocated memory was 167.8MB in the beginning and 520.1MB in the end (delta: 352.3MB). Free memory was 79.7MB in the beginning and 335.7MB in the end (delta: -256.1MB). Peak memory consumption was 97.4MB. Max. memory is 16.1GB. [2025-03-03 09:44:28,147 INFO L158 Benchmark]: Witness Printer took 2.60ms. Allocated memory is still 520.1MB. Free memory was 335.7MB in the beginning and 335.6MB in the end (delta: 108.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:44:28,148 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.69ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.09ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 108.7MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.24ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 106.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.74ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 104.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 508.74ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 80.7MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17363.76ms. Allocated memory was 167.8MB in the beginning and 520.1MB in the end (delta: 352.3MB). Free memory was 79.7MB in the beginning and 335.7MB in the end (delta: -256.1MB). Peak memory consumption was 97.4MB. Max. memory is 16.1GB. * Witness Printer took 2.60ms. Allocated memory is still 520.1MB. Free memory was 335.7MB in the beginning and 335.6MB in the end (delta: 108.2kB). 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: 17]: 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 bitwiseOr at line 110, overapproximation of bitwiseAnd at line 76. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; VAL [ea=-127, eb=127] [L251] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L251] RET, EXPR base2flt(0, 0) VAL [ea=-127, eb=127] [L251] zero = base2flt(0, 0) [L252] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-127, \old(m)=4311744512] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L29] COND FALSE !(! m) VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L57] COND TRUE 1 VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L76] EXPR m & ~ (1U << 24U) VAL [\old(e)=-127, \old(m)=4311744512, e=-127] [L76] m = m & ~ (1U << 24U) [L77] EXPR m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-127, \old(m)=4311744512] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-127, \old(m)=4311744512, __retres4=16777216] [L80] return (__retres4); VAL [\old(e)=-127, \old(m)=4311744512, \result=16777216] [L252] RET, EXPR base2flt(ma, ea) VAL [ea=-127, eb=127, ma=4311744512, zero=0] [L252] a = base2flt(ma, ea) [L253] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=127, \old(m)=33554432] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, m=33554432] [L80] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, m=33554432] [L253] RET, EXPR base2flt(mb, eb) VAL [a=16777216, ea=-127, eb=127, ma=4311744512, mb=33554432, zero=0] [L253] b = base2flt(mb, eb) [L255] COND FALSE !(a < zero) VAL [a=16777216, b=4294967295, ea=-127, eb=127, ma=4311744512, mb=33554432, zero=0] [L258] COND TRUE a > zero [L259] tmp = 1 VAL [a=16777216, b=4294967295, ea=-127, eb=127, ma=4311744512, mb=33554432, tmp=1, zero=0] [L263] sa = tmp VAL [a=16777216, b=4294967295, ea=-127, eb=127, ma=4311744512, mb=33554432, sa=1, zero=0] [L265] COND FALSE !(b < zero) VAL [a=16777216, b=4294967295, ea=-127, eb=127, ma=4311744512, mb=33554432, sa=1, zero=0] [L268] COND TRUE b > zero [L269] tmp___0 = 1 VAL [a=16777216, b=4294967295, ea=-127, eb=127, ma=4311744512, mb=33554432, sa=1, tmp___0=1] [L273] sb = tmp___0 VAL [a=16777216, b=4294967295, ea=-127, eb=127, ma=4311744512, mb=33554432, sa=1, sb=1] [L276] CALL addflt(a, b) [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [a=16777216, b=4294967295] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [a=4294967295, b=16777216] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 VAL [a=4294967295, b=16777216, ea=127, ma=16777215] [L110] EXPR ma | (1U << 24U) VAL [a=4294967295, b=16777216, ea=127] [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 VAL [a=4294967295, ea=127, eb=-127, ma=-4261412865, mb=0] [L113] EXPR mb | (1U << 24U) VAL [a=4294967295, ea=127, eb=-127, ma=-4261412865] [L113] mb = mb | (1U << 24U) [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L114] RET __VERIFIER_assert(ea >= eb) VAL [a=4294967295, ea=127, eb=-127, ma=-4261412865, mb=16777216] [L115] delta = ea - eb VAL [a=4294967295, delta=254, ea=127, ma=-4261412865, mb=16777216] [L116] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) VAL [\old(cond)=0] [L16] COND TRUE !(cond) VAL [\old(cond)=0] [L17] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.3s, OverallIterations: 38, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2499 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2369 mSDsluCounter, 28929 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23781 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7498 IncrementalHoareTripleChecker+Invalid, 7648 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 5148 mSDtfsCounter, 7498 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1410 GetRequests, 1068 SyntacticMatches, 4 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1184occurred in iteration=23, InterpolantAutomatonStates: 297, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 37 MinimizatonAttempts, 2302 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 2544 NumberOfCodeBlocks, 2544 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 2851 ConstructedInterpolants, 0 QuantifiedInterpolants, 6955 SizeOfPredicates, 23 NumberOfNonLiveVariables, 2029 ConjunctsInSsa, 241 ConjunctsInUnsatCore, 60 InterpolantComputations, 31 PerfectInterpolantSequences, 853/1008 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 09:44:28,162 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/bitvector/soft_float_1-3a.c.cil.c -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 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:44:30,000 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:44:30,087 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 09:44:30,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:44:30,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:44:30,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:44:30,118 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:44:30,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:44:30,119 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:44:30,119 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:44:30,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:44:30,120 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:44:30,120 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:44:30,120 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:44:30,120 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:44:30,120 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:44:30,120 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:44:30,120 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:44:30,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:44:30,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:44:30,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:44:30,120 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:44:30,120 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:44:30,121 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 09:44:30,121 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 09:44:30,121 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 09:44:30,121 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:44:30,121 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:44:30,121 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:44:30,121 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:44:30,121 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:44:30,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:44:30,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:44:30,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:44:30,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:44:30,121 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:44:30,121 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:44:30,121 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:44:30,121 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:44:30,121 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 09:44:30,121 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 09:44:30,121 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:44:30,121 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:44:30,121 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:44:30,121 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:44:30,121 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 -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2025-03-03 09:44:30,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:44:30,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:44:30,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:44:30,361 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:44:30,361 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:44:30,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2025-03-03 09:44:31,484 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d83f9f7fd/94da0a48682e4d1f8f5d6c342be46ccd/FLAGfea435088 [2025-03-03 09:44:31,659 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:44:31,660 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2025-03-03 09:44:31,665 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d83f9f7fd/94da0a48682e4d1f8f5d6c342be46ccd/FLAGfea435088 [2025-03-03 09:44:32,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d83f9f7fd/94da0a48682e4d1f8f5d6c342be46ccd [2025-03-03 09:44:32,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:44:32,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:44:32,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:44:32,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:44:32,049 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:44:32,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:44:32" (1/1) ... [2025-03-03 09:44:32,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cb8dcb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:32, skipping insertion in model container [2025-03-03 09:44:32,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:44:32" (1/1) ... [2025-03-03 09:44:32,062 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:44:32,143 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/bitvector/soft_float_1-3a.c.cil.c[730,743] [2025-03-03 09:44:32,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:44:32,200 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:44:32,208 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/bitvector/soft_float_1-3a.c.cil.c[730,743] [2025-03-03 09:44:32,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:44:32,246 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:44:32,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:32 WrapperNode [2025-03-03 09:44:32,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:44:32,248 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:44:32,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:44:32,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:44:32,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:32" (1/1) ... [2025-03-03 09:44:32,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:32" (1/1) ... [2025-03-03 09:44:32,277 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 148 [2025-03-03 09:44:32,277 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:44:32,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:44:32,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:44:32,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:44:32,287 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:32" (1/1) ... [2025-03-03 09:44:32,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:32" (1/1) ... [2025-03-03 09:44:32,289 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:32" (1/1) ... [2025-03-03 09:44:32,304 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 09:44:32,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:32" (1/1) ... [2025-03-03 09:44:32,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:32" (1/1) ... [2025-03-03 09:44:32,310 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:32" (1/1) ... [2025-03-03 09:44:32,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:32" (1/1) ... [2025-03-03 09:44:32,312 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:32" (1/1) ... [2025-03-03 09:44:32,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:32" (1/1) ... [2025-03-03 09:44:32,314 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:44:32,315 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:44:32,315 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:44:32,315 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:44:32,315 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:32" (1/1) ... [2025-03-03 09:44:32,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:44:32,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:32,345 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 09:44:32,348 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 09:44:32,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:44:32,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 09:44:32,371 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-03-03 09:44:32,371 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-03-03 09:44:32,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:44:32,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:44:32,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 09:44:32,371 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 09:44:32,434 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:44:32,435 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:44:32,676 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-03-03 09:44:32,677 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:44:32,684 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:44:32,684 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:44:32,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:44:32 BoogieIcfgContainer [2025-03-03 09:44:32,684 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:44:32,686 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:44:32,686 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:44:32,689 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:44:32,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:44:32" (1/3) ... [2025-03-03 09:44:32,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c916e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:44:32, skipping insertion in model container [2025-03-03 09:44:32,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:32" (2/3) ... [2025-03-03 09:44:32,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c916e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:44:32, skipping insertion in model container [2025-03-03 09:44:32,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:44:32" (3/3) ... [2025-03-03 09:44:32,692 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2025-03-03 09:44:32,716 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:44:32,717 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_1-3a.c.cil.c that has 3 procedures, 72 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 09:44:32,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:44:32,759 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;@59321cf7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:44:32,759 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:44:32,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 62 states have internal predecessors, (92), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 09:44:32,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 09:44:32,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:32,766 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:32,766 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:32,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:32,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1247145423, now seen corresponding path program 1 times [2025-03-03 09:44:32,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:32,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1476874463] [2025-03-03 09:44:32,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:32,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:32,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:32,778 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 09:44:32,779 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 09:44:32,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 09:44:32,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 09:44:32,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:32,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:32,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 09:44:32,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:44:32,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:44:33,021 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:33,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476874463] [2025-03-03 09:44:33,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476874463] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:33,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:44:33,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-03-03 09:44:33,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076929704] [2025-03-03 09:44:33,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:33,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 09:44:33,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:33,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 09:44:33,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 09:44:33,040 INFO L87 Difference]: Start difference. First operand has 72 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 62 states have internal predecessors, (92), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:44:33,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:33,222 INFO L93 Difference]: Finished difference Result 175 states and 285 transitions. [2025-03-03 09:44:33,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 09:44:33,224 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2025-03-03 09:44:33,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:33,229 INFO L225 Difference]: With dead ends: 175 [2025-03-03 09:44:33,230 INFO L226 Difference]: Without dead ends: 100 [2025-03-03 09:44:33,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:44:33,233 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 33 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:33,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 630 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:33,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-03 09:44:33,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2025-03-03 09:44:33,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.475609756097561) internal successors, (121), 85 states have internal predecessors, (121), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (15), 12 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-03 09:44:33,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 148 transitions. [2025-03-03 09:44:33,264 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 148 transitions. Word has length 32 [2025-03-03 09:44:33,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:33,265 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 148 transitions. [2025-03-03 09:44:33,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:44:33,265 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 148 transitions. [2025-03-03 09:44:33,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 09:44:33,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:33,268 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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 09:44:33,275 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 09:44:33,469 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 09:44:33,469 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:33,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:33,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1564441483, now seen corresponding path program 1 times [2025-03-03 09:44:33,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:33,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [157506633] [2025-03-03 09:44:33,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:33,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:33,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:33,472 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 09:44:33,473 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 09:44:33,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 09:44:33,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 09:44:33,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:33,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:33,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 09:44:33,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:33,659 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:44:33,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:44:33,728 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:33,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157506633] [2025-03-03 09:44:33,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157506633] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:33,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:44:33,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 12 [2025-03-03 09:44:33,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428176264] [2025-03-03 09:44:33,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:33,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 09:44:33,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:33,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 09:44:33,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:44:33,730 INFO L87 Difference]: Start difference. First operand 98 states and 148 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-03 09:44:33,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:33,984 INFO L93 Difference]: Finished difference Result 230 states and 368 transitions. [2025-03-03 09:44:33,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 09:44:33,985 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2025-03-03 09:44:33,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:33,986 INFO L225 Difference]: With dead ends: 230 [2025-03-03 09:44:33,986 INFO L226 Difference]: Without dead ends: 164 [2025-03-03 09:44:33,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:44:33,987 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 55 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:33,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1125 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:44:33,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-03 09:44:34,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 126. [2025-03-03 09:44:34,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 17 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (34), 21 states have call predecessors, (34), 16 states have call successors, (34) [2025-03-03 09:44:34,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 195 transitions. [2025-03-03 09:44:34,009 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 195 transitions. Word has length 36 [2025-03-03 09:44:34,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:34,009 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 195 transitions. [2025-03-03 09:44:34,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-03 09:44:34,009 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 195 transitions. [2025-03-03 09:44:34,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 09:44:34,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:34,011 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:34,020 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 09:44:34,211 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 09:44:34,212 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:34,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:34,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1326465461, now seen corresponding path program 1 times [2025-03-03 09:44:34,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:34,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1910276524] [2025-03-03 09:44:34,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:34,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:34,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:34,215 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 09:44:34,216 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 09:44:34,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 09:44:34,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 09:44:34,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:34,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:34,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 09:44:34,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:44:34,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:34,491 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:44:34,491 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:34,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910276524] [2025-03-03 09:44:34,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910276524] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:34,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:44:34,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 14 [2025-03-03 09:44:34,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720999091] [2025-03-03 09:44:34,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:34,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 09:44:34,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:34,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 09:44:34,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:44:34,492 INFO L87 Difference]: Start difference. First operand 126 states and 195 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:34,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:34,679 INFO L93 Difference]: Finished difference Result 256 states and 390 transitions. [2025-03-03 09:44:34,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:44:34,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2025-03-03 09:44:34,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:34,681 INFO L225 Difference]: With dead ends: 256 [2025-03-03 09:44:34,681 INFO L226 Difference]: Without dead ends: 201 [2025-03-03 09:44:34,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:44:34,682 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 38 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:34,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 436 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:44:34,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-03 09:44:34,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 159. [2025-03-03 09:44:34,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 137 states have (on average 1.3503649635036497) internal successors, (185), 131 states have internal predecessors, (185), 17 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (34), 27 states have call predecessors, (34), 16 states have call successors, (34) [2025-03-03 09:44:34,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 236 transitions. [2025-03-03 09:44:34,696 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 236 transitions. Word has length 40 [2025-03-03 09:44:34,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:34,697 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 236 transitions. [2025-03-03 09:44:34,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:34,697 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 236 transitions. [2025-03-03 09:44:34,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 09:44:34,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:34,698 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:34,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 09:44:34,902 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 09:44:34,902 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:34,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:34,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1297836310, now seen corresponding path program 1 times [2025-03-03 09:44:34,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:34,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1085524887] [2025-03-03 09:44:34,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:34,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:34,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:34,905 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 09:44:34,906 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 09:44:34,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 09:44:34,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 09:44:34,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:34,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:34,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 09:44:34,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:34,989 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:44:34,989 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:34,989 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:34,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085524887] [2025-03-03 09:44:34,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085524887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:34,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:34,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 09:44:34,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559131032] [2025-03-03 09:44:34,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:34,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 09:44:34,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:34,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 09:44:34,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:44:34,990 INFO L87 Difference]: Start difference. First operand 159 states and 236 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:35,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:35,086 INFO L93 Difference]: Finished difference Result 258 states and 387 transitions. [2025-03-03 09:44:35,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:44:35,086 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2025-03-03 09:44:35,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:35,088 INFO L225 Difference]: With dead ends: 258 [2025-03-03 09:44:35,088 INFO L226 Difference]: Without dead ends: 197 [2025-03-03 09:44:35,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 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 09:44:35,089 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 33 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:35,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 517 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:35,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-03 09:44:35,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2025-03-03 09:44:35,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 169 states have (on average 1.3550295857988166) internal successors, (229), 165 states have internal predecessors, (229), 21 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (38), 31 states have call predecessors, (38), 20 states have call successors, (38) [2025-03-03 09:44:35,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 288 transitions. [2025-03-03 09:44:35,108 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 288 transitions. Word has length 40 [2025-03-03 09:44:35,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:35,108 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 288 transitions. [2025-03-03 09:44:35,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:35,109 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 288 transitions. [2025-03-03 09:44:35,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 09:44:35,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:35,113 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:35,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 09:44:35,313 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 09:44:35,314 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:35,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:35,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1464518144, now seen corresponding path program 1 times [2025-03-03 09:44:35,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:35,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1297543253] [2025-03-03 09:44:35,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:35,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:35,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:35,316 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 09:44:35,317 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 09:44:35,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 09:44:35,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 09:44:35,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:35,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:35,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:44:35,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:35,374 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:44:35,375 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:35,375 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:35,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297543253] [2025-03-03 09:44:35,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297543253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:35,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:35,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:44:35,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643884615] [2025-03-03 09:44:35,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:35,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:44:35,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:35,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:44:35,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:44:35,379 INFO L87 Difference]: Start difference. First operand 195 states and 288 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:35,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:35,404 INFO L93 Difference]: Finished difference Result 316 states and 468 transitions. [2025-03-03 09:44:35,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:44:35,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2025-03-03 09:44:35,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:35,407 INFO L225 Difference]: With dead ends: 316 [2025-03-03 09:44:35,408 INFO L226 Difference]: Without dead ends: 250 [2025-03-03 09:44:35,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:44:35,410 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 14 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:35,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 340 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:35,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-03 09:44:35,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2025-03-03 09:44:35,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 221 states have (on average 1.3257918552036199) internal successors, (293), 217 states have internal predecessors, (293), 24 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (41), 34 states have call predecessors, (41), 23 states have call successors, (41) [2025-03-03 09:44:35,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 358 transitions. [2025-03-03 09:44:35,439 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 358 transitions. Word has length 43 [2025-03-03 09:44:35,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:35,439 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 358 transitions. [2025-03-03 09:44:35,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:35,439 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 358 transitions. [2025-03-03 09:44:35,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 09:44:35,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:35,441 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:35,447 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 09:44:35,641 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 09:44:35,642 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:35,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:35,642 INFO L85 PathProgramCache]: Analyzing trace with hash 348504314, now seen corresponding path program 1 times [2025-03-03 09:44:35,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:35,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [315883958] [2025-03-03 09:44:35,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:35,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:35,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:35,644 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 09:44:35,645 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 09:44:35,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 09:44:35,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 09:44:35,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:35,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:35,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:44:35,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:35,703 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:44:35,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:35,703 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:35,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315883958] [2025-03-03 09:44:35,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315883958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:35,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:35,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:44:35,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326876183] [2025-03-03 09:44:35,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:35,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:44:35,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:35,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:44:35,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:44:35,704 INFO L87 Difference]: Start difference. First operand 250 states and 358 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:44:35,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:35,757 INFO L93 Difference]: Finished difference Result 436 states and 621 transitions. [2025-03-03 09:44:35,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:44:35,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2025-03-03 09:44:35,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:35,759 INFO L225 Difference]: With dead ends: 436 [2025-03-03 09:44:35,761 INFO L226 Difference]: Without dead ends: 189 [2025-03-03 09:44:35,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:44:35,762 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 26 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:35,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 261 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:35,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-03 09:44:35,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 177. [2025-03-03 09:44:35,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 155 states have (on average 1.2903225806451613) internal successors, (200), 156 states have internal predecessors, (200), 16 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (27), 20 states have call predecessors, (27), 15 states have call successors, (27) [2025-03-03 09:44:35,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 243 transitions. [2025-03-03 09:44:35,778 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 243 transitions. Word has length 43 [2025-03-03 09:44:35,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:35,778 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 243 transitions. [2025-03-03 09:44:35,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:44:35,779 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 243 transitions. [2025-03-03 09:44:35,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:44:35,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:35,779 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:35,786 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 09:44:35,979 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 09:44:35,980 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:35,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:35,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1504303001, now seen corresponding path program 1 times [2025-03-03 09:44:35,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:35,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [628218953] [2025-03-03 09:44:35,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:35,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:35,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:35,982 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 09:44:35,983 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 09:44:36,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:44:36,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:44:36,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:36,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:36,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:44:36,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:36,030 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:44:36,031 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:36,031 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:36,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628218953] [2025-03-03 09:44:36,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628218953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:36,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:36,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:44:36,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789448828] [2025-03-03 09:44:36,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:36,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:44:36,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:36,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:44:36,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:44:36,032 INFO L87 Difference]: Start difference. First operand 177 states and 243 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:36,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:36,044 INFO L93 Difference]: Finished difference Result 188 states and 255 transitions. [2025-03-03 09:44:36,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:44:36,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-03-03 09:44:36,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:36,045 INFO L225 Difference]: With dead ends: 188 [2025-03-03 09:44:36,045 INFO L226 Difference]: Without dead ends: 181 [2025-03-03 09:44:36,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:44:36,046 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 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 09:44:36,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:36,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-03 09:44:36,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-03 09:44:36,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 159 states have (on average 1.2830188679245282) internal successors, (204), 160 states have internal predecessors, (204), 16 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (27), 20 states have call predecessors, (27), 15 states have call successors, (27) [2025-03-03 09:44:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 247 transitions. [2025-03-03 09:44:36,053 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 247 transitions. Word has length 44 [2025-03-03 09:44:36,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:36,053 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 247 transitions. [2025-03-03 09:44:36,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:36,053 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 247 transitions. [2025-03-03 09:44:36,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:44:36,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:36,054 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:36,060 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 09:44:36,254 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 09:44:36,254 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:36,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:36,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1903160614, now seen corresponding path program 1 times [2025-03-03 09:44:36,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:36,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1827577921] [2025-03-03 09:44:36,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:36,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:36,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:36,257 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 09:44:36,258 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 09:44:36,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:44:36,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:44:36,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:36,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:36,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:44:36,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:36,314 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:44:36,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:36,315 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:36,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827577921] [2025-03-03 09:44:36,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827577921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:36,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:36,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 09:44:36,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059724353] [2025-03-03 09:44:36,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:36,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:44:36,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:36,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:44:36,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:44:36,316 INFO L87 Difference]: Start difference. First operand 181 states and 247 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:36,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:36,337 INFO L93 Difference]: Finished difference Result 188 states and 253 transitions. [2025-03-03 09:44:36,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:44:36,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-03-03 09:44:36,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:36,339 INFO L225 Difference]: With dead ends: 188 [2025-03-03 09:44:36,339 INFO L226 Difference]: Without dead ends: 181 [2025-03-03 09:44:36,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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 09:44:36,339 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 3 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:36,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 382 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:36,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-03 09:44:36,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2025-03-03 09:44:36,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 155 states have (on average 1.270967741935484) internal successors, (197), 156 states have internal predecessors, (197), 16 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (27), 20 states have call predecessors, (27), 15 states have call successors, (27) [2025-03-03 09:44:36,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 240 transitions. [2025-03-03 09:44:36,348 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 240 transitions. Word has length 44 [2025-03-03 09:44:36,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:36,348 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 240 transitions. [2025-03-03 09:44:36,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:36,348 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 240 transitions. [2025-03-03 09:44:36,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:44:36,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:36,349 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:36,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 09:44:36,549 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 09:44:36,550 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:36,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:36,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1231784497, now seen corresponding path program 2 times [2025-03-03 09:44:36,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:36,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1895713490] [2025-03-03 09:44:36,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:44:36,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:36,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:36,552 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 09:44:36,553 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 09:44:36,585 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-03 09:44:36,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 44 statements. [2025-03-03 09:44:36,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 09:44:36,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:36,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 09:44:36,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:36,710 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:44:36,711 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:36,711 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:36,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895713490] [2025-03-03 09:44:36,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895713490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:36,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:36,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 09:44:36,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326993] [2025-03-03 09:44:36,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:36,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:44:36,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:36,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:44:36,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:44:36,712 INFO L87 Difference]: Start difference. First operand 177 states and 240 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:36,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:36,944 INFO L93 Difference]: Finished difference Result 303 states and 414 transitions. [2025-03-03 09:44:36,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 09:44:36,944 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-03-03 09:44:36,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:36,946 INFO L225 Difference]: With dead ends: 303 [2025-03-03 09:44:36,946 INFO L226 Difference]: Without dead ends: 264 [2025-03-03 09:44:36,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:44:36,947 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 55 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:36,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1183 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:44:36,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-03 09:44:36,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 260. [2025-03-03 09:44:36,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 229 states have (on average 1.2838427947598254) internal successors, (294), 228 states have internal predecessors, (294), 24 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (35), 31 states have call predecessors, (35), 23 states have call successors, (35) [2025-03-03 09:44:36,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 353 transitions. [2025-03-03 09:44:36,967 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 353 transitions. Word has length 44 [2025-03-03 09:44:36,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:36,967 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 353 transitions. [2025-03-03 09:44:36,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:36,967 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 353 transitions. [2025-03-03 09:44:36,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:44:36,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:36,968 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:36,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 09:44:37,168 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 09:44:37,169 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:37,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:37,169 INFO L85 PathProgramCache]: Analyzing trace with hash 464351327, now seen corresponding path program 1 times [2025-03-03 09:44:37,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:37,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1275079698] [2025-03-03 09:44:37,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:37,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:37,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:37,171 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 09:44:37,172 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 09:44:37,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:44:37,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:44:37,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:37,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:37,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 09:44:37,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:37,273 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:44:37,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:37,320 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:44:37,320 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:37,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275079698] [2025-03-03 09:44:37,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275079698] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:37,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:44:37,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2025-03-03 09:44:37,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580215795] [2025-03-03 09:44:37,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:37,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 09:44:37,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:37,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 09:44:37,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:44:37,321 INFO L87 Difference]: Start difference. First operand 260 states and 353 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:44:37,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:37,423 INFO L93 Difference]: Finished difference Result 437 states and 620 transitions. [2025-03-03 09:44:37,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:44:37,424 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2025-03-03 09:44:37,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:37,426 INFO L225 Difference]: With dead ends: 437 [2025-03-03 09:44:37,426 INFO L226 Difference]: Without dead ends: 351 [2025-03-03 09:44:37,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 81 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 09:44:37,427 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 44 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:37,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 660 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:37,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-03 09:44:37,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 347. [2025-03-03 09:44:37,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 304 states have (on average 1.305921052631579) internal successors, (397), 306 states have internal predecessors, (397), 36 states have call successors, (36), 3 states have call predecessors, (36), 6 states have return successors, (47), 43 states have call predecessors, (47), 35 states have call successors, (47) [2025-03-03 09:44:37,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 480 transitions. [2025-03-03 09:44:37,448 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 480 transitions. Word has length 44 [2025-03-03 09:44:37,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:37,449 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 480 transitions. [2025-03-03 09:44:37,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:44:37,449 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 480 transitions. [2025-03-03 09:44:37,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:44:37,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:37,453 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:37,460 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 09:44:37,653 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 09:44:37,654 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:37,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:37,655 INFO L85 PathProgramCache]: Analyzing trace with hash 492980478, now seen corresponding path program 1 times [2025-03-03 09:44:37,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:37,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [701112986] [2025-03-03 09:44:37,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:37,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:37,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:37,657 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 09:44:37,659 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 09:44:37,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:44:37,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:44:37,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:37,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:37,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 09:44:37,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:44:37,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:37,933 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:37,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701112986] [2025-03-03 09:44:37,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701112986] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:37,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [444947642] [2025-03-03 09:44:37,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:37,934 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 09:44:37,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 09:44:37,954 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 09:44:37,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2025-03-03 09:44:38,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:44:38,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:44:38,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:38,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:38,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 09:44:38,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:38,122 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:44:38,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:38,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [444947642] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:38,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:44:38,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2025-03-03 09:44:38,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975428519] [2025-03-03 09:44:38,155 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:38,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 09:44:38,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:38,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 09:44:38,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:44:38,156 INFO L87 Difference]: Start difference. First operand 347 states and 480 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:44:38,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:38,344 INFO L93 Difference]: Finished difference Result 361 states and 492 transitions. [2025-03-03 09:44:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:44:38,344 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2025-03-03 09:44:38,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:38,346 INFO L225 Difference]: With dead ends: 361 [2025-03-03 09:44:38,346 INFO L226 Difference]: Without dead ends: 359 [2025-03-03 09:44:38,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:44:38,347 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 46 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:38,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 1188 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:38,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-03 09:44:38,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 355. [2025-03-03 09:44:38,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 310 states have (on average 1.3) internal successors, (403), 312 states have internal predecessors, (403), 36 states have call successors, (36), 5 states have call predecessors, (36), 8 states have return successors, (47), 43 states have call predecessors, (47), 35 states have call successors, (47) [2025-03-03 09:44:38,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 486 transitions. [2025-03-03 09:44:38,368 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 486 transitions. Word has length 44 [2025-03-03 09:44:38,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:38,368 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 486 transitions. [2025-03-03 09:44:38,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:44:38,368 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 486 transitions. [2025-03-03 09:44:38,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:44:38,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:38,369 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:38,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:38,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:38,770 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,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 09:44:38,770 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:38,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:38,770 INFO L85 PathProgramCache]: Analyzing trace with hash 55279985, now seen corresponding path program 1 times [2025-03-03 09:44:38,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:38,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1639347554] [2025-03-03 09:44:38,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:38,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:38,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:38,772 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 09:44:38,773 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 09:44:38,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:44:38,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:44:38,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:38,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:38,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 09:44:38,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:38,907 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 09:44:38,907 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:38,907 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:38,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639347554] [2025-03-03 09:44:38,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639347554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:38,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:38,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 09:44:38,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648542248] [2025-03-03 09:44:38,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:38,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 09:44:38,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:38,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 09:44:38,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:44:38,909 INFO L87 Difference]: Start difference. First operand 355 states and 486 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:38,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:38,989 INFO L93 Difference]: Finished difference Result 376 states and 511 transitions. [2025-03-03 09:44:38,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:44:38,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-03-03 09:44:38,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:38,992 INFO L225 Difference]: With dead ends: 376 [2025-03-03 09:44:38,992 INFO L226 Difference]: Without dead ends: 374 [2025-03-03 09:44:38,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:44:38,992 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 3 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:38,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 474 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:38,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-03-03 09:44:39,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 363. [2025-03-03 09:44:39,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 315 states have (on average 1.3015873015873016) internal successors, (410), 319 states have internal predecessors, (410), 38 states have call successors, (38), 6 states have call predecessors, (38), 9 states have return successors, (49), 43 states have call predecessors, (49), 37 states have call successors, (49) [2025-03-03 09:44:39,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 497 transitions. [2025-03-03 09:44:39,008 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 497 transitions. Word has length 44 [2025-03-03 09:44:39,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:39,008 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 497 transitions. [2025-03-03 09:44:39,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:39,008 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 497 transitions. [2025-03-03 09:44:39,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:44:39,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:39,009 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:39,015 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 09:44:39,213 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 09:44:39,213 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:39,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:39,213 INFO L85 PathProgramCache]: Analyzing trace with hash 83909136, now seen corresponding path program 1 times [2025-03-03 09:44:39,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:39,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [290306080] [2025-03-03 09:44:39,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:39,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:39,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:39,215 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 09:44:39,217 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 09:44:39,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:44:39,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:44:39,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:39,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:39,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:44:39,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 09:44:39,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:39,315 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:39,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290306080] [2025-03-03 09:44:39,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290306080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:39,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:39,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 09:44:39,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707476269] [2025-03-03 09:44:39,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:39,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 09:44:39,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:39,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 09:44:39,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:44:39,317 INFO L87 Difference]: Start difference. First operand 363 states and 497 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:39,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:39,384 INFO L93 Difference]: Finished difference Result 369 states and 502 transitions. [2025-03-03 09:44:39,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:44:39,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-03-03 09:44:39,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:39,386 INFO L225 Difference]: With dead ends: 369 [2025-03-03 09:44:39,386 INFO L226 Difference]: Without dead ends: 367 [2025-03-03 09:44:39,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 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 09:44:39,387 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 3 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:39,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 454 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:39,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-03 09:44:39,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 359. [2025-03-03 09:44:39,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 313 states have (on average 1.2971246006389776) internal successors, (406), 315 states have internal predecessors, (406), 36 states have call successors, (36), 6 states have call predecessors, (36), 9 states have return successors, (47), 43 states have call predecessors, (47), 35 states have call successors, (47) [2025-03-03 09:44:39,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 489 transitions. [2025-03-03 09:44:39,399 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 489 transitions. Word has length 44 [2025-03-03 09:44:39,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:39,399 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 489 transitions. [2025-03-03 09:44:39,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:39,399 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 489 transitions. [2025-03-03 09:44:39,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 09:44:39,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:39,400 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:39,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:39,600 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 09:44:39,601 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:39,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:39,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1151880254, now seen corresponding path program 1 times [2025-03-03 09:44:39,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:39,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [889487734] [2025-03-03 09:44:39,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:39,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:39,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:39,604 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 09:44:39,605 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 09:44:39,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 09:44:39,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 09:44:39,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:39,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:39,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:44:39,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:39,653 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:44:39,653 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:39,653 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:39,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889487734] [2025-03-03 09:44:39,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889487734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:39,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:39,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:44:39,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694418947] [2025-03-03 09:44:39,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:39,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:44:39,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:39,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:44:39,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:44:39,655 INFO L87 Difference]: Start difference. First operand 359 states and 489 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:39,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:39,674 INFO L93 Difference]: Finished difference Result 591 states and 828 transitions. [2025-03-03 09:44:39,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:44:39,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2025-03-03 09:44:39,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:39,676 INFO L225 Difference]: With dead ends: 591 [2025-03-03 09:44:39,676 INFO L226 Difference]: Without dead ends: 499 [2025-03-03 09:44:39,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:44:39,677 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 27 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:39,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 300 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:39,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-03-03 09:44:39,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 412. [2025-03-03 09:44:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 358 states have (on average 1.2988826815642458) internal successors, (465), 358 states have internal predecessors, (465), 44 states have call successors, (44), 6 states have call predecessors, (44), 9 states have return successors, (55), 51 states have call predecessors, (55), 43 states have call successors, (55) [2025-03-03 09:44:39,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 564 transitions. [2025-03-03 09:44:39,691 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 564 transitions. Word has length 45 [2025-03-03 09:44:39,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:39,691 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 564 transitions. [2025-03-03 09:44:39,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:39,692 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 564 transitions. [2025-03-03 09:44:39,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 09:44:39,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:39,692 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:39,698 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 09:44:39,893 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 09:44:39,893 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:39,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:39,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1247932931, now seen corresponding path program 1 times [2025-03-03 09:44:39,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:39,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1677331978] [2025-03-03 09:44:39,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:39,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:39,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:39,897 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 09:44:39,898 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 09:44:39,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 09:44:39,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:44:39,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:39,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:39,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 09:44:39,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:40,016 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:44:40,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:40,081 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:44:40,081 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:40,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677331978] [2025-03-03 09:44:40,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677331978] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:40,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:44:40,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2025-03-03 09:44:40,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790392125] [2025-03-03 09:44:40,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:40,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 09:44:40,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:40,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 09:44:40,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:44:40,082 INFO L87 Difference]: Start difference. First operand 412 states and 564 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:40,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:40,221 INFO L93 Difference]: Finished difference Result 603 states and 844 transitions. [2025-03-03 09:44:40,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:44:40,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-03-03 09:44:40,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:40,224 INFO L225 Difference]: With dead ends: 603 [2025-03-03 09:44:40,224 INFO L226 Difference]: Without dead ends: 563 [2025-03-03 09:44:40,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:44:40,225 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 22 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:40,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 399 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:40,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-03-03 09:44:40,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 444. [2025-03-03 09:44:40,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 378 states have (on average 1.2962962962962963) internal successors, (490), 378 states have internal predecessors, (490), 56 states have call successors, (56), 6 states have call predecessors, (56), 9 states have return successors, (67), 63 states have call predecessors, (67), 55 states have call successors, (67) [2025-03-03 09:44:40,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 613 transitions. [2025-03-03 09:44:40,259 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 613 transitions. Word has length 48 [2025-03-03 09:44:40,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:40,259 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 613 transitions. [2025-03-03 09:44:40,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:40,259 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 613 transitions. [2025-03-03 09:44:40,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 09:44:40,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:40,260 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:40,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:40,460 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 09:44:40,461 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:40,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:40,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1250083006, now seen corresponding path program 1 times [2025-03-03 09:44:40,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:40,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [206599184] [2025-03-03 09:44:40,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:40,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:40,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:40,464 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:44:40,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-03 09:44:40,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 09:44:40,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:44:40,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:40,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:40,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:44:40,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:40,511 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:44:40,512 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:40,512 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:40,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206599184] [2025-03-03 09:44:40,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206599184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:40,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:40,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:44:40,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543714474] [2025-03-03 09:44:40,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:40,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:44:40,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:40,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:44:40,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:44:40,513 INFO L87 Difference]: Start difference. First operand 444 states and 613 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:40,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:40,532 INFO L93 Difference]: Finished difference Result 463 states and 634 transitions. [2025-03-03 09:44:40,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:44:40,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-03-03 09:44:40,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:40,535 INFO L225 Difference]: With dead ends: 463 [2025-03-03 09:44:40,535 INFO L226 Difference]: Without dead ends: 419 [2025-03-03 09:44:40,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:44:40,536 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:40,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:40,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-03 09:44:40,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2025-03-03 09:44:40,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 353 states have (on average 1.3002832861189801) internal successors, (459), 354 states have internal predecessors, (459), 56 states have call successors, (56), 6 states have call predecessors, (56), 9 states have return successors, (65), 62 states have call predecessors, (65), 55 states have call successors, (65) [2025-03-03 09:44:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 580 transitions. [2025-03-03 09:44:40,552 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 580 transitions. Word has length 48 [2025-03-03 09:44:40,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:40,552 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 580 transitions. [2025-03-03 09:44:40,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:40,552 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 580 transitions. [2025-03-03 09:44:40,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 09:44:40,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:40,553 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:40,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:40,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:40,754 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:40,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:40,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1269526118, now seen corresponding path program 1 times [2025-03-03 09:44:40,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:40,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [400094260] [2025-03-03 09:44:40,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:40,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:40,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:40,757 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:44:40,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-03 09:44:40,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 09:44:40,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 09:44:40,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:40,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:40,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 09:44:40,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:40,955 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:44:40,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:44:41,470 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:41,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400094260] [2025-03-03 09:44:41,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400094260] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:41,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:44:41,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2025-03-03 09:44:41,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608147527] [2025-03-03 09:44:41,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:41,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 09:44:41,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:41,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 09:44:41,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2025-03-03 09:44:41,473 INFO L87 Difference]: Start difference. First operand 419 states and 580 transitions. Second operand has 25 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 09:44:42,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:42,597 INFO L93 Difference]: Finished difference Result 480 states and 660 transitions. [2025-03-03 09:44:42,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 09:44:42,598 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 50 [2025-03-03 09:44:42,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:42,600 INFO L225 Difference]: With dead ends: 480 [2025-03-03 09:44:42,600 INFO L226 Difference]: Without dead ends: 478 [2025-03-03 09:44:42,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=1002, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 09:44:42,601 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 135 mSDsluCounter, 1719 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:42,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1829 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 09:44:42,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-03-03 09:44:42,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 423. [2025-03-03 09:44:42,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 356 states have (on average 1.297752808988764) internal successors, (462), 357 states have internal predecessors, (462), 56 states have call successors, (56), 7 states have call predecessors, (56), 10 states have return successors, (65), 62 states have call predecessors, (65), 55 states have call successors, (65) [2025-03-03 09:44:42,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 583 transitions. [2025-03-03 09:44:42,628 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 583 transitions. Word has length 50 [2025-03-03 09:44:42,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:42,628 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 583 transitions. [2025-03-03 09:44:42,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 09:44:42,628 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 583 transitions. [2025-03-03 09:44:42,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 09:44:42,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:42,631 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:42,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-03 09:44:42,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:42,832 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:42,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:42,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2107401359, now seen corresponding path program 1 times [2025-03-03 09:44:42,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:42,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [543921152] [2025-03-03 09:44:42,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:42,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:42,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:42,834 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:44:42,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-03 09:44:42,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 09:44:42,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 09:44:42,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:42,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:42,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:44:42,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:42,881 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 09:44:42,881 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:42,881 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:44:42,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543921152] [2025-03-03 09:44:42,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543921152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:42,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:42,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:44:42,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022582031] [2025-03-03 09:44:42,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:42,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:44:42,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:44:42,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:44:42,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:44:42,882 INFO L87 Difference]: Start difference. First operand 423 states and 583 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:42,935 INFO L93 Difference]: Finished difference Result 548 states and 749 transitions. [2025-03-03 09:44:42,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:44:42,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-03-03 09:44:42,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:42,937 INFO L225 Difference]: With dead ends: 548 [2025-03-03 09:44:42,937 INFO L226 Difference]: Without dead ends: 517 [2025-03-03 09:44:42,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:44:42,939 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 39 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:42,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 261 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:42,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-03 09:44:42,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 427. [2025-03-03 09:44:42,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 360 states have (on average 1.2916666666666667) internal successors, (465), 361 states have internal predecessors, (465), 56 states have call successors, (56), 7 states have call predecessors, (56), 10 states have return successors, (65), 62 states have call predecessors, (65), 55 states have call successors, (65) [2025-03-03 09:44:42,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 586 transitions. [2025-03-03 09:44:42,958 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 586 transitions. Word has length 49 [2025-03-03 09:44:42,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:42,958 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 586 transitions. [2025-03-03 09:44:42,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:44:42,958 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 586 transitions. [2025-03-03 09:44:42,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 09:44:42,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:42,961 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:42,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-03 09:44:43,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:43,166 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:43,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:43,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1819319624, now seen corresponding path program 1 times [2025-03-03 09:44:43,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:44:43,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [233432916] [2025-03-03 09:44:43,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:43,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:43,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:43,169 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:44:43,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-03 09:44:43,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 09:44:43,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 09:44:43,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:43,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 09:44:43,216 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 09:44:43,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 09:44:43,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 09:44:43,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:43,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 09:44:43,255 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-03 09:44:43,255 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 09:44:43,256 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 09:44:43,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:43,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:43,460 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:43,483 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 09:44:43,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:44:43 BoogieIcfgContainer [2025-03-03 09:44:43,487 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 09:44:43,487 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 09:44:43,487 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 09:44:43,487 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 09:44:43,488 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:44:32" (3/4) ... [2025-03-03 09:44:43,488 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 09:44:43,527 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 29. [2025-03-03 09:44:43,573 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 09:44:43,573 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 09:44:43,573 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 09:44:43,574 INFO L158 Benchmark]: Toolchain (without parser) took 11528.38ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 59.2MB in the beginning and 32.9MB in the end (delta: 26.3MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2025-03-03 09:44:43,574 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 83.9MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:44:43,574 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.30ms. Allocated memory is still 83.9MB. Free memory was 58.9MB in the beginning and 44.2MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 09:44:43,574 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.94ms. Allocated memory is still 83.9MB. Free memory was 44.2MB in the beginning and 42.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:44:43,574 INFO L158 Benchmark]: Boogie Preprocessor took 33.35ms. Allocated memory is still 83.9MB. Free memory was 42.6MB in the beginning and 41.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:44:43,575 INFO L158 Benchmark]: IcfgBuilder took 369.67ms. Allocated memory is still 83.9MB. Free memory was 41.0MB in the beginning and 22.2MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 09:44:43,575 INFO L158 Benchmark]: TraceAbstraction took 10801.10ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 21.6MB in the beginning and 40.2MB in the end (delta: -18.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:44:43,575 INFO L158 Benchmark]: Witness Printer took 86.12ms. Allocated memory is still 100.7MB. Free memory was 40.2MB in the beginning and 32.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:44:43,576 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.32ms. Allocated memory is still 83.9MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.30ms. Allocated memory is still 83.9MB. Free memory was 58.9MB in the beginning and 44.2MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.94ms. Allocated memory is still 83.9MB. Free memory was 44.2MB in the beginning and 42.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.35ms. Allocated memory is still 83.9MB. Free memory was 42.6MB in the beginning and 41.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 369.67ms. Allocated memory is still 83.9MB. Free memory was 41.0MB in the beginning and 22.2MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10801.10ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 21.6MB in the beginning and 40.2MB in the end (delta: -18.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 86.12ms. Allocated memory is still 100.7MB. Free memory was 40.2MB in the beginning and 32.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. 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 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; [L251] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L251] RET, EXPR base2flt(0, 0) [L251] zero = base2flt(0, 0) [L252] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=67108864] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=67108864, e=127, m=67108864] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=67108864, e=127, m=67108864] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=67108864, e=127, m=67108864] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m)=67108864, e=127, m=67108864] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=67108864, e=127, m=67108864] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=67108864, __retres4=-1, m=67108864] [L80] return (__retres4); VAL [\old(e)=127, \old(m)=67108864, \result=-1, m=67108864] [L252] RET, EXPR base2flt(ma, ea) VAL [ea=127, ma=67108864, zero=0] [L252] a = base2flt(ma, ea) [L253] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=63, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=63, \old(m)=16777216, e=63, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=63, \old(m)=16777216, e=63, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=63, \old(m)=16777216, e=63, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=63, \old(m)=16777216, e=63, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=63, \old(m)=16777216, e=63, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=63, \old(m)=16777216, __retres4=-1090519040] [L80] return (__retres4); VAL [\old(e)=63, \old(m)=16777216, \result=-1090519040] [L253] RET, EXPR base2flt(mb, eb) VAL [a=-1, ea=127, eb=63, ma=67108864, mb=16777216, zero=0] [L253] b = base2flt(mb, eb) [L255] COND FALSE !(a < zero) VAL [a=-1, b=-1090519040, ea=127, eb=63, ma=67108864, mb=16777216, zero=0] [L258] COND TRUE a > zero [L259] tmp = 1 VAL [a=-1, b=-1090519040, ea=127, eb=63, ma=67108864, mb=16777216, tmp=1, zero=0] [L263] sa = tmp VAL [a=-1, b=-1090519040, ea=127, eb=63, ma=67108864, mb=16777216, sa=1, zero=0] [L265] COND FALSE !(b < zero) VAL [a=-1, b=-1090519040, ea=127, eb=63, ma=67108864, mb=16777216, sa=1, zero=0] [L268] COND TRUE b > zero [L269] tmp___0 = 1 VAL [a=-1, b=-1090519040, ea=127, eb=63, ma=67108864, mb=16777216, sa=1, tmp___0=1] [L273] sb = tmp___0 VAL [a=-1, b=-1090519040, ea=127, eb=63, ma=67108864, mb=16777216, sa=1, sb=1] [L276] CALL addflt(a, b) [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [a=-1, b=-1090519040] [L94] COND FALSE !(a < b) VAL [a=-1, b=-1090519040] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 [L113] mb = mb | (1U << 24U) VAL [a=-1, ea=127, eb=63, ma=33554431, mb=16777216] [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L114] RET __VERIFIER_assert(ea >= eb) VAL [a=-1, ea=127, eb=63, ma=33554431, mb=16777216] [L115] delta = ea - eb VAL [a=-1, delta=64, ea=127, ma=33554431, mb=16777216] [L116] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) VAL [\old(cond)=0] [L16] COND TRUE !(cond) VAL [\old(cond)=0] [L17] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 19, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 633 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 576 mSDsluCounter, 11012 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9114 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2654 IncrementalHoareTripleChecker+Invalid, 2724 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 1898 mSDtfsCounter, 2654 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1109 GetRequests, 962 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=444occurred in iteration=15, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 482 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 876 NumberOfCodeBlocks, 858 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1051 ConstructedInterpolants, 8 QuantifiedInterpolants, 2418 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1519 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 25 InterpolantComputations, 13 PerfectInterpolantSequences, 376/414 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 proved your program to be incorrect! [2025-03-03 09:44:43,596 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE