./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_4-2a.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 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:53:43,919 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:53:43,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:53:43,975 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:53:43,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:53:43,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:53:43,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:53:43,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:53:43,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:53:43,995 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:53:43,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:53:43,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:53:43,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:53:43,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:53:43,997 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:53:43,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:53:43,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:53:43,997 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:53:43,997 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:53:43,997 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:53:43,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:53:43,997 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:53:43,997 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:53:43,997 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:53:43,997 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:53:43,997 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:53:43,997 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:53:43,997 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:53:43,998 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:53:43,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:53:43,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:53:43,998 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:53:43,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:53:43,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:53:43,999 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:53:43,999 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:53:43,999 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:53:43,999 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:53:43,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:53:43,999 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:53:43,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:53:43,999 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:53:43,999 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:53:43,999 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 -> 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b [2025-03-08 00:53:44,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:53:44,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:53:44,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:53:44,242 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:53:44,243 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:53:44,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2025-03-08 00:53:45,411 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdecd9a40/a239d073b2f34c2fa447ad63eb759b47/FLAGd98208a0e [2025-03-08 00:53:45,660 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:53:45,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2025-03-08 00:53:45,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdecd9a40/a239d073b2f34c2fa447ad63eb759b47/FLAGd98208a0e [2025-03-08 00:53:45,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdecd9a40/a239d073b2f34c2fa447ad63eb759b47 [2025-03-08 00:53:45,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:53:45,983 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:53:45,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:53:45,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:53:45,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:53:45,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:53:45" (1/1) ... [2025-03-08 00:53:45,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39582f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:45, skipping insertion in model container [2025-03-08 00:53:45,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:53:45" (1/1) ... [2025-03-08 00:53:46,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:53:46,116 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_4-2a.c.cil.c[755,768] [2025-03-08 00:53:46,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:53:46,172 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:53:46,179 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_4-2a.c.cil.c[755,768] [2025-03-08 00:53:46,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:53:46,225 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:53:46,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:46 WrapperNode [2025-03-08 00:53:46,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:53:46,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:53:46,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:53:46,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:53:46,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:46" (1/1) ... [2025-03-08 00:53:46,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:46" (1/1) ... [2025-03-08 00:53:46,250 INFO L138 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2025-03-08 00:53:46,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:53:46,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:53:46,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:53:46,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:53:46,258 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:46" (1/1) ... [2025-03-08 00:53:46,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:46" (1/1) ... [2025-03-08 00:53:46,261 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:46" (1/1) ... [2025-03-08 00:53:46,282 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-08 00:53:46,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:46" (1/1) ... [2025-03-08 00:53:46,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:46" (1/1) ... [2025-03-08 00:53:46,289 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:46" (1/1) ... [2025-03-08 00:53:46,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:46" (1/1) ... [2025-03-08 00:53:46,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:46" (1/1) ... [2025-03-08 00:53:46,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:46" (1/1) ... [2025-03-08 00:53:46,295 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:53:46,296 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:53:46,296 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:53:46,296 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:53:46,297 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:46" (1/1) ... [2025-03-08 00:53:46,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:53:46,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:46,319 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-08 00:53:46,321 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-08 00:53:46,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:53:46,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:53:46,337 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-03-08 00:53:46,337 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-03-08 00:53:46,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:53:46,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:53:46,337 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2025-03-08 00:53:46,337 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2025-03-08 00:53:46,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 00:53:46,337 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 00:53:46,387 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:53:46,390 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:53:46,645 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-03-08 00:53:46,645 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:53:46,668 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:53:46,669 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 00:53:46,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:53:46 BoogieIcfgContainer [2025-03-08 00:53:46,670 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:53:46,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:53:46,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:53:46,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:53:46,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:53:45" (1/3) ... [2025-03-08 00:53:46,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3400b863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:53:46, skipping insertion in model container [2025-03-08 00:53:46,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:46" (2/3) ... [2025-03-08 00:53:46,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3400b863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:53:46, skipping insertion in model container [2025-03-08 00:53:46,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:53:46" (3/3) ... [2025-03-08 00:53:46,678 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2025-03-08 00:53:46,689 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:53:46,690 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_4-2a.c.cil.c that has 4 procedures, 76 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 00:53:46,736 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:53:46,745 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;@1e2ec7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:53:46,746 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:53:46,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 63 states have (on average 1.492063492063492) internal successors, (94), 64 states have internal predecessors, (94), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 00:53:46,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 00:53:46,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:46,756 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] [2025-03-08 00:53:46,756 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:46,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:46,759 INFO L85 PathProgramCache]: Analyzing trace with hash -82467813, now seen corresponding path program 1 times [2025-03-08 00:53:46,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:46,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230583245] [2025-03-08 00:53:46,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:46,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:46,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 00:53:46,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:53:46,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:46,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:47,236 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-08 00:53:47,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:47,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230583245] [2025-03-08 00:53:47,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230583245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:53:47,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343089251] [2025-03-08 00:53:47,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:47,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:47,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:47,242 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-08 00:53:47,243 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-08 00:53:47,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 00:53:47,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:53:47,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:47,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:47,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 00:53:47,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:47,375 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-08 00:53:47,375 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:47,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343089251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:47,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:53:47,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 12 [2025-03-08 00:53:47,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387839496] [2025-03-08 00:53:47,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:47,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 00:53:47,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:47,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 00:53:47,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:53:47,402 INFO L87 Difference]: Start difference. First operand has 76 states, 63 states have (on average 1.492063492063492) internal successors, (94), 64 states have internal predecessors, (94), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:53:47,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:47,540 INFO L93 Difference]: Finished difference Result 169 states and 255 transitions. [2025-03-08 00:53:47,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:53:47,542 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2025-03-08 00:53:47,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:47,548 INFO L225 Difference]: With dead ends: 169 [2025-03-08 00:53:47,548 INFO L226 Difference]: Without dead ends: 90 [2025-03-08 00:53:47,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:53:47,553 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 14 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:47,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 626 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:47,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-08 00:53:47,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2025-03-08 00:53:47,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 70 states have internal predecessors, (93), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2025-03-08 00:53:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 113 transitions. [2025-03-08 00:53:47,594 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 113 transitions. Word has length 35 [2025-03-08 00:53:47,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:47,596 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 113 transitions. [2025-03-08 00:53:47,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:53:47,596 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 113 transitions. [2025-03-08 00:53:47,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 00:53:47,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:47,598 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] [2025-03-08 00:53:47,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 00:53:47,799 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-08 00:53:47,799 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:47,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:47,800 INFO L85 PathProgramCache]: Analyzing trace with hash 922475980, now seen corresponding path program 1 times [2025-03-08 00:53:47,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:47,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971974366] [2025-03-08 00:53:47,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:47,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:47,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 00:53:47,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:53:47,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:47,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:48,006 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-08 00:53:48,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:48,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971974366] [2025-03-08 00:53:48,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971974366] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:53:48,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736960440] [2025-03-08 00:53:48,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:48,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:48,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:48,010 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-08 00:53:48,011 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-08 00:53:48,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 00:53:48,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:53:48,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:48,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:48,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 00:53:48,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:48,086 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-08 00:53:48,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:53:48,202 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-08 00:53:48,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736960440] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:53:48,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:53:48,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-08 00:53:48,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926981144] [2025-03-08 00:53:48,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:53:48,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 00:53:48,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:48,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 00:53:48,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:53:48,204 INFO L87 Difference]: Start difference. First operand 83 states and 113 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 12 states have internal predecessors, (34), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 00:53:48,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:48,346 INFO L93 Difference]: Finished difference Result 154 states and 208 transitions. [2025-03-08 00:53:48,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:53:48,347 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 12 states have internal predecessors, (34), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2025-03-08 00:53:48,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:48,348 INFO L225 Difference]: With dead ends: 154 [2025-03-08 00:53:48,348 INFO L226 Difference]: Without dead ends: 109 [2025-03-08 00:53:48,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:53:48,349 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 23 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:48,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 937 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:48,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-08 00:53:48,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2025-03-08 00:53:48,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 77 states have internal predecessors, (101), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2025-03-08 00:53:48,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 126 transitions. [2025-03-08 00:53:48,356 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 126 transitions. Word has length 38 [2025-03-08 00:53:48,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:48,357 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 126 transitions. [2025-03-08 00:53:48,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 12 states have internal predecessors, (34), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 00:53:48,357 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 126 transitions. [2025-03-08 00:53:48,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 00:53:48,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:48,358 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] [2025-03-08 00:53:48,364 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-08 00:53:48,562 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,SelfDestructingSolverStorable1 [2025-03-08 00:53:48,562 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:48,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:48,563 INFO L85 PathProgramCache]: Analyzing trace with hash 623477463, now seen corresponding path program 2 times [2025-03-08 00:53:48,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:48,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495929160] [2025-03-08 00:53:48,563 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:53:48,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:48,568 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-08 00:53:48,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 41 statements. [2025-03-08 00:53:48,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 00:53:48,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:48,756 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-08 00:53:48,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:48,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495929160] [2025-03-08 00:53:48,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495929160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:48,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:48,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 00:53:48,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467032003] [2025-03-08 00:53:48,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:48,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:53:48,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:48,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:53:48,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:53:48,758 INFO L87 Difference]: Start difference. First operand 93 states and 126 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:53:48,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:48,981 INFO L93 Difference]: Finished difference Result 224 states and 307 transitions. [2025-03-08 00:53:48,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:53:48,982 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2025-03-08 00:53:48,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:48,983 INFO L225 Difference]: With dead ends: 224 [2025-03-08 00:53:48,985 INFO L226 Difference]: Without dead ends: 175 [2025-03-08 00:53:48,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:53:48,986 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 113 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:48,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1277 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:53:48,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-08 00:53:48,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 140. [2025-03-08 00:53:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 115 states have (on average 1.3304347826086957) internal successors, (153), 118 states have internal predecessors, (153), 15 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (22), 14 states have call predecessors, (22), 14 states have call successors, (22) [2025-03-08 00:53:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2025-03-08 00:53:48,996 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 41 [2025-03-08 00:53:48,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:48,996 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2025-03-08 00:53:48,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:53:48,996 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2025-03-08 00:53:48,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 00:53:48,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:48,998 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] [2025-03-08 00:53:48,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:53:48,998 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:48,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:48,998 INFO L85 PathProgramCache]: Analyzing trace with hash 426963958, now seen corresponding path program 1 times [2025-03-08 00:53:48,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:48,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99681014] [2025-03-08 00:53:48,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:48,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:49,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 00:53:49,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:53:49,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:49,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:49,185 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-08 00:53:49,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:49,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99681014] [2025-03-08 00:53:49,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99681014] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:53:49,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542822072] [2025-03-08 00:53:49,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:49,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:49,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:49,187 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-08 00:53:49,189 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-08 00:53:49,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 00:53:49,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:53:49,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:49,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:49,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 00:53:49,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:49,430 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-08 00:53:49,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:49,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542822072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:49,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:53:49,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [9] total 17 [2025-03-08 00:53:49,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231553853] [2025-03-08 00:53:49,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:49,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:53:49,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:49,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:53:49,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:53:49,431 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:53:49,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:49,651 INFO L93 Difference]: Finished difference Result 305 states and 420 transitions. [2025-03-08 00:53:49,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 00:53:49,651 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2025-03-08 00:53:49,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:49,653 INFO L225 Difference]: With dead ends: 305 [2025-03-08 00:53:49,653 INFO L226 Difference]: Without dead ends: 230 [2025-03-08 00:53:49,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-03-08 00:53:49,654 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 75 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:49,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1617 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:53:49,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-08 00:53:49,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 214. [2025-03-08 00:53:49,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 179 states have (on average 1.324022346368715) internal successors, (237), 182 states have internal predecessors, (237), 22 states have call successors, (22), 10 states have call predecessors, (22), 12 states have return successors, (31), 21 states have call predecessors, (31), 21 states have call successors, (31) [2025-03-08 00:53:49,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 290 transitions. [2025-03-08 00:53:49,674 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 290 transitions. Word has length 41 [2025-03-08 00:53:49,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:49,677 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 290 transitions. [2025-03-08 00:53:49,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:53:49,678 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 290 transitions. [2025-03-08 00:53:49,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 00:53:49,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:49,679 INFO L218 NwaCegarLoop]: trace histogram [3, 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-08 00:53:49,686 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-08 00:53:49,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:49,879 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:49,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:49,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1414676298, now seen corresponding path program 1 times [2025-03-08 00:53:49,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:49,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712347015] [2025-03-08 00:53:49,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:49,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:49,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 00:53:49,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 00:53:49,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:49,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 00:53:49,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:49,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712347015] [2025-03-08 00:53:49,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712347015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:49,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:49,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 00:53:49,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450513648] [2025-03-08 00:53:49,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:49,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 00:53:49,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:49,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 00:53:49,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:53:49,994 INFO L87 Difference]: Start difference. First operand 214 states and 290 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:53:50,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:50,102 INFO L93 Difference]: Finished difference Result 297 states and 403 transitions. [2025-03-08 00:53:50,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:53:50,102 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2025-03-08 00:53:50,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:50,104 INFO L225 Difference]: With dead ends: 297 [2025-03-08 00:53:50,104 INFO L226 Difference]: Without dead ends: 257 [2025-03-08 00:53:50,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:53:50,105 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 85 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:50,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 709 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:50,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-08 00:53:50,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 249. [2025-03-08 00:53:50,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 210 states have (on average 1.3333333333333333) internal successors, (280), 213 states have internal predecessors, (280), 25 states have call successors, (25), 11 states have call predecessors, (25), 13 states have return successors, (34), 24 states have call predecessors, (34), 24 states have call successors, (34) [2025-03-08 00:53:50,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 339 transitions. [2025-03-08 00:53:50,128 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 339 transitions. Word has length 43 [2025-03-08 00:53:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:50,128 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 339 transitions. [2025-03-08 00:53:50,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:53:50,129 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 339 transitions. [2025-03-08 00:53:50,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 00:53:50,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:50,130 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-08 00:53:50,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 00:53:50,130 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:50,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:50,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1611189803, now seen corresponding path program 1 times [2025-03-08 00:53:50,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:50,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526903850] [2025-03-08 00:53:50,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:50,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:50,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 00:53:50,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 00:53:50,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:50,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:50,249 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 00:53:50,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:50,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526903850] [2025-03-08 00:53:50,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526903850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:53:50,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296745945] [2025-03-08 00:53:50,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:50,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:50,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:50,251 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-08 00:53:50,253 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-08 00:53:50,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 00:53:50,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 00:53:50,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:50,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:50,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 00:53:50,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:50,326 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 00:53:50,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:53:50,425 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 00:53:50,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296745945] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:53:50,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:53:50,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-08 00:53:50,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819328030] [2025-03-08 00:53:50,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:53:50,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:53:50,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:50,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:53:50,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:53:50,427 INFO L87 Difference]: Start difference. First operand 249 states and 339 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 00:53:50,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:50,512 INFO L93 Difference]: Finished difference Result 343 states and 466 transitions. [2025-03-08 00:53:50,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:53:50,512 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2025-03-08 00:53:50,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:50,514 INFO L225 Difference]: With dead ends: 343 [2025-03-08 00:53:50,514 INFO L226 Difference]: Without dead ends: 272 [2025-03-08 00:53:50,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:53:50,515 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 16 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:50,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 810 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:50,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-08 00:53:50,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 259. [2025-03-08 00:53:50,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 217 states have (on average 1.3225806451612903) internal successors, (287), 220 states have internal predecessors, (287), 27 states have call successors, (27), 12 states have call predecessors, (27), 14 states have return successors, (36), 26 states have call predecessors, (36), 26 states have call successors, (36) [2025-03-08 00:53:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 350 transitions. [2025-03-08 00:53:50,542 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 350 transitions. Word has length 43 [2025-03-08 00:53:50,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:50,542 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 350 transitions. [2025-03-08 00:53:50,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 00:53:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 350 transitions. [2025-03-08 00:53:50,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 00:53:50,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:50,545 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-08 00:53:50,551 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-08 00:53:50,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:50,746 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:50,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:50,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1984883782, now seen corresponding path program 1 times [2025-03-08 00:53:50,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:50,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893050377] [2025-03-08 00:53:50,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:50,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:50,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 00:53:50,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:53:50,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:50,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:53:50,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:50,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893050377] [2025-03-08 00:53:50,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893050377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:50,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:50,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 00:53:50,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149214054] [2025-03-08 00:53:50,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:50,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 00:53:50,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:50,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 00:53:50,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:53:50,980 INFO L87 Difference]: Start difference. First operand 259 states and 350 transitions. Second operand has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-08 00:53:51,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:51,222 INFO L93 Difference]: Finished difference Result 359 states and 480 transitions. [2025-03-08 00:53:51,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 00:53:51,223 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2025-03-08 00:53:51,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:51,225 INFO L225 Difference]: With dead ends: 359 [2025-03-08 00:53:51,228 INFO L226 Difference]: Without dead ends: 351 [2025-03-08 00:53:51,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:53:51,230 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 52 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:51,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1092 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:53:51,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-08 00:53:51,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 264. [2025-03-08 00:53:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 221 states have (on average 1.3167420814479638) internal successors, (291), 223 states have internal predecessors, (291), 28 states have call successors, (28), 12 states have call predecessors, (28), 14 states have return successors, (37), 28 states have call predecessors, (37), 27 states have call successors, (37) [2025-03-08 00:53:51,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 356 transitions. [2025-03-08 00:53:51,252 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 356 transitions. Word has length 44 [2025-03-08 00:53:51,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:51,252 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 356 transitions. [2025-03-08 00:53:51,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-08 00:53:51,253 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 356 transitions. [2025-03-08 00:53:51,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 00:53:51,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:51,254 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-08 00:53:51,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 00:53:51,255 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:51,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:51,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1420247372, now seen corresponding path program 1 times [2025-03-08 00:53:51,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:51,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129311742] [2025-03-08 00:53:51,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:51,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:51,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 00:53:51,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:53:51,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:51,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:51,285 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 00:53:51,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:51,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129311742] [2025-03-08 00:53:51,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129311742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:51,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:51,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:51,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505814073] [2025-03-08 00:53:51,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:51,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:51,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:51,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:51,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:51,287 INFO L87 Difference]: Start difference. First operand 264 states and 356 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:53:51,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:51,334 INFO L93 Difference]: Finished difference Result 531 states and 724 transitions. [2025-03-08 00:53:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:51,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-03-08 00:53:51,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:51,336 INFO L225 Difference]: With dead ends: 531 [2025-03-08 00:53:51,336 INFO L226 Difference]: Without dead ends: 270 [2025-03-08 00:53:51,337 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-08 00:53:51,337 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 9 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 163 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-08 00:53:51,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 163 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:51,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-08 00:53:51,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 266. [2025-03-08 00:53:51,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 223 states have (on average 1.3183856502242153) internal successors, (294), 225 states have internal predecessors, (294), 28 states have call successors, (28), 12 states have call predecessors, (28), 14 states have return successors, (37), 28 states have call predecessors, (37), 27 states have call successors, (37) [2025-03-08 00:53:51,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 359 transitions. [2025-03-08 00:53:51,354 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 359 transitions. Word has length 44 [2025-03-08 00:53:51,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:51,354 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 359 transitions. [2025-03-08 00:53:51,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:53:51,355 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 359 transitions. [2025-03-08 00:53:51,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 00:53:51,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:51,356 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-08 00:53:51,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 00:53:51,356 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:51,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:51,356 INFO L85 PathProgramCache]: Analyzing trace with hash 648539228, now seen corresponding path program 1 times [2025-03-08 00:53:51,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:51,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6733399] [2025-03-08 00:53:51,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:51,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:51,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 00:53:51,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:53:51,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:51,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:51,417 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 00:53:51,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:51,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6733399] [2025-03-08 00:53:51,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6733399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:51,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:51,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 00:53:51,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700681906] [2025-03-08 00:53:51,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:51,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 00:53:51,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:51,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 00:53:51,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:53:51,419 INFO L87 Difference]: Start difference. First operand 266 states and 359 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 00:53:51,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:51,459 INFO L93 Difference]: Finished difference Result 274 states and 366 transitions. [2025-03-08 00:53:51,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:53:51,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2025-03-08 00:53:51,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:51,461 INFO L225 Difference]: With dead ends: 274 [2025-03-08 00:53:51,461 INFO L226 Difference]: Without dead ends: 259 [2025-03-08 00:53:51,461 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-08 00:53:51,461 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 3 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:51,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 442 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:51,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-08 00:53:51,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2025-03-08 00:53:51,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 218 states have (on average 1.3211009174311927) internal successors, (288), 221 states have internal predecessors, (288), 26 states have call successors, (26), 12 states have call predecessors, (26), 14 states have return successors, (34), 25 states have call predecessors, (34), 25 states have call successors, (34) [2025-03-08 00:53:51,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 348 transitions. [2025-03-08 00:53:51,471 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 348 transitions. Word has length 46 [2025-03-08 00:53:51,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:51,471 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 348 transitions. [2025-03-08 00:53:51,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 00:53:51,471 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 348 transitions. [2025-03-08 00:53:51,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 00:53:51,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:51,472 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] [2025-03-08 00:53:51,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 00:53:51,472 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:51,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:51,473 INFO L85 PathProgramCache]: Analyzing trace with hash 676199338, now seen corresponding path program 1 times [2025-03-08 00:53:51,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:51,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570330414] [2025-03-08 00:53:51,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:51,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:51,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 00:53:51,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:53:51,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:51,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:51,581 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 00:53:51,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:51,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570330414] [2025-03-08 00:53:51,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570330414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:51,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:51,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 00:53:51,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688309520] [2025-03-08 00:53:51,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:51,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 00:53:51,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:51,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 00:53:51,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:53:51,583 INFO L87 Difference]: Start difference. First operand 259 states and 348 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:53:51,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:51,665 INFO L93 Difference]: Finished difference Result 278 states and 368 transitions. [2025-03-08 00:53:51,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:53:51,665 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2025-03-08 00:53:51,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:51,667 INFO L225 Difference]: With dead ends: 278 [2025-03-08 00:53:51,667 INFO L226 Difference]: Without dead ends: 238 [2025-03-08 00:53:51,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:53:51,667 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 11 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:51,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 800 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:51,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-08 00:53:51,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 232. [2025-03-08 00:53:51,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 193 states have (on average 1.305699481865285) internal successors, (252), 196 states have internal predecessors, (252), 24 states have call successors, (24), 12 states have call predecessors, (24), 14 states have return successors, (32), 23 states have call predecessors, (32), 23 states have call successors, (32) [2025-03-08 00:53:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 308 transitions. [2025-03-08 00:53:51,679 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 308 transitions. Word has length 46 [2025-03-08 00:53:51,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:51,679 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 308 transitions. [2025-03-08 00:53:51,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:53:51,680 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 308 transitions. [2025-03-08 00:53:51,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 00:53:51,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:51,681 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-08 00:53:51,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 00:53:51,681 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:51,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:51,682 INFO L85 PathProgramCache]: Analyzing trace with hash -829552025, now seen corresponding path program 1 times [2025-03-08 00:53:51,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:51,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43323541] [2025-03-08 00:53:51,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:51,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:51,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 00:53:51,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 00:53:51,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:51,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:51,711 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:53:51,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:51,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43323541] [2025-03-08 00:53:51,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43323541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:51,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:51,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:51,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439875031] [2025-03-08 00:53:51,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:51,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:51,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:51,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:51,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:51,713 INFO L87 Difference]: Start difference. First operand 232 states and 308 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:53:51,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:51,749 INFO L93 Difference]: Finished difference Result 467 states and 625 transitions. [2025-03-08 00:53:51,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:51,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2025-03-08 00:53:51,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:51,750 INFO L225 Difference]: With dead ends: 467 [2025-03-08 00:53:51,750 INFO L226 Difference]: Without dead ends: 238 [2025-03-08 00:53:51,751 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-08 00:53:51,752 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 4 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 168 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-08 00:53:51,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 168 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:51,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-08 00:53:51,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2025-03-08 00:53:51,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 195 states have (on average 1.3025641025641026) internal successors, (254), 198 states have internal predecessors, (254), 24 states have call successors, (24), 12 states have call predecessors, (24), 14 states have return successors, (32), 23 states have call predecessors, (32), 23 states have call successors, (32) [2025-03-08 00:53:51,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 310 transitions. [2025-03-08 00:53:51,762 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 310 transitions. Word has length 45 [2025-03-08 00:53:51,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:51,763 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 310 transitions. [2025-03-08 00:53:51,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:53:51,763 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 310 transitions. [2025-03-08 00:53:51,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 00:53:51,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:51,764 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] [2025-03-08 00:53:51,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 00:53:51,764 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:51,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:51,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1009266840, now seen corresponding path program 1 times [2025-03-08 00:53:51,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:51,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944888701] [2025-03-08 00:53:51,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:51,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:51,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 00:53:51,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:53:51,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:51,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:51,904 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:53:51,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:51,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944888701] [2025-03-08 00:53:51,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944888701] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:53:51,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605202114] [2025-03-08 00:53:51,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:51,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:51,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:51,906 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-08 00:53:51,908 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-08 00:53:51,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 00:53:51,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:53:51,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:51,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:51,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 00:53:51,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:53:52,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:53:52,413 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:53:52,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605202114] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:53:52,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:53:52,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 32 [2025-03-08 00:53:52,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240541289] [2025-03-08 00:53:52,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:53:52,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 00:53:52,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:52,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 00:53:52,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2025-03-08 00:53:52,416 INFO L87 Difference]: Start difference. First operand 234 states and 310 transitions. Second operand has 32 states, 28 states have (on average 1.75) internal successors, (49), 25 states have internal predecessors, (49), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-08 00:53:53,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:53,765 INFO L93 Difference]: Finished difference Result 455 states and 635 transitions. [2025-03-08 00:53:53,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-08 00:53:53,766 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 1.75) internal successors, (49), 25 states have internal predecessors, (49), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) Word has length 47 [2025-03-08 00:53:53,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:53,768 INFO L225 Difference]: With dead ends: 455 [2025-03-08 00:53:53,768 INFO L226 Difference]: Without dead ends: 430 [2025-03-08 00:53:53,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=327, Invalid=3579, Unknown=0, NotChecked=0, Total=3906 [2025-03-08 00:53:53,771 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 324 mSDsluCounter, 2969 mSDsCounter, 0 mSdLazyCounter, 1500 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 3126 SdHoareTripleChecker+Invalid, 1585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:53,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 3126 Invalid, 1585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1500 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 00:53:53,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-03-08 00:53:53,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 285. [2025-03-08 00:53:53,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 236 states have (on average 1.2838983050847457) internal successors, (303), 244 states have internal predecessors, (303), 29 states have call successors, (29), 11 states have call predecessors, (29), 19 states have return successors, (49), 29 states have call predecessors, (49), 28 states have call successors, (49) [2025-03-08 00:53:53,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 381 transitions. [2025-03-08 00:53:53,787 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 381 transitions. Word has length 47 [2025-03-08 00:53:53,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:53,787 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 381 transitions. [2025-03-08 00:53:53,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 1.75) internal successors, (49), 25 states have internal predecessors, (49), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-08 00:53:53,787 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 381 transitions. [2025-03-08 00:53:53,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 00:53:53,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:53,788 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] [2025-03-08 00:53:53,794 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-08 00:53:53,992 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,SelfDestructingSolverStorable11 [2025-03-08 00:53:53,992 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:53,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:53,992 INFO L85 PathProgramCache]: Analyzing trace with hash 729591515, now seen corresponding path program 1 times [2025-03-08 00:53:53,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:53,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205150870] [2025-03-08 00:53:53,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:53,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:53,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 00:53:54,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:53:54,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:54,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:54,033 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:53:54,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:54,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205150870] [2025-03-08 00:53:54,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205150870] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:53:54,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238137442] [2025-03-08 00:53:54,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:54,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:54,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:54,035 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-08 00:53:54,036 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-08 00:53:54,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 00:53:54,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:53:54,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:54,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:54,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:53:54,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:54,122 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:53:54,122 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:54,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238137442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:54,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:53:54,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:53:54,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352846549] [2025-03-08 00:53:54,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:54,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:54,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:54,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:54,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:53:54,124 INFO L87 Difference]: Start difference. First operand 285 states and 381 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:53:54,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:54,164 INFO L93 Difference]: Finished difference Result 572 states and 770 transitions. [2025-03-08 00:53:54,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:54,165 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2025-03-08 00:53:54,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:54,167 INFO L225 Difference]: With dead ends: 572 [2025-03-08 00:53:54,167 INFO L226 Difference]: Without dead ends: 290 [2025-03-08 00:53:54,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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-08 00:53:54,169 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 5 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 171 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-08 00:53:54,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 171 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:54,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-08 00:53:54,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 283. [2025-03-08 00:53:54,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 234 states have (on average 1.2820512820512822) internal successors, (300), 242 states have internal predecessors, (300), 29 states have call successors, (29), 11 states have call predecessors, (29), 19 states have return successors, (49), 29 states have call predecessors, (49), 28 states have call successors, (49) [2025-03-08 00:53:54,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 378 transitions. [2025-03-08 00:53:54,184 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 378 transitions. Word has length 46 [2025-03-08 00:53:54,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:54,185 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 378 transitions. [2025-03-08 00:53:54,185 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:53:54,185 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 378 transitions. [2025-03-08 00:53:54,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 00:53:54,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:54,186 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] [2025-03-08 00:53:54,192 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-08 00:53:54,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:54,390 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:54,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:54,391 INFO L85 PathProgramCache]: Analyzing trace with hash 2001654212, now seen corresponding path program 2 times [2025-03-08 00:53:54,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:54,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882234967] [2025-03-08 00:53:54,391 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:53:54,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:54,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-08 00:53:54,404 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:53:54,404 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:53:54,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:54,530 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:53:54,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:54,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882234967] [2025-03-08 00:53:54,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882234967] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:53:54,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803951634] [2025-03-08 00:53:54,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:53:54,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:54,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:54,532 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-08 00:53:54,533 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-08 00:53:54,557 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-08 00:53:54,570 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:53:54,570 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:53:54,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:54,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 00:53:54,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:54,677 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:53:54,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:53:54,946 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:53:54,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803951634] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:53:54,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:53:54,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 13] total 30 [2025-03-08 00:53:54,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972683896] [2025-03-08 00:53:54,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:53:54,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 00:53:54,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:54,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 00:53:54,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2025-03-08 00:53:54,948 INFO L87 Difference]: Start difference. First operand 283 states and 378 transitions. Second operand has 30 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 24 states have internal predecessors, (55), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-08 00:53:55,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:55,934 INFO L93 Difference]: Finished difference Result 451 states and 637 transitions. [2025-03-08 00:53:55,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-08 00:53:55,934 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 24 states have internal predecessors, (55), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) Word has length 47 [2025-03-08 00:53:55,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:55,936 INFO L225 Difference]: With dead ends: 451 [2025-03-08 00:53:55,936 INFO L226 Difference]: Without dead ends: 438 [2025-03-08 00:53:55,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=265, Invalid=2705, Unknown=0, NotChecked=0, Total=2970 [2025-03-08 00:53:55,937 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 341 mSDsluCounter, 2381 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 2538 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:55,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 2538 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:53:55,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-03-08 00:53:55,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 296. [2025-03-08 00:53:55,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 242 states have (on average 1.2727272727272727) internal successors, (308), 250 states have internal predecessors, (308), 33 states have call successors, (33), 12 states have call predecessors, (33), 20 states have return successors, (63), 33 states have call predecessors, (63), 32 states have call successors, (63) [2025-03-08 00:53:55,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 404 transitions. [2025-03-08 00:53:55,952 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 404 transitions. Word has length 47 [2025-03-08 00:53:55,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:55,953 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 404 transitions. [2025-03-08 00:53:55,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 24 states have internal predecessors, (55), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-08 00:53:55,953 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 404 transitions. [2025-03-08 00:53:55,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 00:53:55,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:55,954 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] [2025-03-08 00:53:55,961 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-08 00:53:56,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:56,158 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:56,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:56,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2071166514, now seen corresponding path program 1 times [2025-03-08 00:53:56,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:56,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184135507] [2025-03-08 00:53:56,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:56,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:56,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 00:53:56,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:53:56,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:56,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:56,225 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:53:56,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:56,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184135507] [2025-03-08 00:53:56,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184135507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:56,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:56,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:53:56,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856896490] [2025-03-08 00:53:56,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:56,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:53:56,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:56,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:53:56,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:53:56,226 INFO L87 Difference]: Start difference. First operand 296 states and 404 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:53:56,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:56,280 INFO L93 Difference]: Finished difference Result 595 states and 817 transitions. [2025-03-08 00:53:56,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 00:53:56,281 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-03-08 00:53:56,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:56,282 INFO L225 Difference]: With dead ends: 595 [2025-03-08 00:53:56,282 INFO L226 Difference]: Without dead ends: 302 [2025-03-08 00:53:56,283 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-08 00:53:56,283 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 9 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:56,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 259 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:56,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-08 00:53:56,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 294. [2025-03-08 00:53:56,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 240 states have (on average 1.2666666666666666) internal successors, (304), 248 states have internal predecessors, (304), 33 states have call successors, (33), 12 states have call predecessors, (33), 20 states have return successors, (63), 33 states have call predecessors, (63), 32 states have call successors, (63) [2025-03-08 00:53:56,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 400 transitions. [2025-03-08 00:53:56,299 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 400 transitions. Word has length 46 [2025-03-08 00:53:56,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:56,299 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 400 transitions. [2025-03-08 00:53:56,299 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:53:56,299 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 400 transitions. [2025-03-08 00:53:56,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 00:53:56,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:56,300 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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-08 00:53:56,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 00:53:56,300 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:56,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:56,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1224429724, now seen corresponding path program 1 times [2025-03-08 00:53:56,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:56,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964632426] [2025-03-08 00:53:56,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:56,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:56,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 00:53:56,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:53:56,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:56,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:53:56,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:56,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964632426] [2025-03-08 00:53:56,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964632426] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:53:56,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316176674] [2025-03-08 00:53:56,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:56,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:56,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:56,382 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-08 00:53:56,383 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-08 00:53:56,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 00:53:56,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:53:56,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:56,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:56,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 00:53:56,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:56,448 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:53:56,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:53:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:53:56,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316176674] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:53:56,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:53:56,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 15 [2025-03-08 00:53:56,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866411170] [2025-03-08 00:53:56,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:53:56,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 00:53:56,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:56,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 00:53:56,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:53:56,584 INFO L87 Difference]: Start difference. First operand 294 states and 400 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 00:53:56,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:56,755 INFO L93 Difference]: Finished difference Result 432 states and 583 transitions. [2025-03-08 00:53:56,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 00:53:56,756 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 46 [2025-03-08 00:53:56,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:56,757 INFO L225 Difference]: With dead ends: 432 [2025-03-08 00:53:56,757 INFO L226 Difference]: Without dead ends: 358 [2025-03-08 00:53:56,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-08 00:53:56,758 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 142 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:56,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 872 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:56,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-03-08 00:53:56,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 338. [2025-03-08 00:53:56,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 278 states have (on average 1.2697841726618706) internal successors, (353), 288 states have internal predecessors, (353), 35 states have call successors, (35), 14 states have call predecessors, (35), 24 states have return successors, (64), 35 states have call predecessors, (64), 34 states have call successors, (64) [2025-03-08 00:53:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 452 transitions. [2025-03-08 00:53:56,787 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 452 transitions. Word has length 46 [2025-03-08 00:53:56,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:56,787 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 452 transitions. [2025-03-08 00:53:56,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 00:53:56,787 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 452 transitions. [2025-03-08 00:53:56,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 00:53:56,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:56,788 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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-08 00:53:56,794 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-08 00:53:56,992 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-08 00:53:56,992 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:56,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:56,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1420943229, now seen corresponding path program 1 times [2025-03-08 00:53:56,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:56,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139905363] [2025-03-08 00:53:56,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:56,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:56,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 00:53:57,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:53:57,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:57,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 00:53:57,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:57,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139905363] [2025-03-08 00:53:57,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139905363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:57,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:57,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 00:53:57,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889195106] [2025-03-08 00:53:57,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:57,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:53:57,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:57,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:53:57,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:53:57,124 INFO L87 Difference]: Start difference. First operand 338 states and 452 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:53:57,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:57,195 INFO L93 Difference]: Finished difference Result 344 states and 457 transitions. [2025-03-08 00:53:57,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:53:57,195 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-03-08 00:53:57,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:57,197 INFO L225 Difference]: With dead ends: 344 [2025-03-08 00:53:57,197 INFO L226 Difference]: Without dead ends: 342 [2025-03-08 00:53:57,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:53:57,197 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 14 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:57,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 478 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:57,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-03-08 00:53:57,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2025-03-08 00:53:57,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 281 states have (on average 1.2669039145907472) internal successors, (356), 291 states have internal predecessors, (356), 35 states have call successors, (35), 15 states have call predecessors, (35), 25 states have return successors, (64), 35 states have call predecessors, (64), 34 states have call successors, (64) [2025-03-08 00:53:57,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 455 transitions. [2025-03-08 00:53:57,212 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 455 transitions. Word has length 46 [2025-03-08 00:53:57,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:57,212 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 455 transitions. [2025-03-08 00:53:57,212 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:53:57,212 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 455 transitions. [2025-03-08 00:53:57,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 00:53:57,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:57,213 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] [2025-03-08 00:53:57,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 00:53:57,213 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:57,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:57,213 INFO L85 PathProgramCache]: Analyzing trace with hash 278691272, now seen corresponding path program 1 times [2025-03-08 00:53:57,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:57,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96163170] [2025-03-08 00:53:57,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:57,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:57,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 00:53:57,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 00:53:57,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:57,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:57,302 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:53:57,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:57,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96163170] [2025-03-08 00:53:57,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96163170] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:53:57,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865110150] [2025-03-08 00:53:57,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:57,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:57,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:57,304 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-08 00:53:57,306 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-08 00:53:57,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 00:53:57,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 00:53:57,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:57,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:57,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 00:53:57,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:57,430 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:53:57,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:53:57,636 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:53:57,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865110150] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:53:57,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:53:57,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 10] total 23 [2025-03-08 00:53:57,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259540086] [2025-03-08 00:53:57,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:53:57,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 00:53:57,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:57,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 00:53:57,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2025-03-08 00:53:57,637 INFO L87 Difference]: Start difference. First operand 342 states and 455 transitions. Second operand has 23 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-08 00:53:58,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:58,045 INFO L93 Difference]: Finished difference Result 440 states and 615 transitions. [2025-03-08 00:53:58,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 00:53:58,045 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) Word has length 49 [2025-03-08 00:53:58,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:58,047 INFO L225 Difference]: With dead ends: 440 [2025-03-08 00:53:58,047 INFO L226 Difference]: Without dead ends: 402 [2025-03-08 00:53:58,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2025-03-08 00:53:58,048 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 232 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:58,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1339 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:53:58,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-08 00:53:58,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 338. [2025-03-08 00:53:58,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 276 states have (on average 1.2644927536231885) internal successors, (349), 288 states have internal predecessors, (349), 36 states have call successors, (36), 13 states have call predecessors, (36), 25 states have return successors, (77), 36 states have call predecessors, (77), 35 states have call successors, (77) [2025-03-08 00:53:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 462 transitions. [2025-03-08 00:53:58,064 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 462 transitions. Word has length 49 [2025-03-08 00:53:58,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:58,064 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 462 transitions. [2025-03-08 00:53:58,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-08 00:53:58,064 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 462 transitions. [2025-03-08 00:53:58,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 00:53:58,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:58,065 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, 1, 1, 1, 1, 1] [2025-03-08 00:53:58,071 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-08 00:53:58,269 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,SelfDestructingSolverStorable17 [2025-03-08 00:53:58,269 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:58,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:58,271 INFO L85 PathProgramCache]: Analyzing trace with hash 650215829, now seen corresponding path program 1 times [2025-03-08 00:53:58,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:58,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532488932] [2025-03-08 00:53:58,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:58,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:58,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 00:53:58,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 00:53:58,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:58,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:58,324 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:53:58,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:58,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532488932] [2025-03-08 00:53:58,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532488932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:58,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:58,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 00:53:58,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342687767] [2025-03-08 00:53:58,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:58,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 00:53:58,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:58,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 00:53:58,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:53:58,325 INFO L87 Difference]: Start difference. First operand 338 states and 462 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 00:53:58,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:58,379 INFO L93 Difference]: Finished difference Result 379 states and 526 transitions. [2025-03-08 00:53:58,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 00:53:58,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 53 [2025-03-08 00:53:58,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:58,381 INFO L225 Difference]: With dead ends: 379 [2025-03-08 00:53:58,381 INFO L226 Difference]: Without dead ends: 377 [2025-03-08 00:53:58,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-08 00:53:58,381 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 11 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:58,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 329 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:58,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-08 00:53:58,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 357. [2025-03-08 00:53:58,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 289 states have (on average 1.28719723183391) internal successors, (372), 306 states have internal predecessors, (372), 41 states have call successors, (41), 14 states have call predecessors, (41), 26 states have return successors, (82), 36 states have call predecessors, (82), 40 states have call successors, (82) [2025-03-08 00:53:58,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 495 transitions. [2025-03-08 00:53:58,400 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 495 transitions. Word has length 53 [2025-03-08 00:53:58,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:58,401 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 495 transitions. [2025-03-08 00:53:58,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 00:53:58,401 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 495 transitions. [2025-03-08 00:53:58,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 00:53:58,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:58,401 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, 1, 1, 1, 1, 1, 1] [2025-03-08 00:53:58,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 00:53:58,402 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:58,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:58,402 INFO L85 PathProgramCache]: Analyzing trace with hash -851563448, now seen corresponding path program 1 times [2025-03-08 00:53:58,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:58,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320843879] [2025-03-08 00:53:58,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:58,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:58,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 00:53:58,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 00:53:58,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:58,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:53:58,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:58,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320843879] [2025-03-08 00:53:58,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320843879] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:53:58,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083798100] [2025-03-08 00:53:58,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:58,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:58,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:58,594 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-08 00:53:58,595 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-08 00:53:58,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 00:53:58,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 00:53:58,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:58,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:58,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 00:53:58,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:58,671 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:53:58,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:53:58,908 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:53:58,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083798100] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:53:58,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:53:58,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-08 00:53:58,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664069893] [2025-03-08 00:53:58,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:53:58,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 00:53:58,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:58,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 00:53:58,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:53:58,910 INFO L87 Difference]: Start difference. First operand 357 states and 495 transitions. Second operand has 25 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 21 states have internal predecessors, (53), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 00:53:59,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:59,434 INFO L93 Difference]: Finished difference Result 429 states and 613 transitions. [2025-03-08 00:53:59,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 00:53:59,434 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 21 states have internal predecessors, (53), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 54 [2025-03-08 00:53:59,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:59,436 INFO L225 Difference]: With dead ends: 429 [2025-03-08 00:53:59,436 INFO L226 Difference]: Without dead ends: 397 [2025-03-08 00:53:59,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 00:53:59,438 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 137 mSDsluCounter, 1783 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:59,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1897 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:53:59,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-08 00:53:59,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 343. [2025-03-08 00:53:59,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 279 states have (on average 1.2974910394265233) internal successors, (362), 295 states have internal predecessors, (362), 39 states have call successors, (39), 12 states have call predecessors, (39), 24 states have return successors, (78), 35 states have call predecessors, (78), 38 states have call successors, (78) [2025-03-08 00:53:59,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 479 transitions. [2025-03-08 00:53:59,457 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 479 transitions. Word has length 54 [2025-03-08 00:53:59,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:59,457 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 479 transitions. [2025-03-08 00:53:59,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 21 states have internal predecessors, (53), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 00:53:59,457 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 479 transitions. [2025-03-08 00:53:59,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 00:53:59,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:59,459 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, 1, 1, 1, 1, 1, 1] [2025-03-08 00:53:59,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 00:53:59,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:59,659 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:59,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:59,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1175175522, now seen corresponding path program 1 times [2025-03-08 00:53:59,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:59,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453755759] [2025-03-08 00:53:59,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:59,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:59,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 00:53:59,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 00:53:59,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:59,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:59,746 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:53:59,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:59,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453755759] [2025-03-08 00:53:59,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453755759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:59,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:59,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 00:53:59,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451668499] [2025-03-08 00:53:59,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:59,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 00:53:59,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:59,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 00:53:59,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:53:59,749 INFO L87 Difference]: Start difference. First operand 343 states and 479 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:53:59,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:59,908 INFO L93 Difference]: Finished difference Result 725 states and 1074 transitions. [2025-03-08 00:53:59,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:53:59,908 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2025-03-08 00:53:59,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:59,910 INFO L225 Difference]: With dead ends: 725 [2025-03-08 00:53:59,910 INFO L226 Difference]: Without dead ends: 520 [2025-03-08 00:53:59,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:53:59,913 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 25 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:59,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 631 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:59,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-03-08 00:53:59,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 410. [2025-03-08 00:53:59,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 340 states have (on average 1.2794117647058822) internal successors, (435), 356 states have internal predecessors, (435), 45 states have call successors, (45), 12 states have call predecessors, (45), 24 states have return successors, (84), 41 states have call predecessors, (84), 44 states have call successors, (84) [2025-03-08 00:53:59,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 564 transitions. [2025-03-08 00:53:59,931 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 564 transitions. Word has length 54 [2025-03-08 00:53:59,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:59,931 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 564 transitions. [2025-03-08 00:53:59,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:53:59,931 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 564 transitions. [2025-03-08 00:53:59,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 00:53:59,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:59,932 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, 1, 1, 1, 1, 1, 1] [2025-03-08 00:53:59,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 00:53:59,932 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:59,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:59,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1863686480, now seen corresponding path program 2 times [2025-03-08 00:53:59,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:59,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053908129] [2025-03-08 00:53:59,933 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:53:59,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:59,936 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-08 00:53:59,954 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 00:53:59,954 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:53:59,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:00,515 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:54:00,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:00,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053908129] [2025-03-08 00:54:00,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053908129] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:54:00,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925792733] [2025-03-08 00:54:00,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:54:00,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:00,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:00,517 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-08 00:54:00,519 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-08 00:54:00,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-08 00:54:00,567 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 00:54:00,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:54:00,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:00,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 00:54:00,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:01,301 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:54:01,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:02,296 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:54:02,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925792733] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:54:02,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:54:02,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18, 14] total 47 [2025-03-08 00:54:02,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130206995] [2025-03-08 00:54:02,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:54:02,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-08 00:54:02,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:02,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-08 00:54:02,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=2030, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 00:54:02,298 INFO L87 Difference]: Start difference. First operand 410 states and 564 transitions. Second operand has 47 states, 41 states have (on average 1.853658536585366) internal successors, (76), 39 states have internal predecessors, (76), 8 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (13), 10 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-08 00:54:04,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:04,796 INFO L93 Difference]: Finished difference Result 603 states and 941 transitions. [2025-03-08 00:54:04,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-08 00:54:04,799 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 41 states have (on average 1.853658536585366) internal successors, (76), 39 states have internal predecessors, (76), 8 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (13), 10 states have call predecessors, (13), 7 states have call successors, (13) Word has length 54 [2025-03-08 00:54:04,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:04,802 INFO L225 Difference]: With dead ends: 603 [2025-03-08 00:54:04,802 INFO L226 Difference]: Without dead ends: 549 [2025-03-08 00:54:04,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1340 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=367, Invalid=5333, Unknown=0, NotChecked=0, Total=5700 [2025-03-08 00:54:04,805 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 135 mSDsluCounter, 3231 mSDsCounter, 0 mSdLazyCounter, 2187 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 3346 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:04,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 3346 Invalid, 2219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2187 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 00:54:04,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-08 00:54:04,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 402. [2025-03-08 00:54:04,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 333 states have (on average 1.2852852852852852) internal successors, (428), 351 states have internal predecessors, (428), 44 states have call successors, (44), 10 states have call predecessors, (44), 24 states have return successors, (83), 40 states have call predecessors, (83), 43 states have call successors, (83) [2025-03-08 00:54:04,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 555 transitions. [2025-03-08 00:54:04,836 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 555 transitions. Word has length 54 [2025-03-08 00:54:04,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:04,836 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 555 transitions. [2025-03-08 00:54:04,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 41 states have (on average 1.853658536585366) internal successors, (76), 39 states have internal predecessors, (76), 8 states have call successors, (12), 2 states have call predecessors, (12), 9 states have return successors, (13), 10 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-08 00:54:04,836 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 555 transitions. [2025-03-08 00:54:04,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 00:54:04,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:04,838 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:04,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 00:54:05,042 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,SelfDestructingSolverStorable21 [2025-03-08 00:54:05,042 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:05,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:05,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2136949137, now seen corresponding path program 1 times [2025-03-08 00:54:05,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:05,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651705537] [2025-03-08 00:54:05,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:05,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:05,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 00:54:05,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 00:54:05,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:05,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:05,117 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:54:05,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:05,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651705537] [2025-03-08 00:54:05,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651705537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:05,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:05,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 00:54:05,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507534357] [2025-03-08 00:54:05,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:05,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 00:54:05,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:05,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 00:54:05,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:54:05,118 INFO L87 Difference]: Start difference. First operand 402 states and 555 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 00:54:05,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:05,197 INFO L93 Difference]: Finished difference Result 453 states and 633 transitions. [2025-03-08 00:54:05,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:54:05,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2025-03-08 00:54:05,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:05,200 INFO L225 Difference]: With dead ends: 453 [2025-03-08 00:54:05,200 INFO L226 Difference]: Without dead ends: 451 [2025-03-08 00:54:05,200 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-08 00:54:05,200 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 11 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:05,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 430 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:54:05,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-03-08 00:54:05,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2025-03-08 00:54:05,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 338 states have (on average 1.2958579881656804) internal successors, (438), 356 states have internal predecessors, (438), 44 states have call successors, (44), 10 states have call predecessors, (44), 24 states have return successors, (83), 40 states have call predecessors, (83), 43 states have call successors, (83) [2025-03-08 00:54:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 565 transitions. [2025-03-08 00:54:05,221 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 565 transitions. Word has length 55 [2025-03-08 00:54:05,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:05,221 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 565 transitions. [2025-03-08 00:54:05,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 00:54:05,221 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 565 transitions. [2025-03-08 00:54:05,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 00:54:05,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:05,223 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:05,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 00:54:05,224 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:05,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:05,224 INFO L85 PathProgramCache]: Analyzing trace with hash 580652507, now seen corresponding path program 1 times [2025-03-08 00:54:05,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:05,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155000149] [2025-03-08 00:54:05,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:05,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:05,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 00:54:05,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 00:54:05,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:05,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:05,341 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:54:05,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:05,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155000149] [2025-03-08 00:54:05,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155000149] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:54:05,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103462914] [2025-03-08 00:54:05,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:05,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:05,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:05,343 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-08 00:54:05,344 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-08 00:54:05,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 00:54:05,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 00:54:05,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:05,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:05,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 00:54:05,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:05,427 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:54:05,427 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:54:05,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103462914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:05,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:54:05,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-08 00:54:05,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615780358] [2025-03-08 00:54:05,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:05,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 00:54:05,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:05,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 00:54:05,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:54:05,428 INFO L87 Difference]: Start difference. First operand 407 states and 565 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:54:05,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:05,500 INFO L93 Difference]: Finished difference Result 707 states and 987 transitions. [2025-03-08 00:54:05,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:54:05,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2025-03-08 00:54:05,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:05,502 INFO L225 Difference]: With dead ends: 707 [2025-03-08 00:54:05,502 INFO L226 Difference]: Without dead ends: 515 [2025-03-08 00:54:05,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:54:05,503 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 18 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:05,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 404 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:05,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-08 00:54:05,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 402. [2025-03-08 00:54:05,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 333 states have (on average 1.2852852852852852) internal successors, (428), 351 states have internal predecessors, (428), 44 states have call successors, (44), 10 states have call predecessors, (44), 24 states have return successors, (83), 40 states have call predecessors, (83), 43 states have call successors, (83) [2025-03-08 00:54:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 555 transitions. [2025-03-08 00:54:05,524 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 555 transitions. Word has length 55 [2025-03-08 00:54:05,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:05,524 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 555 transitions. [2025-03-08 00:54:05,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:54:05,524 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 555 transitions. [2025-03-08 00:54:05,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 00:54:05,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:05,526 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:05,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-08 00:54:05,726 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,SelfDestructingSolverStorable23 [2025-03-08 00:54:05,726 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:05,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:05,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1135103698, now seen corresponding path program 1 times [2025-03-08 00:54:05,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:05,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659042895] [2025-03-08 00:54:05,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:05,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:05,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 00:54:05,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 00:54:05,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:05,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:05,836 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:54:05,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:05,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659042895] [2025-03-08 00:54:05,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659042895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:54:05,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025273158] [2025-03-08 00:54:05,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:05,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:05,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:05,839 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-08 00:54:05,840 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-08 00:54:05,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 00:54:05,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 00:54:05,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:05,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:05,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 00:54:05,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:05,988 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:54:05,989 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:54:05,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025273158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:05,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:54:05,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 16 [2025-03-08 00:54:05,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092933537] [2025-03-08 00:54:05,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:05,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 00:54:05,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:05,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 00:54:05,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:54:05,990 INFO L87 Difference]: Start difference. First operand 402 states and 555 transitions. Second operand has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 00:54:06,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:06,161 INFO L93 Difference]: Finished difference Result 520 states and 712 transitions. [2025-03-08 00:54:06,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 00:54:06,161 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 56 [2025-03-08 00:54:06,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:06,163 INFO L225 Difference]: With dead ends: 520 [2025-03-08 00:54:06,163 INFO L226 Difference]: Without dead ends: 416 [2025-03-08 00:54:06,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:54:06,164 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 61 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:06,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 956 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:54:06,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-03-08 00:54:06,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 400. [2025-03-08 00:54:06,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 331 states have (on average 1.2749244712990937) internal successors, (422), 349 states have internal predecessors, (422), 44 states have call successors, (44), 10 states have call predecessors, (44), 24 states have return successors, (83), 40 states have call predecessors, (83), 43 states have call successors, (83) [2025-03-08 00:54:06,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 549 transitions. [2025-03-08 00:54:06,188 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 549 transitions. Word has length 56 [2025-03-08 00:54:06,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:06,188 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 549 transitions. [2025-03-08 00:54:06,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 00:54:06,189 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 549 transitions. [2025-03-08 00:54:06,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 00:54:06,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:06,190 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:06,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-08 00:54:06,390 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,SelfDestructingSolverStorable24 [2025-03-08 00:54:06,390 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:06,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:06,391 INFO L85 PathProgramCache]: Analyzing trace with hash -38964476, now seen corresponding path program 1 times [2025-03-08 00:54:06,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:06,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427574573] [2025-03-08 00:54:06,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:06,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:06,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 00:54:06,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 00:54:06,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:06,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:06,501 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:54:06,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:06,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427574573] [2025-03-08 00:54:06,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427574573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:06,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:06,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 00:54:06,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920923486] [2025-03-08 00:54:06,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:06,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 00:54:06,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:06,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 00:54:06,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:54:06,503 INFO L87 Difference]: Start difference. First operand 400 states and 549 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:54:06,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:06,611 INFO L93 Difference]: Finished difference Result 642 states and 876 transitions. [2025-03-08 00:54:06,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:54:06,611 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2025-03-08 00:54:06,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:06,613 INFO L225 Difference]: With dead ends: 642 [2025-03-08 00:54:06,613 INFO L226 Difference]: Without dead ends: 393 [2025-03-08 00:54:06,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:54:06,614 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 58 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:06,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 692 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:54:06,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-08 00:54:06,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 378. [2025-03-08 00:54:06,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 311 states have (on average 1.2765273311897105) internal successors, (397), 329 states have internal predecessors, (397), 42 states have call successors, (42), 10 states have call predecessors, (42), 24 states have return successors, (81), 38 states have call predecessors, (81), 41 states have call successors, (81) [2025-03-08 00:54:06,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 520 transitions. [2025-03-08 00:54:06,634 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 520 transitions. Word has length 57 [2025-03-08 00:54:06,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:06,634 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 520 transitions. [2025-03-08 00:54:06,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:54:06,634 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 520 transitions. [2025-03-08 00:54:06,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 00:54:06,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:06,636 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:06,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 00:54:06,636 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:06,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:06,636 INFO L85 PathProgramCache]: Analyzing trace with hash -315226241, now seen corresponding path program 1 times [2025-03-08 00:54:06,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:06,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983879344] [2025-03-08 00:54:06,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:06,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:06,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 00:54:06,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 00:54:06,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:06,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:06,725 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:54:06,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:54:06,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983879344] [2025-03-08 00:54:06,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983879344] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:54:06,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874115192] [2025-03-08 00:54:06,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:06,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:06,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:06,728 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-08 00:54:06,730 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-08 00:54:06,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 00:54:06,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 00:54:06,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:06,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:06,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 00:54:06,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:06,842 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 00:54:06,842 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:54:06,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874115192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:06,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:54:06,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 14 [2025-03-08 00:54:06,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220261067] [2025-03-08 00:54:06,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:06,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:54:06,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:54:06,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:54:06,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:54:06,843 INFO L87 Difference]: Start difference. First operand 378 states and 520 transitions. Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 00:54:06,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:06,959 INFO L93 Difference]: Finished difference Result 494 states and 672 transitions. [2025-03-08 00:54:06,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 00:54:06,959 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 57 [2025-03-08 00:54:06,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:06,961 INFO L225 Difference]: With dead ends: 494 [2025-03-08 00:54:06,961 INFO L226 Difference]: Without dead ends: 383 [2025-03-08 00:54:06,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:54:06,962 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 60 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:06,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 664 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:54:06,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-08 00:54:06,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 367. [2025-03-08 00:54:06,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 301 states have (on average 1.2757475083056478) internal successors, (384), 319 states have internal predecessors, (384), 41 states have call successors, (41), 10 states have call predecessors, (41), 24 states have return successors, (80), 37 states have call predecessors, (80), 40 states have call successors, (80) [2025-03-08 00:54:06,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 505 transitions. [2025-03-08 00:54:06,980 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 505 transitions. Word has length 57 [2025-03-08 00:54:06,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:06,980 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 505 transitions. [2025-03-08 00:54:06,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 00:54:06,980 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 505 transitions. [2025-03-08 00:54:06,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 00:54:06,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:06,982 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:06,988 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-08 00:54:07,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:07,186 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:07,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:07,186 INFO L85 PathProgramCache]: Analyzing trace with hash 447771348, now seen corresponding path program 1 times [2025-03-08 00:54:07,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:54:07,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560893988] [2025-03-08 00:54:07,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:07,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:54:07,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 00:54:07,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 00:54:07,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:07,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 00:54:07,200 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 00:54:07,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 00:54:07,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 00:54:07,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:07,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 00:54:07,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 00:54:07,236 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 00:54:07,236 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 00:54:07,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 00:54:07,240 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:07,266 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 00:54:07,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:54:07 BoogieIcfgContainer [2025-03-08 00:54:07,269 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 00:54:07,270 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 00:54:07,270 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 00:54:07,270 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 00:54:07,270 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:53:46" (3/4) ... [2025-03-08 00:54:07,272 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 00:54:07,272 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 00:54:07,273 INFO L158 Benchmark]: Toolchain (without parser) took 21289.23ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 105.1MB in the beginning and 123.3MB in the end (delta: -18.2MB). Peak memory consumption was 204.8MB. Max. memory is 16.1GB. [2025-03-08 00:54:07,273 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory was 125.3MB in the beginning and 125.0MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:54:07,273 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.00ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 92.0MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 00:54:07,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.43ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 89.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:54:07,274 INFO L158 Benchmark]: Boogie Preprocessor took 43.88ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 88.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:54:07,274 INFO L158 Benchmark]: IcfgBuilder took 374.18ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 67.9MB in the end (delta: 20.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 00:54:07,274 INFO L158 Benchmark]: TraceAbstraction took 20597.52ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 66.8MB in the beginning and 123.4MB in the end (delta: -56.5MB). Peak memory consumption was 162.9MB. Max. memory is 16.1GB. [2025-03-08 00:54:07,274 INFO L158 Benchmark]: Witness Printer took 2.55ms. Allocated memory is still 369.1MB. Free memory was 123.4MB in the beginning and 123.3MB in the end (delta: 115.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:54:07,284 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.23ms. Allocated memory is still 201.3MB. Free memory was 125.3MB in the beginning and 125.0MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.00ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 92.0MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.43ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 89.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.88ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 88.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 374.18ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 67.9MB in the end (delta: 20.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20597.52ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 66.8MB in the beginning and 123.4MB in the end (delta: -56.5MB). Peak memory consumption was 162.9MB. Max. memory is 16.1GB. * Witness Printer took 2.55ms. Allocated memory is still 369.1MB. Free memory was 123.4MB in the beginning and 123.3MB in the end (delta: 115.4kB). 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: 18]: 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 114, overapproximation of bitwiseOr at line 111, overapproximation of bitwiseAnd at line 127. Possible FailurePath: [L227] unsigned int a ; [L228] unsigned int ma = __VERIFIER_nondet_uint(); [L229] signed char ea = __VERIFIER_nondet_char(); [L230] unsigned int b ; [L231] unsigned int mb = __VERIFIER_nondet_uint(); [L232] signed char eb = __VERIFIER_nondet_char(); [L233] unsigned int r_add1 ; [L234] unsigned int r_add2 ; [L235] unsigned int zero ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int __retres14 ; VAL [ea=127, eb=127] [L242] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L30] COND TRUE ! m [L31] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L81] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L242] RET, EXPR base2flt(0, 0) VAL [ea=127, eb=127] [L242] zero = base2flt(0, 0) [L243] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=4328521728] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L30] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L60] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L65] COND TRUE e >= 127 [L66] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=4328521728, __retres4=4294967295, m=4328521728] [L81] return (__retres4); VAL [\old(e)=127, \old(m)=4328521728, \result=4294967295, m=4328521728] [L243] RET, EXPR base2flt(ma, ea) VAL [ea=127, eb=127, ma=4328521728] [L243] a = base2flt(ma, ea) [L244] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=127, \old(m)=33554432] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L30] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L60] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L65] COND TRUE e >= 127 [L66] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, m=33554432] [L81] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, m=33554432] [L244] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432] [L244] b = base2flt(mb, eb) [L245] CALL addflt(a, b) VAL [\old(a)=4294967295, \old(b)=4294967295] [L85] unsigned int res ; [L86] unsigned int ma ; [L87] unsigned int mb ; [L88] unsigned int delta ; [L89] int ea ; [L90] int eb ; [L91] unsigned int tmp ; [L92] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295] [L95] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295] [L102] COND FALSE !(! b) [L109] ma = a & ((1U << 24U) - 1U) [L110] ea = (int )(a >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=127, ma=16777215] [L111] EXPR ma | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=127] [L111] ma = ma | (1U << 24U) [L112] mb = b & ((1U << 24U) - 1U) [L113] eb = (int )(b >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, eb=127, ma=16777217, mb=16777215] [L114] EXPR mb | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, eb=127, ma=16777217] [L114] mb = mb | (1U << 24U) [L115] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L17] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L115] RET __VERIFIER_assert(ea >= eb) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, eb=127, ma=16777217, mb=-4278190080] [L116] delta = ea - eb VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, delta=0, ea=127, ma=16777217, mb=-4278190080] [L117] COND FALSE !(!(delta < sizeof(mb) * 8)) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, delta=0, ea=127, ma=16777217, mb=-4278190080] [L118] EXPR mb >> delta VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, ma=16777217] [L118] mb = mb >> delta [L120] COND FALSE !(! mb) [L126] ma = ma + mb VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, ma=-4261412863] [L127] ma & (1U << 25U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, ma=-4261412863] [L127] COND FALSE !(ma & (1U << 25U)) [L140] CALL __VERIFIER_assert(ma < 1U << 25U) VAL [\old(cond)=0] [L17] COND TRUE !(cond) VAL [\old(cond)=0] [L18] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 76 locations, 118 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.5s, OverallIterations: 28, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2152 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1988 mSDsluCounter, 26773 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24042 mSDsCounter, 291 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9389 IncrementalHoareTripleChecker+Invalid, 9680 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 291 mSolverCounterUnsat, 2731 mSDtfsCounter, 9389 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1448 GetRequests, 975 SyntacticMatches, 4 SemanticMatches, 469 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3010 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=410occurred in iteration=21, InterpolantAutomatonStates: 373, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 1117 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 2015 NumberOfCodeBlocks, 1998 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 2285 ConstructedInterpolants, 1 QuantifiedInterpolants, 5510 SizeOfPredicates, 24 NumberOfNonLiveVariables, 2100 ConjunctsInSsa, 330 ConjunctsInUnsatCore, 49 InterpolantComputations, 19 PerfectInterpolantSequences, 800/930 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-08 00:54:07,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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_4-2a.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 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:54:09,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:54:09,202 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 00:54:09,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:54:09,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:54:09,228 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:54:09,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:54:09,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:54:09,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:54:09,230 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:54:09,230 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:54:09,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:54:09,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:54:09,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:54:09,231 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:54:09,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:54:09,231 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:54:09,231 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:54:09,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:54:09,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:54:09,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:54:09,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:54:09,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:54:09,232 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 00:54:09,232 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 00:54:09,232 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 00:54:09,232 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:54:09,233 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:54:09,233 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:54:09,233 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:54:09,233 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:54:09,233 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:54:09,233 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:54:09,233 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:54:09,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:54:09,234 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:54:09,234 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:54:09,234 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:54:09,234 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:54:09,234 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 00:54:09,234 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 00:54:09,234 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:54:09,234 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:54:09,234 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:54:09,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:54:09,235 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 -> 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b [2025-03-08 00:54:09,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:54:09,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:54:09,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:54:09,484 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:54:09,484 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:54:09,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2025-03-08 00:54:10,639 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33996b9e6/f724b705080c4fa28cba5eb852105006/FLAG15a9671cb [2025-03-08 00:54:10,816 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:54:10,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2025-03-08 00:54:10,824 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33996b9e6/f724b705080c4fa28cba5eb852105006/FLAG15a9671cb [2025-03-08 00:54:10,842 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33996b9e6/f724b705080c4fa28cba5eb852105006 [2025-03-08 00:54:10,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:54:10,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:54:10,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:54:10,849 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:54:10,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:54:10,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:54:10" (1/1) ... [2025-03-08 00:54:10,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@275aee97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:10, skipping insertion in model container [2025-03-08 00:54:10,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:54:10" (1/1) ... [2025-03-08 00:54:10,873 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:54:10,978 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_4-2a.c.cil.c[755,768] [2025-03-08 00:54:11,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:54:11,033 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:54:11,041 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_4-2a.c.cil.c[755,768] [2025-03-08 00:54:11,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:54:11,074 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:54:11,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:11 WrapperNode [2025-03-08 00:54:11,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:54:11,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:54:11,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:54:11,077 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:54:11,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:11" (1/1) ... [2025-03-08 00:54:11,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:11" (1/1) ... [2025-03-08 00:54:11,100 INFO L138 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2025-03-08 00:54:11,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:54:11,102 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:54:11,102 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:54:11,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:54:11,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:11" (1/1) ... [2025-03-08 00:54:11,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:11" (1/1) ... [2025-03-08 00:54:11,115 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:11" (1/1) ... [2025-03-08 00:54:11,129 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-08 00:54:11,131 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:11" (1/1) ... [2025-03-08 00:54:11,131 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:11" (1/1) ... [2025-03-08 00:54:11,138 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:11" (1/1) ... [2025-03-08 00:54:11,142 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:11" (1/1) ... [2025-03-08 00:54:11,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:11" (1/1) ... [2025-03-08 00:54:11,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:11" (1/1) ... [2025-03-08 00:54:11,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:54:11,148 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:54:11,148 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:54:11,148 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:54:11,150 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:11" (1/1) ... [2025-03-08 00:54:11,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:54:11,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:11,174 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-08 00:54:11,177 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-08 00:54:11,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:54:11,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 00:54:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-03-08 00:54:11,199 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-03-08 00:54:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:54:11,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:54:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2025-03-08 00:54:11,199 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2025-03-08 00:54:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 00:54:11,199 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 00:54:11,257 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:54:11,259 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:54:11,480 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-03-08 00:54:11,481 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:54:11,492 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:54:11,492 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:54:11,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:54:11 BoogieIcfgContainer [2025-03-08 00:54:11,492 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:54:11,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:54:11,494 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:54:11,497 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:54:11,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:54:10" (1/3) ... [2025-03-08 00:54:11,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5b11ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:54:11, skipping insertion in model container [2025-03-08 00:54:11,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:54:11" (2/3) ... [2025-03-08 00:54:11,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5b11ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:54:11, skipping insertion in model container [2025-03-08 00:54:11,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:54:11" (3/3) ... [2025-03-08 00:54:11,499 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2025-03-08 00:54:11,511 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:54:11,512 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_4-2a.c.cil.c that has 4 procedures, 52 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 00:54:11,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:54:11,555 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;@66543c23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:54:11,555 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:54:11,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 40 states have internal predecessors, (57), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 00:54:11,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 00:54:11,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:11,564 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] [2025-03-08 00:54:11,564 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:11,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:11,569 INFO L85 PathProgramCache]: Analyzing trace with hash -825298589, now seen corresponding path program 1 times [2025-03-08 00:54:11,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:11,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1036217457] [2025-03-08 00:54:11,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:11,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:11,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:11,580 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-08 00:54:11,582 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-08 00:54:11,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 00:54:11,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:54:11,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:11,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:11,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 00:54:11,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:11,797 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-08 00:54:11,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:11,870 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-08 00:54:11,870 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:11,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036217457] [2025-03-08 00:54:11,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036217457] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:54:11,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:54:11,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2025-03-08 00:54:11,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375034263] [2025-03-08 00:54:11,872 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:54:11,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 00:54:11,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:11,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 00:54:11,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:54:11,890 INFO L87 Difference]: Start difference. First operand has 52 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 40 states have internal predecessors, (57), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:54:12,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:12,039 INFO L93 Difference]: Finished difference Result 124 states and 188 transitions. [2025-03-08 00:54:12,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:54:12,041 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2025-03-08 00:54:12,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:12,046 INFO L225 Difference]: With dead ends: 124 [2025-03-08 00:54:12,046 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 00:54:12,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:54:12,050 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 15 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:12,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 486 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:54:12,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 00:54:12,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2025-03-08 00:54:12,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 47 states have internal predecessors, (60), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) [2025-03-08 00:54:12,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2025-03-08 00:54:12,078 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 31 [2025-03-08 00:54:12,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:12,078 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2025-03-08 00:54:12,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:54:12,078 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2025-03-08 00:54:12,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 00:54:12,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:12,080 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] [2025-03-08 00:54:12,086 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-08 00:54:12,281 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-08 00:54:12,281 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:12,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:12,282 INFO L85 PathProgramCache]: Analyzing trace with hash 2128293921, now seen corresponding path program 1 times [2025-03-08 00:54:12,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:12,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1260243958] [2025-03-08 00:54:12,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:12,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:12,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:12,284 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-08 00:54:12,285 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-08 00:54:12,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 00:54:12,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:54:12,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:12,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:12,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 00:54:12,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:12,487 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-08 00:54:12,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:12,605 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-08 00:54:12,606 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:12,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260243958] [2025-03-08 00:54:12,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260243958] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 00:54:12,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:54:12,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 16 [2025-03-08 00:54:12,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324237388] [2025-03-08 00:54:12,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:12,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 00:54:12,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:12,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 00:54:12,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:54:12,608 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:54:12,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:12,695 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2025-03-08 00:54:12,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:54:12,696 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2025-03-08 00:54:12,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:12,697 INFO L225 Difference]: With dead ends: 125 [2025-03-08 00:54:12,697 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 00:54:12,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:54:12,698 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 24 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:12,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 479 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:54:12,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 00:54:12,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2025-03-08 00:54:12,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.296875) internal successors, (83), 66 states have internal predecessors, (83), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-08 00:54:12,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 114 transitions. [2025-03-08 00:54:12,709 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 114 transitions. Word has length 34 [2025-03-08 00:54:12,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:12,709 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 114 transitions. [2025-03-08 00:54:12,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:54:12,709 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 114 transitions. [2025-03-08 00:54:12,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 00:54:12,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:12,712 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] [2025-03-08 00:54:12,718 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-08 00:54:12,913 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-08 00:54:12,913 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:12,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:12,913 INFO L85 PathProgramCache]: Analyzing trace with hash -2138044224, now seen corresponding path program 1 times [2025-03-08 00:54:12,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:12,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1844073955] [2025-03-08 00:54:12,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:12,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:12,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:12,915 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-08 00:54:12,917 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-08 00:54:12,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 00:54:12,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:54:12,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:12,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:12,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 00:54:12,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:13,025 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-08 00:54:13,025 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:54:13,025 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:13,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844073955] [2025-03-08 00:54:13,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844073955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:13,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:13,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 00:54:13,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917479778] [2025-03-08 00:54:13,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:13,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 00:54:13,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:13,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 00:54:13,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:54:13,027 INFO L87 Difference]: Start difference. First operand 86 states and 114 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:54:13,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:13,085 INFO L93 Difference]: Finished difference Result 124 states and 163 transitions. [2025-03-08 00:54:13,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:54:13,088 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2025-03-08 00:54:13,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:13,089 INFO L225 Difference]: With dead ends: 124 [2025-03-08 00:54:13,089 INFO L226 Difference]: Without dead ends: 84 [2025-03-08 00:54:13,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:54:13,090 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 12 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:13,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 405 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:13,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-08 00:54:13,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 69. [2025-03-08 00:54:13,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 53 states have internal predecessors, (66), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2025-03-08 00:54:13,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2025-03-08 00:54:13,102 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 34 [2025-03-08 00:54:13,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:13,102 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2025-03-08 00:54:13,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:54:13,102 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2025-03-08 00:54:13,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 00:54:13,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:13,103 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] [2025-03-08 00:54:13,111 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-08 00:54:13,309 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-08 00:54:13,309 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:13,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:13,309 INFO L85 PathProgramCache]: Analyzing trace with hash -512092799, now seen corresponding path program 2 times [2025-03-08 00:54:13,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:13,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [634467192] [2025-03-08 00:54:13,310 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:54:13,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:13,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:13,312 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-08 00:54:13,313 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-08 00:54:13,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-08 00:54:13,358 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 37 statements. [2025-03-08 00:54:13,358 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 00:54:13,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:13,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:54:13,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:13,510 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-08 00:54:13,511 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:54:13,511 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:13,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634467192] [2025-03-08 00:54:13,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634467192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:13,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:13,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 00:54:13,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746656219] [2025-03-08 00:54:13,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:13,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 00:54:13,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:13,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 00:54:13,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:54:13,513 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 12 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:54:13,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:13,749 INFO L93 Difference]: Finished difference Result 144 states and 190 transitions. [2025-03-08 00:54:13,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 00:54:13,749 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2025-03-08 00:54:13,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:13,750 INFO L225 Difference]: With dead ends: 144 [2025-03-08 00:54:13,750 INFO L226 Difference]: Without dead ends: 112 [2025-03-08 00:54:13,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:54:13,751 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 40 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:13,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 975 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:54:13,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-08 00:54:13,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2025-03-08 00:54:13,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.263157894736842) internal successors, (96), 79 states have internal predecessors, (96), 15 states have call successors, (15), 8 states have call predecessors, (15), 10 states have return successors, (22), 14 states have call predecessors, (22), 14 states have call successors, (22) [2025-03-08 00:54:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 133 transitions. [2025-03-08 00:54:13,765 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 133 transitions. Word has length 37 [2025-03-08 00:54:13,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:13,765 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 133 transitions. [2025-03-08 00:54:13,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:54:13,765 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 133 transitions. [2025-03-08 00:54:13,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 00:54:13,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:13,766 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:13,773 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-08 00:54:13,972 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-08 00:54:13,972 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:13,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:13,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1791782636, now seen corresponding path program 1 times [2025-03-08 00:54:13,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:13,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1113695099] [2025-03-08 00:54:13,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:13,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:13,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:13,974 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-08 00:54:13,975 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-08 00:54:14,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 00:54:14,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 00:54:14,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:14,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:14,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 00:54:14,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:14,072 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:54:14,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:14,106 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:54:14,106 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:14,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113695099] [2025-03-08 00:54:14,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113695099] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:54:14,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:54:14,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-03-08 00:54:14,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090331876] [2025-03-08 00:54:14,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:54:14,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 00:54:14,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:14,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 00:54:14,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:54:14,108 INFO L87 Difference]: Start difference. First operand 102 states and 133 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:54:14,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:14,172 INFO L93 Difference]: Finished difference Result 204 states and 268 transitions. [2025-03-08 00:54:14,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:54:14,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-03-08 00:54:14,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:14,173 INFO L225 Difference]: With dead ends: 204 [2025-03-08 00:54:14,173 INFO L226 Difference]: Without dead ends: 159 [2025-03-08 00:54:14,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:54:14,174 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 36 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:14,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 644 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:14,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-08 00:54:14,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 138. [2025-03-08 00:54:14,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 103 states have (on average 1.2621359223300972) internal successors, (130), 106 states have internal predecessors, (130), 22 states have call successors, (22), 10 states have call predecessors, (22), 12 states have return successors, (31), 21 states have call predecessors, (31), 21 states have call successors, (31) [2025-03-08 00:54:14,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 183 transitions. [2025-03-08 00:54:14,196 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 183 transitions. Word has length 37 [2025-03-08 00:54:14,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:14,196 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 183 transitions. [2025-03-08 00:54:14,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:54:14,196 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 183 transitions. [2025-03-08 00:54:14,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 00:54:14,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:14,197 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:54:14,206 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-08 00:54:14,397 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-08 00:54:14,397 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:14,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:14,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1763153485, now seen corresponding path program 1 times [2025-03-08 00:54:14,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:14,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1012435408] [2025-03-08 00:54:14,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:14,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:14,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:14,400 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-08 00:54:14,400 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-08 00:54:14,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 00:54:14,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 00:54:14,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:14,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:14,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 00:54:14,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:14,541 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:54:14,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:14,702 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:14,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012435408] [2025-03-08 00:54:14,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012435408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:54:14,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1218973688] [2025-03-08 00:54:14,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:14,702 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 00:54:14,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 00:54:14,705 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 00:54:14,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-03-08 00:54:14,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 00:54:14,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 00:54:14,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:14,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:14,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 00:54:14,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:14,822 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:54:14,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:14,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1218973688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:54:14,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:54:14,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2025-03-08 00:54:14,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240551788] [2025-03-08 00:54:14,846 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:54:14,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:54:14,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:14,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:54:14,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:54:14,847 INFO L87 Difference]: Start difference. First operand 138 states and 183 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:54:14,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:14,995 INFO L93 Difference]: Finished difference Result 169 states and 215 transitions. [2025-03-08 00:54:14,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 00:54:14,995 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-03-08 00:54:14,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:14,997 INFO L225 Difference]: With dead ends: 169 [2025-03-08 00:54:14,997 INFO L226 Difference]: Without dead ends: 167 [2025-03-08 00:54:14,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:54:14,998 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 38 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:14,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 921 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:54:14,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-08 00:54:15,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 146. [2025-03-08 00:54:15,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 112 states have internal predecessors, (136), 22 states have call successors, (22), 12 states have call predecessors, (22), 14 states have return successors, (31), 21 states have call predecessors, (31), 21 states have call successors, (31) [2025-03-08 00:54:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 189 transitions. [2025-03-08 00:54:15,025 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 189 transitions. Word has length 37 [2025-03-08 00:54:15,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:15,025 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 189 transitions. [2025-03-08 00:54:15,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:54:15,025 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 189 transitions. [2025-03-08 00:54:15,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 00:54:15,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:15,028 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] [2025-03-08 00:54:15,037 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-08 00:54:15,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2025-03-08 00:54:15,429 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 00:54:15,429 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:15,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:15,430 INFO L85 PathProgramCache]: Analyzing trace with hash 383906023, now seen corresponding path program 1 times [2025-03-08 00:54:15,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:15,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [4063557] [2025-03-08 00:54:15,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:15,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:15,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:15,432 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-08 00:54:15,432 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-08 00:54:15,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 00:54:15,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 00:54:15,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:15,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:15,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 00:54:15,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:15,542 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-08 00:54:15,542 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:54:15,543 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:15,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4063557] [2025-03-08 00:54:15,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4063557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:15,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:15,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 00:54:15,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418622894] [2025-03-08 00:54:15,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:15,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 00:54:15,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:15,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 00:54:15,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:54:15,543 INFO L87 Difference]: Start difference. First operand 146 states and 189 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:54:15,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:15,615 INFO L93 Difference]: Finished difference Result 162 states and 206 transitions. [2025-03-08 00:54:15,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:54:15,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2025-03-08 00:54:15,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:15,622 INFO L225 Difference]: With dead ends: 162 [2025-03-08 00:54:15,622 INFO L226 Difference]: Without dead ends: 160 [2025-03-08 00:54:15,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 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-08 00:54:15,625 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 3 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 289 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-08 00:54:15,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 289 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:15,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-08 00:54:15,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 152. [2025-03-08 00:54:15,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 113 states have (on average 1.247787610619469) internal successors, (141), 117 states have internal predecessors, (141), 23 states have call successors, (23), 13 states have call predecessors, (23), 15 states have return successors, (32), 21 states have call predecessors, (32), 22 states have call successors, (32) [2025-03-08 00:54:15,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 196 transitions. [2025-03-08 00:54:15,640 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 196 transitions. Word has length 37 [2025-03-08 00:54:15,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:15,640 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 196 transitions. [2025-03-08 00:54:15,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:54:15,640 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 196 transitions. [2025-03-08 00:54:15,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 00:54:15,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:15,641 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] [2025-03-08 00:54:15,649 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-08 00:54:15,841 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-08 00:54:15,842 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:15,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:15,843 INFO L85 PathProgramCache]: Analyzing trace with hash 412535174, now seen corresponding path program 1 times [2025-03-08 00:54:15,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:15,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [479260575] [2025-03-08 00:54:15,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:15,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:15,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:15,845 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-08 00:54:15,847 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-08 00:54:15,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 00:54:15,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 00:54:15,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:15,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:15,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:54:15,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:15,947 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-08 00:54:15,947 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:54:15,947 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:15,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479260575] [2025-03-08 00:54:15,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479260575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:15,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:15,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 00:54:15,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054632459] [2025-03-08 00:54:15,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:15,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 00:54:15,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:15,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 00:54:15,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:54:15,949 INFO L87 Difference]: Start difference. First operand 152 states and 196 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:54:16,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:16,004 INFO L93 Difference]: Finished difference Result 158 states and 201 transitions. [2025-03-08 00:54:16,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:54:16,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2025-03-08 00:54:16,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:16,006 INFO L225 Difference]: With dead ends: 158 [2025-03-08 00:54:16,006 INFO L226 Difference]: Without dead ends: 156 [2025-03-08 00:54:16,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 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-08 00:54:16,006 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 3 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:16,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 284 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:16,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-08 00:54:16,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 150. [2025-03-08 00:54:16,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 112 states have (on average 1.2410714285714286) internal successors, (139), 115 states have internal predecessors, (139), 22 states have call successors, (22), 13 states have call predecessors, (22), 15 states have return successors, (31), 21 states have call predecessors, (31), 21 states have call successors, (31) [2025-03-08 00:54:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 192 transitions. [2025-03-08 00:54:16,022 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 192 transitions. Word has length 37 [2025-03-08 00:54:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:16,022 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 192 transitions. [2025-03-08 00:54:16,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:54:16,022 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 192 transitions. [2025-03-08 00:54:16,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 00:54:16,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:16,023 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-08 00:54:16,029 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-08 00:54:16,224 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-08 00:54:16,224 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:16,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:16,224 INFO L85 PathProgramCache]: Analyzing trace with hash -931605626, now seen corresponding path program 1 times [2025-03-08 00:54:16,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:16,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1033315640] [2025-03-08 00:54:16,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:16,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:16,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:16,226 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-08 00:54:16,227 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-08 00:54:16,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 00:54:16,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:54:16,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:16,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:16,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 00:54:16,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:16,306 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:54:16,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:54:16,357 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:16,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033315640] [2025-03-08 00:54:16,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033315640] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:54:16,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:54:16,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2025-03-08 00:54:16,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511059845] [2025-03-08 00:54:16,357 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:54:16,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 00:54:16,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:16,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 00:54:16,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:54:16,358 INFO L87 Difference]: Start difference. First operand 150 states and 192 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:54:16,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:16,439 INFO L93 Difference]: Finished difference Result 181 states and 231 transitions. [2025-03-08 00:54:16,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:54:16,439 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2025-03-08 00:54:16,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:16,440 INFO L225 Difference]: With dead ends: 181 [2025-03-08 00:54:16,440 INFO L226 Difference]: Without dead ends: 170 [2025-03-08 00:54:16,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:54:16,441 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 29 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:16,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 406 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:54:16,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-08 00:54:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 158. [2025-03-08 00:54:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 117 states have (on average 1.2393162393162394) internal successors, (145), 121 states have internal predecessors, (145), 24 states have call successors, (24), 13 states have call predecessors, (24), 16 states have return successors, (35), 23 states have call predecessors, (35), 23 states have call successors, (35) [2025-03-08 00:54:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 204 transitions. [2025-03-08 00:54:16,452 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 204 transitions. Word has length 44 [2025-03-08 00:54:16,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:16,452 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 204 transitions. [2025-03-08 00:54:16,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:54:16,453 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 204 transitions. [2025-03-08 00:54:16,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 00:54:16,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:16,453 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-08 00:54:16,459 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-08 00:54:16,654 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-08 00:54:16,654 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:16,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:16,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1566410311, now seen corresponding path program 1 times [2025-03-08 00:54:16,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:16,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [269716369] [2025-03-08 00:54:16,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:16,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:16,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:16,656 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-08 00:54:16,657 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-08 00:54:16,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 00:54:16,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:54:16,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:16,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:16,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 00:54:16,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:54:16,758 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:54:16,758 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:16,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269716369] [2025-03-08 00:54:16,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269716369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:16,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:16,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 00:54:16,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470447164] [2025-03-08 00:54:16,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:16,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:54:16,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:16,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:54:16,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:54:16,760 INFO L87 Difference]: Start difference. First operand 158 states and 204 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:54:16,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:16,912 INFO L93 Difference]: Finished difference Result 217 states and 283 transitions. [2025-03-08 00:54:16,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 00:54:16,912 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2025-03-08 00:54:16,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:16,914 INFO L225 Difference]: With dead ends: 217 [2025-03-08 00:54:16,914 INFO L226 Difference]: Without dead ends: 210 [2025-03-08 00:54:16,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:54:16,914 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 23 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:16,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 649 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:54:16,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-08 00:54:16,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 172. [2025-03-08 00:54:16,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 127 states have (on average 1.2283464566929134) internal successors, (156), 131 states have internal predecessors, (156), 27 states have call successors, (27), 13 states have call predecessors, (27), 17 states have return successors, (42), 27 states have call predecessors, (42), 26 states have call successors, (42) [2025-03-08 00:54:16,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 225 transitions. [2025-03-08 00:54:16,927 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 225 transitions. Word has length 44 [2025-03-08 00:54:16,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:16,927 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 225 transitions. [2025-03-08 00:54:16,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:54:16,927 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 225 transitions. [2025-03-08 00:54:16,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 00:54:16,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:16,928 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-08 00:54:16,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 00:54:17,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:17,129 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:17,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:17,130 INFO L85 PathProgramCache]: Analyzing trace with hash -169335446, now seen corresponding path program 1 times [2025-03-08 00:54:17,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:17,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1667507163] [2025-03-08 00:54:17,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:17,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:17,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:17,132 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-08 00:54:17,133 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-08 00:54:17,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 00:54:17,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:54:17,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:17,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:17,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 00:54:17,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:54:17,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:17,349 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:54:17,349 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:17,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667507163] [2025-03-08 00:54:17,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667507163] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:54:17,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:54:17,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2025-03-08 00:54:17,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027210090] [2025-03-08 00:54:17,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:54:17,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:54:17,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:17,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:54:17,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:54:17,350 INFO L87 Difference]: Start difference. First operand 172 states and 225 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 00:54:17,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:17,487 INFO L93 Difference]: Finished difference Result 224 states and 291 transitions. [2025-03-08 00:54:17,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 00:54:17,488 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2025-03-08 00:54:17,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:17,489 INFO L225 Difference]: With dead ends: 224 [2025-03-08 00:54:17,489 INFO L226 Difference]: Without dead ends: 216 [2025-03-08 00:54:17,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:54:17,489 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 36 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:17,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 544 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:54:17,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-08 00:54:17,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 183. [2025-03-08 00:54:17,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 136 states have (on average 1.2205882352941178) internal successors, (166), 139 states have internal predecessors, (166), 28 states have call successors, (28), 13 states have call predecessors, (28), 18 states have return successors, (44), 30 states have call predecessors, (44), 27 states have call successors, (44) [2025-03-08 00:54:17,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 238 transitions. [2025-03-08 00:54:17,501 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 238 transitions. Word has length 46 [2025-03-08 00:54:17,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:17,501 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 238 transitions. [2025-03-08 00:54:17,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 00:54:17,502 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 238 transitions. [2025-03-08 00:54:17,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 00:54:17,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:17,502 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-08 00:54:17,508 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-08 00:54:17,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:17,703 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:17,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:17,704 INFO L85 PathProgramCache]: Analyzing trace with hash -140706295, now seen corresponding path program 1 times [2025-03-08 00:54:17,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:17,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [682374480] [2025-03-08 00:54:17,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:17,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:17,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:17,706 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-08 00:54:17,707 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-08 00:54:17,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 00:54:17,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:54:17,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:17,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:17,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 00:54:17,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:17,762 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 00:54:17,762 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:54:17,762 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:17,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682374480] [2025-03-08 00:54:17,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682374480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:17,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:17,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 00:54:17,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312882515] [2025-03-08 00:54:17,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:17,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 00:54:17,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:17,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 00:54:17,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:54:17,763 INFO L87 Difference]: Start difference. First operand 183 states and 238 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 00:54:17,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:17,797 INFO L93 Difference]: Finished difference Result 191 states and 245 transitions. [2025-03-08 00:54:17,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:54:17,798 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2025-03-08 00:54:17,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:17,798 INFO L225 Difference]: With dead ends: 191 [2025-03-08 00:54:17,798 INFO L226 Difference]: Without dead ends: 180 [2025-03-08 00:54:17,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 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-08 00:54:17,799 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 3 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:17,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 312 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:17,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-08 00:54:17,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-03-08 00:54:17,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 133 states have (on average 1.2105263157894737) internal successors, (161), 137 states have internal predecessors, (161), 28 states have call successors, (28), 13 states have call predecessors, (28), 18 states have return successors, (43), 29 states have call predecessors, (43), 26 states have call successors, (43) [2025-03-08 00:54:17,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 232 transitions. [2025-03-08 00:54:17,809 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 232 transitions. Word has length 46 [2025-03-08 00:54:17,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:17,809 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 232 transitions. [2025-03-08 00:54:17,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 00:54:17,810 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 232 transitions. [2025-03-08 00:54:17,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 00:54:17,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:17,811 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] [2025-03-08 00:54:17,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-08 00:54:18,011 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-08 00:54:18,011 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:18,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:18,012 INFO L85 PathProgramCache]: Analyzing trace with hash -111337878, now seen corresponding path program 1 times [2025-03-08 00:54:18,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:18,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1724374006] [2025-03-08 00:54:18,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:18,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:18,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:18,014 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-08 00:54:18,015 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-08 00:54:18,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 00:54:18,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:54:18,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:18,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:18,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:54:18,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:18,144 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:54:18,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:18,252 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:54:18,253 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:18,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724374006] [2025-03-08 00:54:18,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724374006] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:54:18,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:54:18,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2025-03-08 00:54:18,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909878064] [2025-03-08 00:54:18,253 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:54:18,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 00:54:18,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:18,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 00:54:18,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:54:18,254 INFO L87 Difference]: Start difference. First operand 180 states and 232 transitions. Second operand has 16 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 00:54:18,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:18,664 INFO L93 Difference]: Finished difference Result 256 states and 340 transitions. [2025-03-08 00:54:18,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 00:54:18,665 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2025-03-08 00:54:18,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:18,666 INFO L225 Difference]: With dead ends: 256 [2025-03-08 00:54:18,666 INFO L226 Difference]: Without dead ends: 249 [2025-03-08 00:54:18,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:54:18,667 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 44 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:18,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1024 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:54:18,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-08 00:54:18,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 190. [2025-03-08 00:54:18,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 139 states have (on average 1.2014388489208634) internal successors, (167), 145 states have internal predecessors, (167), 30 states have call successors, (30), 13 states have call predecessors, (30), 20 states have return successors, (49), 31 states have call predecessors, (49), 28 states have call successors, (49) [2025-03-08 00:54:18,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 246 transitions. [2025-03-08 00:54:18,680 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 246 transitions. Word has length 47 [2025-03-08 00:54:18,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:18,680 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 246 transitions. [2025-03-08 00:54:18,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 00:54:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 246 transitions. [2025-03-08 00:54:18,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 00:54:18,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:18,681 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] [2025-03-08 00:54:18,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-08 00:54:18,881 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-08 00:54:18,882 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:18,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:18,882 INFO L85 PathProgramCache]: Analyzing trace with hash 478038455, now seen corresponding path program 1 times [2025-03-08 00:54:18,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:18,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [790023138] [2025-03-08 00:54:18,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:18,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:18,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:18,884 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-08 00:54:18,885 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-08 00:54:18,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 00:54:18,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:54:18,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:18,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:18,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 00:54:18,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:54:19,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:54:19,294 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:19,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790023138] [2025-03-08 00:54:19,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790023138] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:54:19,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:54:19,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2025-03-08 00:54:19,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313714129] [2025-03-08 00:54:19,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:54:19,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 00:54:19,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:19,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 00:54:19,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2025-03-08 00:54:19,295 INFO L87 Difference]: Start difference. First operand 190 states and 246 transitions. Second operand has 24 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 20 states have internal predecessors, (42), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 00:54:20,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:20,011 INFO L93 Difference]: Finished difference Result 270 states and 370 transitions. [2025-03-08 00:54:20,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 00:54:20,012 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 20 states have internal predecessors, (42), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 47 [2025-03-08 00:54:20,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:20,013 INFO L225 Difference]: With dead ends: 270 [2025-03-08 00:54:20,013 INFO L226 Difference]: Without dead ends: 255 [2025-03-08 00:54:20,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=1404, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 00:54:20,014 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 70 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:20,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1088 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:54:20,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-08 00:54:20,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 196. [2025-03-08 00:54:20,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 143 states have (on average 1.2027972027972027) internal successors, (172), 152 states have internal predecessors, (172), 30 states have call successors, (30), 13 states have call predecessors, (30), 22 states have return successors, (58), 30 states have call predecessors, (58), 28 states have call successors, (58) [2025-03-08 00:54:20,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 260 transitions. [2025-03-08 00:54:20,029 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 260 transitions. Word has length 47 [2025-03-08 00:54:20,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:20,029 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 260 transitions. [2025-03-08 00:54:20,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 20 states have internal predecessors, (42), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 00:54:20,029 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 260 transitions. [2025-03-08 00:54:20,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 00:54:20,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:20,030 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] [2025-03-08 00:54:20,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-08 00:54:20,230 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-08 00:54:20,230 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:20,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:20,231 INFO L85 PathProgramCache]: Analyzing trace with hash -446891640, now seen corresponding path program 2 times [2025-03-08 00:54:20,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:20,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [872027189] [2025-03-08 00:54:20,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:54:20,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:20,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:20,233 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-08 00:54:20,233 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-08 00:54:20,259 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-08 00:54:20,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:54:20,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:54:20,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:20,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 00:54:20,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:54:20,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:20,430 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:54:20,430 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:20,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872027189] [2025-03-08 00:54:20,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872027189] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:54:20,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:54:20,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2025-03-08 00:54:20,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333554525] [2025-03-08 00:54:20,430 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:54:20,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:54:20,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:20,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:54:20,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:54:20,431 INFO L87 Difference]: Start difference. First operand 196 states and 260 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 00:54:20,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:20,697 INFO L93 Difference]: Finished difference Result 254 states and 354 transitions. [2025-03-08 00:54:20,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 00:54:20,698 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2025-03-08 00:54:20,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:20,699 INFO L225 Difference]: With dead ends: 254 [2025-03-08 00:54:20,699 INFO L226 Difference]: Without dead ends: 247 [2025-03-08 00:54:20,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-03-08 00:54:20,700 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 72 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:20,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 732 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:54:20,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-08 00:54:20,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 198. [2025-03-08 00:54:20,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 144 states have (on average 1.2013888888888888) internal successors, (173), 153 states have internal predecessors, (173), 31 states have call successors, (31), 13 states have call predecessors, (31), 22 states have return successors, (59), 31 states have call predecessors, (59), 29 states have call successors, (59) [2025-03-08 00:54:20,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 263 transitions. [2025-03-08 00:54:20,722 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 263 transitions. Word has length 47 [2025-03-08 00:54:20,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:20,723 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 263 transitions. [2025-03-08 00:54:20,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 00:54:20,723 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 263 transitions. [2025-03-08 00:54:20,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 00:54:20,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:20,724 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] [2025-03-08 00:54:20,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-08 00:54:20,924 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-08 00:54:20,924 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:20,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:20,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1903957939, now seen corresponding path program 1 times [2025-03-08 00:54:20,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:20,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [463033926] [2025-03-08 00:54:20,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:20,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:20,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:20,927 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-08 00:54:20,927 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-08 00:54:20,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 00:54:20,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:54:20,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:20,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:20,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 00:54:20,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:21,114 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:54:21,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:54:21,114 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:21,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463033926] [2025-03-08 00:54:21,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463033926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:21,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:21,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 00:54:21,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395742400] [2025-03-08 00:54:21,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:21,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:54:21,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:21,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:54:21,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:54:21,115 INFO L87 Difference]: Start difference. First operand 198 states and 263 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 00:54:21,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:21,333 INFO L93 Difference]: Finished difference Result 297 states and 403 transitions. [2025-03-08 00:54:21,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 00:54:21,333 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2025-03-08 00:54:21,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:21,335 INFO L225 Difference]: With dead ends: 297 [2025-03-08 00:54:21,335 INFO L226 Difference]: Without dead ends: 238 [2025-03-08 00:54:21,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:54:21,335 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 37 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:21,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 935 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:54:21,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-08 00:54:21,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 217. [2025-03-08 00:54:21,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 158 states have (on average 1.1772151898734178) internal successors, (186), 167 states have internal predecessors, (186), 35 states have call successors, (35), 14 states have call predecessors, (35), 23 states have return successors, (63), 35 states have call predecessors, (63), 33 states have call successors, (63) [2025-03-08 00:54:21,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 284 transitions. [2025-03-08 00:54:21,351 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 284 transitions. Word has length 47 [2025-03-08 00:54:21,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:21,351 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 284 transitions. [2025-03-08 00:54:21,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 00:54:21,352 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 284 transitions. [2025-03-08 00:54:21,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 00:54:21,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:21,353 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] [2025-03-08 00:54:21,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-08 00:54:21,557 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-08 00:54:21,557 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:21,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:21,557 INFO L85 PathProgramCache]: Analyzing trace with hash 271730720, now seen corresponding path program 1 times [2025-03-08 00:54:21,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:21,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [696938907] [2025-03-08 00:54:21,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:21,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:21,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:21,560 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-08 00:54:21,561 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-08 00:54:21,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 00:54:21,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:54:21,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:21,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:21,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 00:54:21,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:21,744 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:54:21,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:21,898 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:21,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696938907] [2025-03-08 00:54:21,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696938907] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:54:21,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [194353555] [2025-03-08 00:54:21,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:21,898 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 00:54:21,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 00:54:21,900 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 00:54:21,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2025-03-08 00:54:21,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 00:54:21,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:54:21,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:21,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:21,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:54:21,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:22,024 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:54:22,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:22,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [194353555] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:54:22,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:54:22,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 13 [2025-03-08 00:54:22,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765327653] [2025-03-08 00:54:22,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:54:22,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 00:54:22,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:22,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 00:54:22,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-03-08 00:54:22,145 INFO L87 Difference]: Start difference. First operand 217 states and 284 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 00:54:22,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:22,407 INFO L93 Difference]: Finished difference Result 289 states and 374 transitions. [2025-03-08 00:54:22,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 00:54:22,407 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 47 [2025-03-08 00:54:22,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:22,409 INFO L225 Difference]: With dead ends: 289 [2025-03-08 00:54:22,409 INFO L226 Difference]: Without dead ends: 237 [2025-03-08 00:54:22,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:54:22,409 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 38 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:22,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 895 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:54:22,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-08 00:54:22,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 223. [2025-03-08 00:54:22,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 163 states have (on average 1.165644171779141) internal successors, (190), 172 states have internal predecessors, (190), 35 states have call successors, (35), 15 states have call predecessors, (35), 24 states have return successors, (63), 35 states have call predecessors, (63), 33 states have call successors, (63) [2025-03-08 00:54:22,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 288 transitions. [2025-03-08 00:54:22,439 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 288 transitions. Word has length 47 [2025-03-08 00:54:22,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:22,440 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 288 transitions. [2025-03-08 00:54:22,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 00:54:22,440 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 288 transitions. [2025-03-08 00:54:22,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 00:54:22,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:22,441 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] [2025-03-08 00:54:22,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2025-03-08 00:54:22,647 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-08 00:54:22,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:22,841 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:22,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:22,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1012919707, now seen corresponding path program 2 times [2025-03-08 00:54:22,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:22,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [404839470] [2025-03-08 00:54:22,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:54:22,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:22,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:22,845 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-08 00:54:22,845 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-08 00:54:22,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-08 00:54:22,885 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:54:22,886 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:54:22,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:22,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 00:54:22,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:54:22,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:23,189 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:54:23,189 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:23,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404839470] [2025-03-08 00:54:23,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404839470] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:54:23,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:54:23,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2025-03-08 00:54:23,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538131116] [2025-03-08 00:54:23,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:54:23,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 00:54:23,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:23,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 00:54:23,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2025-03-08 00:54:23,191 INFO L87 Difference]: Start difference. First operand 223 states and 288 transitions. Second operand has 24 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 20 states have internal predecessors, (42), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 00:54:23,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:23,767 INFO L93 Difference]: Finished difference Result 287 states and 384 transitions. [2025-03-08 00:54:23,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 00:54:23,768 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 20 states have internal predecessors, (42), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 47 [2025-03-08 00:54:23,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:23,769 INFO L225 Difference]: With dead ends: 287 [2025-03-08 00:54:23,769 INFO L226 Difference]: Without dead ends: 274 [2025-03-08 00:54:23,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 00:54:23,770 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 70 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:23,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 957 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:54:23,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-08 00:54:23,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 233. [2025-03-08 00:54:23,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 169 states have (on average 1.1597633136094674) internal successors, (196), 180 states have internal predecessors, (196), 37 states have call successors, (37), 15 states have call predecessors, (37), 26 states have return successors, (71), 37 states have call predecessors, (71), 35 states have call successors, (71) [2025-03-08 00:54:23,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 304 transitions. [2025-03-08 00:54:23,796 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 304 transitions. Word has length 47 [2025-03-08 00:54:23,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:23,796 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 304 transitions. [2025-03-08 00:54:23,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 20 states have internal predecessors, (42), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 00:54:23,797 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 304 transitions. [2025-03-08 00:54:23,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 00:54:23,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:23,797 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] [2025-03-08 00:54:23,803 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-08 00:54:23,998 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-08 00:54:23,999 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:23,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:23,999 INFO L85 PathProgramCache]: Analyzing trace with hash 66387585, now seen corresponding path program 1 times [2025-03-08 00:54:24,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:24,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1134899895] [2025-03-08 00:54:24,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:24,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:24,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:24,001 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:54:24,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-08 00:54:24,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 00:54:24,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:54:24,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:24,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:24,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 00:54:24,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:24,174 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:54:24,175 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:54:24,175 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:24,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134899895] [2025-03-08 00:54:24,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134899895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:24,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:24,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 00:54:24,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374326126] [2025-03-08 00:54:24,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:24,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:54:24,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:24,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:54:24,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:54:24,176 INFO L87 Difference]: Start difference. First operand 233 states and 304 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:54:24,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:24,459 INFO L93 Difference]: Finished difference Result 300 states and 393 transitions. [2025-03-08 00:54:24,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 00:54:24,460 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2025-03-08 00:54:24,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:24,461 INFO L225 Difference]: With dead ends: 300 [2025-03-08 00:54:24,461 INFO L226 Difference]: Without dead ends: 248 [2025-03-08 00:54:24,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:54:24,462 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 42 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:24,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 994 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:54:24,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-08 00:54:24,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 233. [2025-03-08 00:54:24,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 169 states have (on average 1.1538461538461537) internal successors, (195), 180 states have internal predecessors, (195), 37 states have call successors, (37), 15 states have call predecessors, (37), 26 states have return successors, (71), 37 states have call predecessors, (71), 35 states have call successors, (71) [2025-03-08 00:54:24,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 303 transitions. [2025-03-08 00:54:24,479 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 303 transitions. Word has length 47 [2025-03-08 00:54:24,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:24,480 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 303 transitions. [2025-03-08 00:54:24,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:54:24,480 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 303 transitions. [2025-03-08 00:54:24,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 00:54:24,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:24,481 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-08 00:54:24,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-08 00:54:24,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:24,681 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:24,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:24,682 INFO L85 PathProgramCache]: Analyzing trace with hash -922284279, now seen corresponding path program 1 times [2025-03-08 00:54:24,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:24,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [624932150] [2025-03-08 00:54:24,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:24,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:24,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:24,684 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:54:24,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-08 00:54:24,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 00:54:24,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 00:54:24,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:24,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:24,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 00:54:24,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:24,750 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:54:24,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:54:24,750 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:24,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624932150] [2025-03-08 00:54:24,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624932150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:24,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:24,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 00:54:24,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794206868] [2025-03-08 00:54:24,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:24,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 00:54:24,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:24,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 00:54:24,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:54:24,751 INFO L87 Difference]: Start difference. First operand 233 states and 303 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 00:54:24,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:24,809 INFO L93 Difference]: Finished difference Result 297 states and 378 transitions. [2025-03-08 00:54:24,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:54:24,809 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2025-03-08 00:54:24,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:24,810 INFO L225 Difference]: With dead ends: 297 [2025-03-08 00:54:24,810 INFO L226 Difference]: Without dead ends: 246 [2025-03-08 00:54:24,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:54:24,811 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 11 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:24,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 477 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:24,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-08 00:54:24,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 231. [2025-03-08 00:54:24,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 168 states have (on average 1.1547619047619047) internal successors, (194), 179 states have internal predecessors, (194), 36 states have call successors, (36), 15 states have call predecessors, (36), 26 states have return successors, (69), 36 states have call predecessors, (69), 34 states have call successors, (69) [2025-03-08 00:54:24,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 299 transitions. [2025-03-08 00:54:24,829 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 299 transitions. Word has length 52 [2025-03-08 00:54:24,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:24,829 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 299 transitions. [2025-03-08 00:54:24,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 00:54:24,829 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 299 transitions. [2025-03-08 00:54:24,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 00:54:24,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:24,830 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] [2025-03-08 00:54:24,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-08 00:54:25,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:25,030 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:25,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:25,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1133693320, now seen corresponding path program 1 times [2025-03-08 00:54:25,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:25,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [821013876] [2025-03-08 00:54:25,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:25,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:25,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:25,033 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:54:25,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-08 00:54:25,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 00:54:25,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 00:54:25,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:25,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:25,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 00:54:25,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:25,148 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:54:25,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 00:54:25,220 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:25,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821013876] [2025-03-08 00:54:25,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821013876] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 00:54:25,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:54:25,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 16 [2025-03-08 00:54:25,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345691779] [2025-03-08 00:54:25,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:25,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 00:54:25,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:25,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 00:54:25,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:54:25,221 INFO L87 Difference]: Start difference. First operand 231 states and 299 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 00:54:25,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:25,300 INFO L93 Difference]: Finished difference Result 303 states and 397 transitions. [2025-03-08 00:54:25,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:54:25,301 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2025-03-08 00:54:25,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:25,302 INFO L225 Difference]: With dead ends: 303 [2025-03-08 00:54:25,302 INFO L226 Difference]: Without dead ends: 267 [2025-03-08 00:54:25,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:54:25,303 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 22 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:25,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 472 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:54:25,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-08 00:54:25,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 252. [2025-03-08 00:54:25,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 183 states have (on average 1.1639344262295082) internal successors, (213), 194 states have internal predecessors, (213), 41 states have call successors, (41), 16 states have call predecessors, (41), 27 states have return successors, (72), 41 states have call predecessors, (72), 38 states have call successors, (72) [2025-03-08 00:54:25,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 326 transitions. [2025-03-08 00:54:25,321 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 326 transitions. Word has length 52 [2025-03-08 00:54:25,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:25,321 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 326 transitions. [2025-03-08 00:54:25,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 00:54:25,321 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 326 transitions. [2025-03-08 00:54:25,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 00:54:25,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:25,322 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] [2025-03-08 00:54:25,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-08 00:54:25,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:25,523 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:25,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:25,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2052891052, now seen corresponding path program 1 times [2025-03-08 00:54:25,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:25,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [124438952] [2025-03-08 00:54:25,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:25,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:25,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:25,525 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:54:25,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-08 00:54:25,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 00:54:25,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:54:25,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:25,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:25,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 00:54:25,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:54:25,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:25,808 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:25,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124438952] [2025-03-08 00:54:25,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124438952] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:54:25,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [872522312] [2025-03-08 00:54:25,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:25,809 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 00:54:25,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 00:54:25,810 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 00:54:25,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2025-03-08 00:54:25,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 00:54:25,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:54:25,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:25,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:25,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:54:25,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:25,929 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:54:25,929 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:54:25,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [872522312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:25,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:54:25,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 10 [2025-03-08 00:54:25,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182823140] [2025-03-08 00:54:25,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:25,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 00:54:25,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:25,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 00:54:25,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:54:25,930 INFO L87 Difference]: Start difference. First operand 252 states and 326 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:54:28,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 00:54:28,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:28,771 INFO L93 Difference]: Finished difference Result 286 states and 374 transitions. [2025-03-08 00:54:28,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:54:28,772 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2025-03-08 00:54:28,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:28,773 INFO L225 Difference]: With dead ends: 286 [2025-03-08 00:54:28,773 INFO L226 Difference]: Without dead ends: 284 [2025-03-08 00:54:28,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:54:28,777 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 13 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:28,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 239 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 00:54:28,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-08 00:54:28,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 258. [2025-03-08 00:54:28,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 186 states have (on average 1.1612903225806452) internal successors, (216), 199 states have internal predecessors, (216), 43 states have call successors, (43), 17 states have call predecessors, (43), 28 states have return successors, (74), 41 states have call predecessors, (74), 40 states have call successors, (74) [2025-03-08 00:54:28,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 333 transitions. [2025-03-08 00:54:28,797 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 333 transitions. Word has length 47 [2025-03-08 00:54:28,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:28,797 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 333 transitions. [2025-03-08 00:54:28,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:54:28,798 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 333 transitions. [2025-03-08 00:54:28,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 00:54:28,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:28,798 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-08 00:54:28,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-08 00:54:29,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2025-03-08 00:54:29,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 00:54:29,199 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:29,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:29,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1041695150, now seen corresponding path program 1 times [2025-03-08 00:54:29,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:29,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1891936220] [2025-03-08 00:54:29,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:29,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:29,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:29,202 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:54:29,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-08 00:54:29,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 00:54:29,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 00:54:29,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:29,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:29,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 00:54:29,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:29,364 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:54:29,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:54:29,364 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:29,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891936220] [2025-03-08 00:54:29,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891936220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:29,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:29,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 00:54:29,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620634959] [2025-03-08 00:54:29,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:29,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:54:29,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:29,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:54:29,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:54:29,366 INFO L87 Difference]: Start difference. First operand 258 states and 333 transitions. Second operand has 14 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 00:54:29,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:29,522 INFO L93 Difference]: Finished difference Result 308 states and 391 transitions. [2025-03-08 00:54:29,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 00:54:29,522 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2025-03-08 00:54:29,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:29,523 INFO L225 Difference]: With dead ends: 308 [2025-03-08 00:54:29,523 INFO L226 Difference]: Without dead ends: 269 [2025-03-08 00:54:29,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-08 00:54:29,524 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 24 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:29,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 893 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:54:29,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-08 00:54:29,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 249. [2025-03-08 00:54:29,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 181 states have (on average 1.1546961325966851) internal successors, (209), 193 states have internal predecessors, (209), 40 states have call successors, (40), 17 states have call predecessors, (40), 27 states have return successors, (70), 38 states have call predecessors, (70), 37 states have call successors, (70) [2025-03-08 00:54:29,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 319 transitions. [2025-03-08 00:54:29,542 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 319 transitions. Word has length 48 [2025-03-08 00:54:29,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:29,542 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 319 transitions. [2025-03-08 00:54:29,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 00:54:29,542 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 319 transitions. [2025-03-08 00:54:29,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 00:54:29,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:29,543 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] [2025-03-08 00:54:29,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-03-08 00:54:29,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:29,744 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:29,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:29,744 INFO L85 PathProgramCache]: Analyzing trace with hash -231433157, now seen corresponding path program 1 times [2025-03-08 00:54:29,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:29,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1316415365] [2025-03-08 00:54:29,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:29,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:29,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:29,747 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:54:29,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-08 00:54:29,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 00:54:29,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 00:54:29,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:29,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:29,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:54:29,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:54:29,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:29,904 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:54:29,904 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:29,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316415365] [2025-03-08 00:54:29,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316415365] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:54:29,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:54:29,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-03-08 00:54:29,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870715108] [2025-03-08 00:54:29,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:54:29,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 00:54:29,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:29,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 00:54:29,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:54:29,905 INFO L87 Difference]: Start difference. First operand 249 states and 319 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 00:54:30,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:30,008 INFO L93 Difference]: Finished difference Result 319 states and 399 transitions. [2025-03-08 00:54:30,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:54:30,008 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2025-03-08 00:54:30,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:30,009 INFO L225 Difference]: With dead ends: 319 [2025-03-08 00:54:30,009 INFO L226 Difference]: Without dead ends: 262 [2025-03-08 00:54:30,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-03-08 00:54:30,010 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 52 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:30,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 793 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:54:30,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-08 00:54:30,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 244. [2025-03-08 00:54:30,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 178 states have (on average 1.151685393258427) internal successors, (205), 189 states have internal predecessors, (205), 39 states have call successors, (39), 17 states have call predecessors, (39), 26 states have return successors, (68), 37 states have call predecessors, (68), 36 states have call successors, (68) [2025-03-08 00:54:30,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 312 transitions. [2025-03-08 00:54:30,029 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 312 transitions. Word has length 48 [2025-03-08 00:54:30,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:30,029 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 312 transitions. [2025-03-08 00:54:30,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 00:54:30,029 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 312 transitions. [2025-03-08 00:54:30,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 00:54:30,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:30,030 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] [2025-03-08 00:54:30,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-03-08 00:54:30,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:30,231 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:30,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:30,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1992864250, now seen corresponding path program 1 times [2025-03-08 00:54:30,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:30,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1838826608] [2025-03-08 00:54:30,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:30,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:30,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:30,234 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:54:30,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-08 00:54:30,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 00:54:30,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 00:54:30,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:30,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:30,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 00:54:30,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:54:30,336 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:54:30,336 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:30,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838826608] [2025-03-08 00:54:30,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838826608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:30,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:54:30,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 00:54:30,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146420924] [2025-03-08 00:54:30,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:30,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:54:30,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:30,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:54:30,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:54:30,337 INFO L87 Difference]: Start difference. First operand 244 states and 312 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:54:30,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:30,461 INFO L93 Difference]: Finished difference Result 293 states and 364 transitions. [2025-03-08 00:54:30,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:54:30,462 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2025-03-08 00:54:30,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:30,463 INFO L225 Difference]: With dead ends: 293 [2025-03-08 00:54:30,463 INFO L226 Difference]: Without dead ends: 248 [2025-03-08 00:54:30,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:54:30,463 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 32 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:30,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 655 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:54:30,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-08 00:54:30,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 237. [2025-03-08 00:54:30,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 174 states have (on average 1.1494252873563218) internal successors, (200), 184 states have internal predecessors, (200), 37 states have call successors, (37), 17 states have call predecessors, (37), 25 states have return successors, (64), 35 states have call predecessors, (64), 34 states have call successors, (64) [2025-03-08 00:54:30,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 301 transitions. [2025-03-08 00:54:30,485 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 301 transitions. Word has length 48 [2025-03-08 00:54:30,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:30,485 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 301 transitions. [2025-03-08 00:54:30,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:54:30,485 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 301 transitions. [2025-03-08 00:54:30,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 00:54:30,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:30,486 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] [2025-03-08 00:54:30,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-03-08 00:54:30,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:30,686 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:30,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:30,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1182336352, now seen corresponding path program 1 times [2025-03-08 00:54:30,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:30,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1820659453] [2025-03-08 00:54:30,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:30,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:30,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:30,689 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:54:30,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-08 00:54:30,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 00:54:30,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 00:54:30,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:30,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:30,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 00:54:30,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:30,761 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:54:30,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:30,790 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 00:54:30,790 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:30,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820659453] [2025-03-08 00:54:30,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820659453] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:54:30,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:54:30,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-03-08 00:54:30,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558992649] [2025-03-08 00:54:30,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:54:30,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 00:54:30,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:30,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 00:54:30,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:54:30,792 INFO L87 Difference]: Start difference. First operand 237 states and 301 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 00:54:30,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:54:30,836 INFO L93 Difference]: Finished difference Result 307 states and 378 transitions. [2025-03-08 00:54:30,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:54:30,836 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 53 [2025-03-08 00:54:30,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:54:30,837 INFO L225 Difference]: With dead ends: 307 [2025-03-08 00:54:30,837 INFO L226 Difference]: Without dead ends: 215 [2025-03-08 00:54:30,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:54:30,838 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 6 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:54:30,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 432 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:54:30,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-08 00:54:30,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-03-08 00:54:30,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 159 states have (on average 1.1572327044025157) internal successors, (184), 169 states have internal predecessors, (184), 32 states have call successors, (32), 15 states have call predecessors, (32), 23 states have return successors, (59), 30 states have call predecessors, (59), 31 states have call successors, (59) [2025-03-08 00:54:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 275 transitions. [2025-03-08 00:54:30,854 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 275 transitions. Word has length 53 [2025-03-08 00:54:30,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:54:30,854 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 275 transitions. [2025-03-08 00:54:30,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 00:54:30,855 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 275 transitions. [2025-03-08 00:54:30,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 00:54:30,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:54:30,855 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-08 00:54:30,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-03-08 00:54:31,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:31,057 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:54:31,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:54:31,057 INFO L85 PathProgramCache]: Analyzing trace with hash 719735943, now seen corresponding path program 1 times [2025-03-08 00:54:31,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:54:31,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [92681362] [2025-03-08 00:54:31,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:31,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:54:31,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:54:31,059 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:54:31,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-08 00:54:31,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 00:54:31,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 00:54:31,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:31,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:31,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 00:54:31,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:35,945 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:54:35,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:54:36,064 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:54:36,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92681362] [2025-03-08 00:54:36,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92681362] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:54:36,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [777515621] [2025-03-08 00:54:36,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:54:36,064 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 00:54:36,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 00:54:36,066 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 00:54:36,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2025-03-08 00:54:36,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 00:54:36,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 00:54:36,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:54:36,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:54:36,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:54:36,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:54:36,176 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:54:36,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:54:36,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [777515621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:54:36,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:54:36,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 10 [2025-03-08 00:54:36,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535690642] [2025-03-08 00:54:36,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:54:36,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 00:54:36,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:54:36,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 00:54:36,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=162, Unknown=2, NotChecked=0, Total=210 [2025-03-08 00:54:36,177 INFO L87 Difference]: Start difference. First operand 215 states and 275 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:54:38,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 00:54:41,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 00:54:43,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 00:54:45,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 00:54:48,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 00:54:51,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 00:54:55,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 00:54:59,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 00:55:00,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:00,013 INFO L93 Difference]: Finished difference Result 241 states and 310 transitions. [2025-03-08 00:55:00,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:55:00,013 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2025-03-08 00:55:00,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:00,014 INFO L225 Difference]: With dead ends: 241 [2025-03-08 00:55:00,014 INFO L226 Difference]: Without dead ends: 237 [2025-03-08 00:55:00,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=53, Invalid=185, Unknown=2, NotChecked=0, Total=240 [2025-03-08 00:55:00,015 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 8 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.8s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:00,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 348 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 8 Unknown, 0 Unchecked, 23.8s Time] [2025-03-08 00:55:00,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-08 00:55:00,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 211. [2025-03-08 00:55:00,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 158 states have (on average 1.1518987341772151) internal successors, (182), 165 states have internal predecessors, (182), 30 states have call successors, (30), 15 states have call predecessors, (30), 22 states have return successors, (57), 30 states have call predecessors, (57), 29 states have call successors, (57) [2025-03-08 00:55:00,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 269 transitions. [2025-03-08 00:55:00,040 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 269 transitions. Word has length 48 [2025-03-08 00:55:00,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:00,040 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 269 transitions. [2025-03-08 00:55:00,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:55:00,041 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 269 transitions. [2025-03-08 00:55:00,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 00:55:00,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:00,041 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] [2025-03-08 00:55:00,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-03-08 00:55:00,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2025-03-08 00:55:00,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 00:55:00,442 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:00,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:00,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1784337132, now seen corresponding path program 1 times [2025-03-08 00:55:00,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:55:00,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1108744862] [2025-03-08 00:55:00,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:00,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:00,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:00,445 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:00,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-08 00:55:00,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 00:55:00,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 00:55:00,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:00,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:00,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 00:55:00,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:55:00,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:55:00,717 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:55:00,717 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:55:00,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108744862] [2025-03-08 00:55:00,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108744862] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:55:00,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:55:00,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2025-03-08 00:55:00,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097699347] [2025-03-08 00:55:00,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:55:00,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 00:55:00,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:55:00,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 00:55:00,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:55:00,718 INFO L87 Difference]: Start difference. First operand 211 states and 269 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 00:55:00,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:00,842 INFO L93 Difference]: Finished difference Result 238 states and 302 transitions. [2025-03-08 00:55:00,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:55:00,842 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) Word has length 49 [2025-03-08 00:55:00,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:00,843 INFO L225 Difference]: With dead ends: 238 [2025-03-08 00:55:00,843 INFO L226 Difference]: Without dead ends: 225 [2025-03-08 00:55:00,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:55:00,844 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 8 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:00,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 671 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:55:00,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-08 00:55:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 214. [2025-03-08 00:55:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 160 states have (on average 1.15) internal successors, (184), 168 states have internal predecessors, (184), 30 states have call successors, (30), 15 states have call predecessors, (30), 23 states have return successors, (60), 30 states have call predecessors, (60), 29 states have call successors, (60) [2025-03-08 00:55:00,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 274 transitions. [2025-03-08 00:55:00,860 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 274 transitions. Word has length 49 [2025-03-08 00:55:00,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:00,860 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 274 transitions. [2025-03-08 00:55:00,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 00:55:00,860 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 274 transitions. [2025-03-08 00:55:00,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 00:55:00,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:00,861 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] [2025-03-08 00:55:00,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-03-08 00:55:01,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:01,062 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:01,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:01,062 INFO L85 PathProgramCache]: Analyzing trace with hash 208735807, now seen corresponding path program 1 times [2025-03-08 00:55:01,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:55:01,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [503486040] [2025-03-08 00:55:01,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:01,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:01,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:01,064 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:01,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-03-08 00:55:01,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 00:55:01,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 00:55:01,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:01,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:01,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 00:55:01,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:01,253 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:55:01,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:55:01,556 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:55:01,556 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:55:01,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503486040] [2025-03-08 00:55:01,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503486040] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:55:01,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:55:01,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2025-03-08 00:55:01,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478587826] [2025-03-08 00:55:01,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:55:01,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 00:55:01,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:55:01,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 00:55:01,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:55:01,557 INFO L87 Difference]: Start difference. First operand 214 states and 274 transitions. Second operand has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 00:55:01,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:01,988 INFO L93 Difference]: Finished difference Result 256 states and 334 transitions. [2025-03-08 00:55:01,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:55:01,989 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 49 [2025-03-08 00:55:01,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:01,990 INFO L225 Difference]: With dead ends: 256 [2025-03-08 00:55:01,990 INFO L226 Difference]: Without dead ends: 231 [2025-03-08 00:55:01,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-03-08 00:55:01,994 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 18 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:01,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 799 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:55:01,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-08 00:55:02,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 206. [2025-03-08 00:55:02,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 153 states have (on average 1.1568627450980393) internal successors, (177), 163 states have internal predecessors, (177), 29 states have call successors, (29), 13 states have call predecessors, (29), 23 states have return successors, (60), 29 states have call predecessors, (60), 28 states have call successors, (60) [2025-03-08 00:55:02,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 266 transitions. [2025-03-08 00:55:02,018 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 266 transitions. Word has length 49 [2025-03-08 00:55:02,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:02,018 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 266 transitions. [2025-03-08 00:55:02,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 00:55:02,018 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 266 transitions. [2025-03-08 00:55:02,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 00:55:02,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:02,019 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 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] [2025-03-08 00:55:02,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2025-03-08 00:55:02,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:02,220 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:02,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:02,220 INFO L85 PathProgramCache]: Analyzing trace with hash -407785116, now seen corresponding path program 1 times [2025-03-08 00:55:02,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:55:02,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1481316678] [2025-03-08 00:55:02,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:02,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:02,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:02,222 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:02,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-03-08 00:55:02,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 00:55:02,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 00:55:02,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:02,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:02,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:55:02,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:02,322 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 00:55:02,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:55:02,522 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 00:55:02,522 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:55:02,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481316678] [2025-03-08 00:55:02,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481316678] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:55:02,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:55:02,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2025-03-08 00:55:02,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037755208] [2025-03-08 00:55:02,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:55:02,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:55:02,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:55:02,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:55:02,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:55:02,523 INFO L87 Difference]: Start difference. First operand 206 states and 266 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:55:02,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:02,733 INFO L93 Difference]: Finished difference Result 245 states and 331 transitions. [2025-03-08 00:55:02,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:55:02,734 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2025-03-08 00:55:02,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:02,735 INFO L225 Difference]: With dead ends: 245 [2025-03-08 00:55:02,735 INFO L226 Difference]: Without dead ends: 227 [2025-03-08 00:55:02,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:55:02,735 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 58 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:02,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 420 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:55:02,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-08 00:55:02,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 209. [2025-03-08 00:55:02,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 155 states have (on average 1.1483870967741936) internal successors, (178), 166 states have internal predecessors, (178), 29 states have call successors, (29), 13 states have call predecessors, (29), 24 states have return successors, (64), 29 states have call predecessors, (64), 28 states have call successors, (64) [2025-03-08 00:55:02,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 271 transitions. [2025-03-08 00:55:02,759 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 271 transitions. Word has length 52 [2025-03-08 00:55:02,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:02,759 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 271 transitions. [2025-03-08 00:55:02,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:55:02,759 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 271 transitions. [2025-03-08 00:55:02,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 00:55:02,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:02,760 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 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, 1] [2025-03-08 00:55:02,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-03-08 00:55:02,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:02,961 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:02,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:02,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1834528040, now seen corresponding path program 1 times [2025-03-08 00:55:02,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:55:02,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [419201250] [2025-03-08 00:55:02,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:02,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:02,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:02,966 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:02,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-03-08 00:55:02,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 00:55:03,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 00:55:03,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:03,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:03,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:55:03,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:03,204 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:55:03,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:55:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:55:03,559 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:55:03,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419201250] [2025-03-08 00:55:03,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419201250] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:55:03,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:55:03,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2025-03-08 00:55:03,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916558172] [2025-03-08 00:55:03,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:55:03,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 00:55:03,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:55:03,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 00:55:03,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-08 00:55:03,560 INFO L87 Difference]: Start difference. First operand 209 states and 271 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 16 states have internal predecessors, (53), 7 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-08 00:55:03,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:03,817 INFO L93 Difference]: Finished difference Result 248 states and 329 transitions. [2025-03-08 00:55:03,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 00:55:03,817 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 16 states have internal predecessors, (53), 7 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) Word has length 61 [2025-03-08 00:55:03,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:03,818 INFO L225 Difference]: With dead ends: 248 [2025-03-08 00:55:03,818 INFO L226 Difference]: Without dead ends: 239 [2025-03-08 00:55:03,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:55:03,819 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 24 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:03,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 748 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:55:03,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-08 00:55:03,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 224. [2025-03-08 00:55:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 165 states have (on average 1.1515151515151516) internal successors, (190), 179 states have internal predecessors, (190), 31 states have call successors, (31), 13 states have call predecessors, (31), 27 states have return successors, (82), 31 states have call predecessors, (82), 30 states have call successors, (82) [2025-03-08 00:55:03,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 303 transitions. [2025-03-08 00:55:03,838 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 303 transitions. Word has length 61 [2025-03-08 00:55:03,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:03,838 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 303 transitions. [2025-03-08 00:55:03,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 16 states have internal predecessors, (53), 7 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-08 00:55:03,838 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 303 transitions. [2025-03-08 00:55:03,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 00:55:03,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:03,839 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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] [2025-03-08 00:55:03,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2025-03-08 00:55:04,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:04,040 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:04,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:04,040 INFO L85 PathProgramCache]: Analyzing trace with hash -946884230, now seen corresponding path program 1 times [2025-03-08 00:55:04,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:55:04,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1929080687] [2025-03-08 00:55:04,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:04,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:04,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:04,042 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:04,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-03-08 00:55:04,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 00:55:04,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 00:55:04,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:04,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:04,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:55:04,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:04,167 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 00:55:04,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:55:04,333 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 00:55:04,334 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:55:04,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929080687] [2025-03-08 00:55:04,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929080687] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:55:04,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:55:04,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2025-03-08 00:55:04,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843750914] [2025-03-08 00:55:04,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:55:04,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:55:04,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:55:04,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:55:04,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:55:04,334 INFO L87 Difference]: Start difference. First operand 224 states and 303 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 00:55:04,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:04,540 INFO L93 Difference]: Finished difference Result 242 states and 326 transitions. [2025-03-08 00:55:04,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:55:04,541 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 61 [2025-03-08 00:55:04,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:04,542 INFO L225 Difference]: With dead ends: 242 [2025-03-08 00:55:04,542 INFO L226 Difference]: Without dead ends: 224 [2025-03-08 00:55:04,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:55:04,543 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 20 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:04,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 465 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:55:04,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-08 00:55:04,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 209. [2025-03-08 00:55:04,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 155 states have (on average 1.1419354838709677) internal successors, (177), 166 states have internal predecessors, (177), 29 states have call successors, (29), 13 states have call predecessors, (29), 24 states have return successors, (63), 29 states have call predecessors, (63), 28 states have call successors, (63) [2025-03-08 00:55:04,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 269 transitions. [2025-03-08 00:55:04,563 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 269 transitions. Word has length 61 [2025-03-08 00:55:04,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:04,564 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 269 transitions. [2025-03-08 00:55:04,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 00:55:04,564 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 269 transitions. [2025-03-08 00:55:04,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 00:55:04,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:04,565 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 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] [2025-03-08 00:55:04,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-03-08 00:55:04,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:04,765 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:04,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:04,766 INFO L85 PathProgramCache]: Analyzing trace with hash 276933893, now seen corresponding path program 1 times [2025-03-08 00:55:04,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:55:04,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1564696950] [2025-03-08 00:55:04,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:04,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:04,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:04,768 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:04,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-03-08 00:55:04,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 00:55:04,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 00:55:04,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:04,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:04,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 00:55:04,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:04,928 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 00:55:04,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:55:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 00:55:05,203 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:55:05,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564696950] [2025-03-08 00:55:05,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564696950] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:55:05,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:55:05,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2025-03-08 00:55:05,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005029959] [2025-03-08 00:55:05,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:55:05,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 00:55:05,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:55:05,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 00:55:05,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:55:05,204 INFO L87 Difference]: Start difference. First operand 209 states and 269 transitions. Second operand has 20 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 00:55:06,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:06,473 INFO L93 Difference]: Finished difference Result 245 states and 321 transitions. [2025-03-08 00:55:06,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 00:55:06,473 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 61 [2025-03-08 00:55:06,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:06,474 INFO L225 Difference]: With dead ends: 245 [2025-03-08 00:55:06,474 INFO L226 Difference]: Without dead ends: 236 [2025-03-08 00:55:06,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 00:55:06,475 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 125 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:06,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 958 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 00:55:06,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-08 00:55:06,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 209. [2025-03-08 00:55:06,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 155 states have (on average 1.1419354838709677) internal successors, (177), 166 states have internal predecessors, (177), 29 states have call successors, (29), 13 states have call predecessors, (29), 24 states have return successors, (62), 29 states have call predecessors, (62), 28 states have call successors, (62) [2025-03-08 00:55:06,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 268 transitions. [2025-03-08 00:55:06,493 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 268 transitions. Word has length 61 [2025-03-08 00:55:06,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:06,493 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 268 transitions. [2025-03-08 00:55:06,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 00:55:06,493 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 268 transitions. [2025-03-08 00:55:06,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 00:55:06,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:06,494 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, 1, 1, 1, 1, 1] [2025-03-08 00:55:06,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2025-03-08 00:55:06,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:06,695 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:06,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:06,695 INFO L85 PathProgramCache]: Analyzing trace with hash -863684846, now seen corresponding path program 1 times [2025-03-08 00:55:06,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:55:06,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [929854811] [2025-03-08 00:55:06,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:06,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:06,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:06,697 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:06,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-03-08 00:55:06,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 00:55:06,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 00:55:06,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:06,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:06,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:55:06,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:06,854 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:55:06,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:55:07,051 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:55:07,051 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:55:07,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929854811] [2025-03-08 00:55:07,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929854811] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:55:07,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:55:07,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2025-03-08 00:55:07,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392481106] [2025-03-08 00:55:07,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:55:07,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:55:07,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:55:07,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:55:07,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:55:07,052 INFO L87 Difference]: Start difference. First operand 209 states and 268 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 00:55:07,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:07,299 INFO L93 Difference]: Finished difference Result 235 states and 309 transitions. [2025-03-08 00:55:07,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:55:07,300 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 63 [2025-03-08 00:55:07,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:07,301 INFO L225 Difference]: With dead ends: 235 [2025-03-08 00:55:07,301 INFO L226 Difference]: Without dead ends: 221 [2025-03-08 00:55:07,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:55:07,301 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 51 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:07,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 368 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:55:07,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-08 00:55:07,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 206. [2025-03-08 00:55:07,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 153 states have (on average 1.1372549019607843) internal successors, (174), 163 states have internal predecessors, (174), 29 states have call successors, (29), 13 states have call predecessors, (29), 23 states have return successors, (59), 29 states have call predecessors, (59), 28 states have call successors, (59) [2025-03-08 00:55:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 262 transitions. [2025-03-08 00:55:07,319 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 262 transitions. Word has length 63 [2025-03-08 00:55:07,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:07,319 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 262 transitions. [2025-03-08 00:55:07,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 00:55:07,319 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 262 transitions. [2025-03-08 00:55:07,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 00:55:07,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:07,320 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, 1, 1, 1, 1, 1] [2025-03-08 00:55:07,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2025-03-08 00:55:07,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:07,521 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:07,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:07,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1056707060, now seen corresponding path program 2 times [2025-03-08 00:55:07,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:55:07,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1774819279] [2025-03-08 00:55:07,521 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:55:07,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:07,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:07,523 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:07,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-03-08 00:55:07,553 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-03-08 00:55:07,567 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 00:55:07,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:55:07,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:07,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:55:07,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:07,718 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:55:07,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:55:07,935 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:55:07,935 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:55:07,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774819279] [2025-03-08 00:55:07,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774819279] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:55:07,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:55:07,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2025-03-08 00:55:07,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536160602] [2025-03-08 00:55:07,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:55:07,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:55:07,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:55:07,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:55:07,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:55:07,936 INFO L87 Difference]: Start difference. First operand 206 states and 262 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 00:55:08,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:08,156 INFO L93 Difference]: Finished difference Result 232 states and 303 transitions. [2025-03-08 00:55:08,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:55:08,157 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 63 [2025-03-08 00:55:08,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:08,158 INFO L225 Difference]: With dead ends: 232 [2025-03-08 00:55:08,158 INFO L226 Difference]: Without dead ends: 215 [2025-03-08 00:55:08,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:55:08,158 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 34 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:08,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 331 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:55:08,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-08 00:55:08,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 195. [2025-03-08 00:55:08,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 146 states have (on average 1.13013698630137) internal successors, (165), 153 states have internal predecessors, (165), 28 states have call successors, (28), 13 states have call predecessors, (28), 20 states have return successors, (53), 28 states have call predecessors, (53), 27 states have call successors, (53) [2025-03-08 00:55:08,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 246 transitions. [2025-03-08 00:55:08,175 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 246 transitions. Word has length 63 [2025-03-08 00:55:08,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:08,177 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 246 transitions. [2025-03-08 00:55:08,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 00:55:08,177 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 246 transitions. [2025-03-08 00:55:08,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 00:55:08,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:08,178 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 00:55:08,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2025-03-08 00:55:08,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:08,378 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:08,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:08,379 INFO L85 PathProgramCache]: Analyzing trace with hash -891276657, now seen corresponding path program 1 times [2025-03-08 00:55:08,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:55:08,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [979262571] [2025-03-08 00:55:08,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:08,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:08,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:08,381 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:08,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-03-08 00:55:08,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 00:55:08,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 00:55:08,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:08,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:08,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:55:08,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:08,676 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:55:08,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:55:09,045 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:55:09,045 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:55:09,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979262571] [2025-03-08 00:55:09,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979262571] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:55:09,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:55:09,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2025-03-08 00:55:09,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529572253] [2025-03-08 00:55:09,045 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:55:09,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 00:55:09,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:55:09,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 00:55:09,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:55:09,046 INFO L87 Difference]: Start difference. First operand 195 states and 246 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 14 states have internal predecessors, (55), 5 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 00:55:09,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:09,349 INFO L93 Difference]: Finished difference Result 215 states and 266 transitions. [2025-03-08 00:55:09,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 00:55:09,350 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 14 states have internal predecessors, (55), 5 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 70 [2025-03-08 00:55:09,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:09,350 INFO L225 Difference]: With dead ends: 215 [2025-03-08 00:55:09,350 INFO L226 Difference]: Without dead ends: 172 [2025-03-08 00:55:09,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-03-08 00:55:09,351 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 28 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:09,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 691 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:55:09,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-08 00:55:09,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 156. [2025-03-08 00:55:09,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 116 states have (on average 1.1637931034482758) internal successors, (135), 122 states have internal predecessors, (135), 23 states have call successors, (23), 10 states have call predecessors, (23), 16 states have return successors, (41), 23 states have call predecessors, (41), 22 states have call successors, (41) [2025-03-08 00:55:09,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 199 transitions. [2025-03-08 00:55:09,366 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 199 transitions. Word has length 70 [2025-03-08 00:55:09,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:09,367 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 199 transitions. [2025-03-08 00:55:09,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 14 states have internal predecessors, (55), 5 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 00:55:09,367 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 199 transitions. [2025-03-08 00:55:09,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 00:55:09,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:09,368 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 00:55:09,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2025-03-08 00:55:09,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:09,570 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:09,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:09,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1839093956, now seen corresponding path program 1 times [2025-03-08 00:55:09,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:55:09,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1449093371] [2025-03-08 00:55:09,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:09,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:09,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:09,573 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:09,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2025-03-08 00:55:09,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 00:55:09,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 00:55:09,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:09,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:09,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 00:55:09,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 00:55:10,410 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:55:10,410 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:55:10,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449093371] [2025-03-08 00:55:10,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449093371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:10,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:55:10,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 00:55:10,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033781671] [2025-03-08 00:55:10,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:10,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 00:55:10,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:55:10,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 00:55:10,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:55:10,411 INFO L87 Difference]: Start difference. First operand 156 states and 199 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 00:55:10,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:10,834 INFO L93 Difference]: Finished difference Result 172 states and 215 transitions. [2025-03-08 00:55:10,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:55:10,836 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 70 [2025-03-08 00:55:10,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:10,836 INFO L225 Difference]: With dead ends: 172 [2025-03-08 00:55:10,837 INFO L226 Difference]: Without dead ends: 163 [2025-03-08 00:55:10,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:55:10,837 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 6 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:10,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 497 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:55:10,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-08 00:55:10,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 156. [2025-03-08 00:55:10,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 116 states have (on average 1.1637931034482758) internal successors, (135), 122 states have internal predecessors, (135), 23 states have call successors, (23), 10 states have call predecessors, (23), 16 states have return successors, (40), 23 states have call predecessors, (40), 22 states have call successors, (40) [2025-03-08 00:55:10,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 198 transitions. [2025-03-08 00:55:10,852 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 198 transitions. Word has length 70 [2025-03-08 00:55:10,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:10,852 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 198 transitions. [2025-03-08 00:55:10,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 00:55:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 198 transitions. [2025-03-08 00:55:10,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 00:55:10,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:10,853 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 00:55:10,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2025-03-08 00:55:11,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:11,057 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:11,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:11,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1156739238, now seen corresponding path program 1 times [2025-03-08 00:55:11,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:55:11,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [315399325] [2025-03-08 00:55:11,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:11,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:11,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:11,059 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:11,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2025-03-08 00:55:11,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 00:55:11,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 00:55:11,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:11,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:11,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 00:55:11,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 00:55:12,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:55:14,345 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 00:55:14,345 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:55:14,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315399325] [2025-03-08 00:55:14,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315399325] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:55:14,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:55:14,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2025-03-08 00:55:14,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951710415] [2025-03-08 00:55:14,345 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:55:14,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 00:55:14,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:55:14,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 00:55:14,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:55:14,347 INFO L87 Difference]: Start difference. First operand 156 states and 198 transitions. Second operand has 25 states, 25 states have (on average 2.44) internal successors, (61), 25 states have internal predecessors, (61), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11)