./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 927306cfdb34082f032dbe87a24c6d688e2dda4e8fb165835d54bffc8f03e27e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:40:57,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:40:57,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 21:40:58,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:40:58,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:40:58,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:40:58,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:40:58,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:40:58,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:40:58,023 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:40:58,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:40:58,023 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:40:58,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:40:58,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:40:58,024 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:40:58,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:40:58,024 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:40:58,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 21:40:58,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:40:58,024 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:40:58,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:40:58,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:40:58,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:40:58,024 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:40:58,025 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:40:58,025 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:40:58,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:40:58,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:40:58,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:40:58,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:40:58,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:40:58,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:40:58,025 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:40:58,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:40:58,026 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 21:40:58,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 21:40:58,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:40:58,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:40:58,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:40:58,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:40:58,026 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 927306cfdb34082f032dbe87a24c6d688e2dda4e8fb165835d54bffc8f03e27e [2025-03-16 21:40:58,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:40:58,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:40:58,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:40:58,234 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:40:58,235 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:40:58,236 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c [2025-03-16 21:40:59,355 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67f8ef5ae/c54a3dc8831e4f58b5ed61b088038e77/FLAGc9f6f0170 [2025-03-16 21:40:59,571 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:40:59,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c [2025-03-16 21:40:59,579 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67f8ef5ae/c54a3dc8831e4f58b5ed61b088038e77/FLAGc9f6f0170 [2025-03-16 21:40:59,926 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67f8ef5ae/c54a3dc8831e4f58b5ed61b088038e77 [2025-03-16 21:40:59,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:40:59,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:40:59,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:40:59,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:40:59,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:40:59,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:40:59" (1/1) ... [2025-03-16 21:40:59,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b9cecc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:40:59, skipping insertion in model container [2025-03-16 21:40:59,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:40:59" (1/1) ... [2025-03-16 21:40:59,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:41:00,047 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/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c[1250,1263] [2025-03-16 21:41:00,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:41:00,116 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:41:00,122 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/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c[1250,1263] [2025-03-16 21:41:00,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:41:00,174 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:41:00,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:00 WrapperNode [2025-03-16 21:41:00,176 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:41:00,177 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:41:00,177 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:41:00,177 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:41:00,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:00" (1/1) ... [2025-03-16 21:41:00,189 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:00" (1/1) ... [2025-03-16 21:41:00,242 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 294 [2025-03-16 21:41:00,243 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:41:00,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:41:00,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:41:00,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:41:00,249 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:00" (1/1) ... [2025-03-16 21:41:00,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:00" (1/1) ... [2025-03-16 21:41:00,259 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:00" (1/1) ... [2025-03-16 21:41:00,284 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-16 21:41:00,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:00" (1/1) ... [2025-03-16 21:41:00,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:00" (1/1) ... [2025-03-16 21:41:00,297 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:00" (1/1) ... [2025-03-16 21:41:00,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:00" (1/1) ... [2025-03-16 21:41:00,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:00" (1/1) ... [2025-03-16 21:41:00,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:00" (1/1) ... [2025-03-16 21:41:00,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:41:00,319 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:41:00,319 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:41:00,319 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:41:00,319 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:00" (1/1) ... [2025-03-16 21:41:00,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:41:00,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:41:00,346 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 21:41:00,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 21:41:00,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:41:00,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 21:41:00,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:41:00,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:41:00,441 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:41:00,443 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:41:00,823 INFO L? ?]: Removed 166 outVars from TransFormulas that were not future-live. [2025-03-16 21:41:00,823 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:41:00,845 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:41:00,846 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-16 21:41:00,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:41:00 BoogieIcfgContainer [2025-03-16 21:41:00,846 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:41:00,848 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:41:00,848 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:41:00,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:41:00,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:40:59" (1/3) ... [2025-03-16 21:41:00,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43dc004e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:41:00, skipping insertion in model container [2025-03-16 21:41:00,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:00" (2/3) ... [2025-03-16 21:41:00,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43dc004e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:41:00, skipping insertion in model container [2025-03-16 21:41:00,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:41:00" (3/3) ... [2025-03-16 21:41:00,853 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.diagonal_v.c [2025-03-16 21:41:00,864 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:41:00,865 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.diagonal_v.c that has 1 procedures, 78 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:41:00,909 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:41:00,918 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;@24bda502, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:41:00,918 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:41:00,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 76 states have (on average 1.486842105263158) internal successors, (113), 77 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:00,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-16 21:41:00,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:00,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:41:00,925 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:00,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:00,929 INFO L85 PathProgramCache]: Analyzing trace with hash -369647215, now seen corresponding path program 1 times [2025-03-16 21:41:00,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:41:00,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389800472] [2025-03-16 21:41:00,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:00,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:41:00,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-16 21:41:01,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 21:41:01,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:01,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:01,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:01,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:41:01,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389800472] [2025-03-16 21:41:01,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389800472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:41:01,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:41:01,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:41:01,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561848347] [2025-03-16 21:41:01,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:41:01,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:41:01,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:41:01,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:41:01,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:41:01,304 INFO L87 Difference]: Start difference. First operand has 78 states, 76 states have (on average 1.486842105263158) internal successors, (113), 77 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:01,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:41:01,380 INFO L93 Difference]: Finished difference Result 147 states and 215 transitions. [2025-03-16 21:41:01,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:41:01,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-16 21:41:01,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:41:01,386 INFO L225 Difference]: With dead ends: 147 [2025-03-16 21:41:01,386 INFO L226 Difference]: Without dead ends: 78 [2025-03-16 21:41:01,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:41:01,389 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:41:01,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:41:01,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-16 21:41:01,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-16 21:41:01,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 77 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:01,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 112 transitions. [2025-03-16 21:41:01,412 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 112 transitions. Word has length 12 [2025-03-16 21:41:01,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:41:01,412 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 112 transitions. [2025-03-16 21:41:01,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:01,412 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 112 transitions. [2025-03-16 21:41:01,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-16 21:41:01,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:01,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:41:01,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 21:41:01,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:01,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:01,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1430517460, now seen corresponding path program 1 times [2025-03-16 21:41:01,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:41:01,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042970011] [2025-03-16 21:41:01,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:01,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:41:01,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-16 21:41:01,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 21:41:01,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:01,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:01,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:01,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:41:01,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042970011] [2025-03-16 21:41:01,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042970011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:41:01,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:41:01,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:41:01,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007658024] [2025-03-16 21:41:01,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:41:01,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:41:01,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:41:01,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:41:01,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:41:01,491 INFO L87 Difference]: Start difference. First operand 78 states and 112 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:01,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:41:01,563 INFO L93 Difference]: Finished difference Result 149 states and 214 transitions. [2025-03-16 21:41:01,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:41:01,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-16 21:41:01,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:41:01,564 INFO L225 Difference]: With dead ends: 149 [2025-03-16 21:41:01,564 INFO L226 Difference]: Without dead ends: 80 [2025-03-16 21:41:01,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:41:01,565 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:41:01,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:41:01,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-16 21:41:01,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-16 21:41:01,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 79 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:01,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2025-03-16 21:41:01,574 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 13 [2025-03-16 21:41:01,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:41:01,575 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2025-03-16 21:41:01,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:01,575 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2025-03-16 21:41:01,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 21:41:01,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:01,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:41:01,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 21:41:01,575 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:01,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:01,578 INFO L85 PathProgramCache]: Analyzing trace with hash -967089684, now seen corresponding path program 1 times [2025-03-16 21:41:01,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:41:01,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787971950] [2025-03-16 21:41:01,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:01,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:41:01,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 21:41:01,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 21:41:01,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:01,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:01,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:01,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:41:01,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787971950] [2025-03-16 21:41:01,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787971950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:41:01,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:41:01,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:41:01,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773395620] [2025-03-16 21:41:01,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:41:01,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:41:01,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:41:01,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:41:01,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:41:01,846 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:01,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:41:01,987 INFO L93 Difference]: Finished difference Result 208 states and 297 transitions. [2025-03-16 21:41:01,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:41:01,988 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-16 21:41:01,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:41:01,990 INFO L225 Difference]: With dead ends: 208 [2025-03-16 21:41:01,990 INFO L226 Difference]: Without dead ends: 137 [2025-03-16 21:41:01,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-16 21:41:01,991 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 88 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:41:01,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 389 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:41:01,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-16 21:41:01,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 82. [2025-03-16 21:41:01,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:01,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 116 transitions. [2025-03-16 21:41:01,998 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 116 transitions. Word has length 14 [2025-03-16 21:41:01,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:41:01,998 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 116 transitions. [2025-03-16 21:41:01,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:01,998 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 116 transitions. [2025-03-16 21:41:02,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 21:41:02,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:02,002 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:41:02,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 21:41:02,002 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:02,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:02,002 INFO L85 PathProgramCache]: Analyzing trace with hash 260287082, now seen corresponding path program 1 times [2025-03-16 21:41:02,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:41:02,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292618441] [2025-03-16 21:41:02,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:02,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:41:02,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-16 21:41:02,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 21:41:02,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:02,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:02,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:02,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:41:02,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292618441] [2025-03-16 21:41:02,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292618441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:41:02,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:41:02,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 21:41:02,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191105361] [2025-03-16 21:41:02,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:41:02,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:41:02,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:41:02,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:41:02,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:41:02,305 INFO L87 Difference]: Start difference. First operand 82 states and 116 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:02,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:41:02,394 INFO L93 Difference]: Finished difference Result 153 states and 217 transitions. [2025-03-16 21:41:02,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:41:02,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-16 21:41:02,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:41:02,395 INFO L225 Difference]: With dead ends: 153 [2025-03-16 21:41:02,395 INFO L226 Difference]: Without dead ends: 82 [2025-03-16 21:41:02,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-16 21:41:02,398 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 96 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:41:02,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 128 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:41:02,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-16 21:41:02,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-16 21:41:02,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:02,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 115 transitions. [2025-03-16 21:41:02,409 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 115 transitions. Word has length 49 [2025-03-16 21:41:02,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:41:02,409 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 115 transitions. [2025-03-16 21:41:02,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:02,409 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 115 transitions. [2025-03-16 21:41:02,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 21:41:02,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:02,411 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:41:02,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 21:41:02,411 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:02,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:02,412 INFO L85 PathProgramCache]: Analyzing trace with hash -171463629, now seen corresponding path program 1 times [2025-03-16 21:41:02,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:41:02,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594266382] [2025-03-16 21:41:02,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:02,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:41:02,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 21:41:02,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 21:41:02,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:02,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:02,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:02,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:41:02,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594266382] [2025-03-16 21:41:02,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594266382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:41:02,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:41:02,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:41:02,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403042219] [2025-03-16 21:41:02,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:41:02,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:41:02,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:41:02,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:41:02,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:41:02,638 INFO L87 Difference]: Start difference. First operand 82 states and 115 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:02,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:41:02,772 INFO L93 Difference]: Finished difference Result 208 states and 293 transitions. [2025-03-16 21:41:02,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:41:02,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-16 21:41:02,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:41:02,773 INFO L225 Difference]: With dead ends: 208 [2025-03-16 21:41:02,774 INFO L226 Difference]: Without dead ends: 137 [2025-03-16 21:41:02,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:41:02,775 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 304 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:41:02,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 225 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:41:02,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-16 21:41:02,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 103. [2025-03-16 21:41:02,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.392156862745098) internal successors, (142), 102 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:02,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 142 transitions. [2025-03-16 21:41:02,781 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 142 transitions. Word has length 50 [2025-03-16 21:41:02,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:41:02,781 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 142 transitions. [2025-03-16 21:41:02,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:02,782 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 142 transitions. [2025-03-16 21:41:02,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 21:41:02,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:02,782 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:41:02,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 21:41:02,783 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:02,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:02,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1649473518, now seen corresponding path program 1 times [2025-03-16 21:41:02,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:41:02,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064201472] [2025-03-16 21:41:02,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:02,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:41:02,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 21:41:02,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 21:41:02,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:02,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:03,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:03,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:41:03,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064201472] [2025-03-16 21:41:03,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064201472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:41:03,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:41:03,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:41:03,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070711708] [2025-03-16 21:41:03,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:41:03,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:41:03,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:41:03,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:41:03,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:41:03,026 INFO L87 Difference]: Start difference. First operand 103 states and 142 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:03,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:41:03,173 INFO L93 Difference]: Finished difference Result 208 states and 292 transitions. [2025-03-16 21:41:03,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:41:03,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-16 21:41:03,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:41:03,174 INFO L225 Difference]: With dead ends: 208 [2025-03-16 21:41:03,174 INFO L226 Difference]: Without dead ends: 137 [2025-03-16 21:41:03,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:41:03,175 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 246 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:41:03,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 173 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:41:03,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-16 21:41:03,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 104. [2025-03-16 21:41:03,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:03,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 143 transitions. [2025-03-16 21:41:03,179 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 143 transitions. Word has length 51 [2025-03-16 21:41:03,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:41:03,179 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 143 transitions. [2025-03-16 21:41:03,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:03,179 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions. [2025-03-16 21:41:03,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 21:41:03,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:03,180 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:41:03,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 21:41:03,180 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:03,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:03,181 INFO L85 PathProgramCache]: Analyzing trace with hash -359496935, now seen corresponding path program 1 times [2025-03-16 21:41:03,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:41:03,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83901347] [2025-03-16 21:41:03,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:03,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:41:03,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 21:41:03,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 21:41:03,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:03,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:03,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:03,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:41:03,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83901347] [2025-03-16 21:41:03,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83901347] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:41:03,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350292285] [2025-03-16 21:41:03,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:03,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:41:03,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:41:03,563 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-16 21:41:03,565 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-16 21:41:03,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 21:41:03,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 21:41:03,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:03,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:03,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-16 21:41:03,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:41:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:04,030 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:41:04,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350292285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:41:04,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 21:41:04,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 16 [2025-03-16 21:41:04,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355270757] [2025-03-16 21:41:04,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:41:04,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 21:41:04,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:41:04,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 21:41:04,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-03-16 21:41:04,031 INFO L87 Difference]: Start difference. First operand 104 states and 143 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:04,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:41:04,461 INFO L93 Difference]: Finished difference Result 253 states and 356 transitions. [2025-03-16 21:41:04,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 21:41:04,461 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-16 21:41:04,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:41:04,463 INFO L225 Difference]: With dead ends: 253 [2025-03-16 21:41:04,463 INFO L226 Difference]: Without dead ends: 182 [2025-03-16 21:41:04,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2025-03-16 21:41:04,464 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 361 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:41:04,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 317 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:41:04,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-16 21:41:04,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 114. [2025-03-16 21:41:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.3716814159292035) internal successors, (155), 113 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:04,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2025-03-16 21:41:04,476 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 52 [2025-03-16 21:41:04,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:41:04,476 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2025-03-16 21:41:04,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:04,477 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2025-03-16 21:41:04,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 21:41:04,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:04,480 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:41:04,487 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-16 21:41:04,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:41:04,684 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:04,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:04,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1366128839, now seen corresponding path program 1 times [2025-03-16 21:41:04,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:41:04,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406040416] [2025-03-16 21:41:04,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:04,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:41:04,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 21:41:04,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 21:41:04,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:04,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:05,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:41:05,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406040416] [2025-03-16 21:41:05,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406040416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:41:05,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:41:05,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:41:05,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450869526] [2025-03-16 21:41:05,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:41:05,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:41:05,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:41:05,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:41:05,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:41:05,085 INFO L87 Difference]: Start difference. First operand 114 states and 155 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:05,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:41:05,231 INFO L93 Difference]: Finished difference Result 281 states and 393 transitions. [2025-03-16 21:41:05,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:41:05,231 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-16 21:41:05,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:41:05,232 INFO L225 Difference]: With dead ends: 281 [2025-03-16 21:41:05,232 INFO L226 Difference]: Without dead ends: 210 [2025-03-16 21:41:05,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:41:05,233 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 123 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:41:05,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 684 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:41:05,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-16 21:41:05,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 135. [2025-03-16 21:41:05,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.3805970149253732) internal successors, (185), 134 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:05,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 185 transitions. [2025-03-16 21:41:05,244 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 185 transitions. Word has length 53 [2025-03-16 21:41:05,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:41:05,244 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 185 transitions. [2025-03-16 21:41:05,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:05,245 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 185 transitions. [2025-03-16 21:41:05,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 21:41:05,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:05,245 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:41:05,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 21:41:05,245 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:05,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:05,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1058591223, now seen corresponding path program 1 times [2025-03-16 21:41:05,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:41:05,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665581797] [2025-03-16 21:41:05,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:05,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:41:05,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 21:41:05,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 21:41:05,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:05,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:05,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:05,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:41:05,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665581797] [2025-03-16 21:41:05,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665581797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:41:05,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:41:05,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:41:05,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244537875] [2025-03-16 21:41:05,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:41:05,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:41:05,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:41:05,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:41:05,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:41:05,587 INFO L87 Difference]: Start difference. First operand 135 states and 185 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:05,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:41:05,866 INFO L93 Difference]: Finished difference Result 326 states and 455 transitions. [2025-03-16 21:41:05,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:41:05,867 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-16 21:41:05,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:41:05,868 INFO L225 Difference]: With dead ends: 326 [2025-03-16 21:41:05,868 INFO L226 Difference]: Without dead ends: 234 [2025-03-16 21:41:05,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-16 21:41:05,869 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 299 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:41:05,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 426 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:41:05,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-16 21:41:05,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 206. [2025-03-16 21:41:05,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.3804878048780487) internal successors, (283), 205 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:05,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 283 transitions. [2025-03-16 21:41:05,874 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 283 transitions. Word has length 54 [2025-03-16 21:41:05,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:41:05,874 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 283 transitions. [2025-03-16 21:41:05,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:05,874 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 283 transitions. [2025-03-16 21:41:05,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 21:41:05,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:05,875 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:41:05,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 21:41:05,875 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:05,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:05,879 INFO L85 PathProgramCache]: Analyzing trace with hash 724690590, now seen corresponding path program 1 times [2025-03-16 21:41:05,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:41:05,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067675457] [2025-03-16 21:41:05,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:05,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:41:05,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 21:41:05,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 21:41:05,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:05,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:06,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:06,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:41:06,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067675457] [2025-03-16 21:41:06,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067675457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:41:06,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:41:06,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 21:41:06,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704873584] [2025-03-16 21:41:06,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:41:06,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 21:41:06,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:41:06,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 21:41:06,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 21:41:06,096 INFO L87 Difference]: Start difference. First operand 206 states and 283 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:06,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:41:06,129 INFO L93 Difference]: Finished difference Result 298 states and 413 transitions. [2025-03-16 21:41:06,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 21:41:06,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-16 21:41:06,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:41:06,130 INFO L225 Difference]: With dead ends: 298 [2025-03-16 21:41:06,130 INFO L226 Difference]: Without dead ends: 202 [2025-03-16 21:41:06,130 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-16 21:41:06,131 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 2 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:41:06,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 171 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 21:41:06,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-16 21:41:06,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-03-16 21:41:06,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 1.3681592039800996) internal successors, (275), 201 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:06,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 275 transitions. [2025-03-16 21:41:06,136 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 275 transitions. Word has length 55 [2025-03-16 21:41:06,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:41:06,136 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 275 transitions. [2025-03-16 21:41:06,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:06,136 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 275 transitions. [2025-03-16 21:41:06,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-16 21:41:06,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:06,139 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:41:06,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 21:41:06,139 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:06,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:06,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1926244900, now seen corresponding path program 1 times [2025-03-16 21:41:06,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:41:06,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626951694] [2025-03-16 21:41:06,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:06,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:41:06,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 21:41:06,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 21:41:06,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:06,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:06,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:41:06,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626951694] [2025-03-16 21:41:06,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626951694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:41:06,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:41:06,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:41:06,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714493045] [2025-03-16 21:41:06,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:41:06,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:41:06,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:41:06,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:41:06,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:41:06,515 INFO L87 Difference]: Start difference. First operand 202 states and 275 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:06,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:41:06,696 INFO L93 Difference]: Finished difference Result 336 states and 458 transitions. [2025-03-16 21:41:06,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:41:06,697 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-16 21:41:06,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:41:06,698 INFO L225 Difference]: With dead ends: 336 [2025-03-16 21:41:06,698 INFO L226 Difference]: Without dead ends: 244 [2025-03-16 21:41:06,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-16 21:41:06,698 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 244 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:41:06,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 271 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:41:06,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-16 21:41:06,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 225. [2025-03-16 21:41:06,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.3571428571428572) internal successors, (304), 224 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:06,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 304 transitions. [2025-03-16 21:41:06,703 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 304 transitions. Word has length 56 [2025-03-16 21:41:06,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:41:06,703 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 304 transitions. [2025-03-16 21:41:06,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:06,703 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 304 transitions. [2025-03-16 21:41:06,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-16 21:41:06,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:06,704 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:41:06,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 21:41:06,704 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:06,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:06,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1908001625, now seen corresponding path program 1 times [2025-03-16 21:41:06,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:41:06,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909544554] [2025-03-16 21:41:06,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:06,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:41:06,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 21:41:06,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 21:41:06,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:06,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:06,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:06,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:41:06,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909544554] [2025-03-16 21:41:06,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909544554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:41:06,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:41:06,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:41:06,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7780201] [2025-03-16 21:41:06,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:41:06,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:41:06,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:41:06,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:41:06,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:41:06,919 INFO L87 Difference]: Start difference. First operand 225 states and 304 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:07,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:41:07,001 INFO L93 Difference]: Finished difference Result 419 states and 568 transitions. [2025-03-16 21:41:07,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:41:07,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-16 21:41:07,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:41:07,003 INFO L225 Difference]: With dead ends: 419 [2025-03-16 21:41:07,003 INFO L226 Difference]: Without dead ends: 231 [2025-03-16 21:41:07,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:41:07,004 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 96 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:41:07,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 318 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:41:07,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-16 21:41:07,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2025-03-16 21:41:07,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.3478260869565217) internal successors, (310), 230 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:07,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 310 transitions. [2025-03-16 21:41:07,008 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 310 transitions. Word has length 56 [2025-03-16 21:41:07,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:41:07,008 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 310 transitions. [2025-03-16 21:41:07,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:07,009 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 310 transitions. [2025-03-16 21:41:07,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 21:41:07,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:07,009 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:41:07,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 21:41:07,009 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:07,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:07,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1464971955, now seen corresponding path program 1 times [2025-03-16 21:41:07,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:41:07,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165238300] [2025-03-16 21:41:07,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:07,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:41:07,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 21:41:07,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 21:41:07,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:07,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:07,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:07,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:41:07,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165238300] [2025-03-16 21:41:07,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165238300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:41:07,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:41:07,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 21:41:07,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577558332] [2025-03-16 21:41:07,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:41:07,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 21:41:07,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:41:07,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 21:41:07,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:41:07,446 INFO L87 Difference]: Start difference. First operand 231 states and 310 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:07,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:41:07,644 INFO L93 Difference]: Finished difference Result 343 states and 464 transitions. [2025-03-16 21:41:07,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:41:07,645 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-16 21:41:07,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:41:07,646 INFO L225 Difference]: With dead ends: 343 [2025-03-16 21:41:07,646 INFO L226 Difference]: Without dead ends: 249 [2025-03-16 21:41:07,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 21:41:07,646 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 245 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:41:07,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 343 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:41:07,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-16 21:41:07,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 229. [2025-03-16 21:41:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.3421052631578947) internal successors, (306), 228 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:07,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 306 transitions. [2025-03-16 21:41:07,652 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 306 transitions. Word has length 57 [2025-03-16 21:41:07,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:41:07,652 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 306 transitions. [2025-03-16 21:41:07,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:07,652 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 306 transitions. [2025-03-16 21:41:07,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 21:41:07,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:07,653 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:41:07,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 21:41:07,653 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:07,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:07,653 INFO L85 PathProgramCache]: Analyzing trace with hash -199391959, now seen corresponding path program 1 times [2025-03-16 21:41:07,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:41:07,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638623138] [2025-03-16 21:41:07,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:07,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:41:07,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 21:41:07,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 21:41:07,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:07,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:08,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:08,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:41:08,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638623138] [2025-03-16 21:41:08,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638623138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:41:08,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:41:08,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:41:08,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568625452] [2025-03-16 21:41:08,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:41:08,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:41:08,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:41:08,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:41:08,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:41:08,210 INFO L87 Difference]: Start difference. First operand 229 states and 306 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:08,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:41:08,448 INFO L93 Difference]: Finished difference Result 346 states and 465 transitions. [2025-03-16 21:41:08,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:41:08,449 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-16 21:41:08,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:41:08,450 INFO L225 Difference]: With dead ends: 346 [2025-03-16 21:41:08,450 INFO L226 Difference]: Without dead ends: 249 [2025-03-16 21:41:08,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-16 21:41:08,451 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 124 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:41:08,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 474 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:41:08,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-16 21:41:08,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 229. [2025-03-16 21:41:08,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.3421052631578947) internal successors, (306), 228 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:08,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 306 transitions. [2025-03-16 21:41:08,460 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 306 transitions. Word has length 58 [2025-03-16 21:41:08,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:41:08,460 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 306 transitions. [2025-03-16 21:41:08,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:08,460 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 306 transitions. [2025-03-16 21:41:08,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 21:41:08,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:08,461 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:41:08,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 21:41:08,461 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:08,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:08,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1835033407, now seen corresponding path program 1 times [2025-03-16 21:41:08,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:41:08,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247577062] [2025-03-16 21:41:08,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:08,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:41:08,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 21:41:08,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 21:41:08,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:08,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:09,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:09,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:41:09,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247577062] [2025-03-16 21:41:09,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247577062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:41:09,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:41:09,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 21:41:09,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462695790] [2025-03-16 21:41:09,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:41:09,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 21:41:09,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:41:09,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 21:41:09,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-16 21:41:09,353 INFO L87 Difference]: Start difference. First operand 229 states and 306 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:09,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:41:09,595 INFO L93 Difference]: Finished difference Result 353 states and 475 transitions. [2025-03-16 21:41:09,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 21:41:09,595 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-16 21:41:09,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:41:09,596 INFO L225 Difference]: With dead ends: 353 [2025-03-16 21:41:09,597 INFO L226 Difference]: Without dead ends: 245 [2025-03-16 21:41:09,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-16 21:41:09,598 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 121 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:41:09,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 451 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:41:09,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-16 21:41:09,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 235. [2025-03-16 21:41:09,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.3376068376068375) internal successors, (313), 234 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:09,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 313 transitions. [2025-03-16 21:41:09,607 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 313 transitions. Word has length 58 [2025-03-16 21:41:09,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:41:09,607 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 313 transitions. [2025-03-16 21:41:09,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:09,608 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 313 transitions. [2025-03-16 21:41:09,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 21:41:09,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:09,608 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:41:09,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 21:41:09,608 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:09,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:09,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1734804856, now seen corresponding path program 1 times [2025-03-16 21:41:09,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:41:09,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460304610] [2025-03-16 21:41:09,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:09,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:41:09,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 21:41:09,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 21:41:09,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:09,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:09,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:09,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:41:09,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460304610] [2025-03-16 21:41:09,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460304610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:41:09,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:41:09,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:41:09,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786997471] [2025-03-16 21:41:09,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:41:09,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:41:09,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:41:09,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:41:09,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:41:09,908 INFO L87 Difference]: Start difference. First operand 235 states and 313 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:09,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:41:09,999 INFO L93 Difference]: Finished difference Result 329 states and 443 transitions. [2025-03-16 21:41:09,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:41:09,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-16 21:41:09,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:41:10,000 INFO L225 Difference]: With dead ends: 329 [2025-03-16 21:41:10,000 INFO L226 Difference]: Without dead ends: 235 [2025-03-16 21:41:10,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:41:10,001 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 62 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:41:10,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 258 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:41:10,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-16 21:41:10,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2025-03-16 21:41:10,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.329059829059829) internal successors, (311), 234 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:10,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 311 transitions. [2025-03-16 21:41:10,009 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 311 transitions. Word has length 58 [2025-03-16 21:41:10,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:41:10,009 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 311 transitions. [2025-03-16 21:41:10,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:10,009 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 311 transitions. [2025-03-16 21:41:10,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 21:41:10,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:10,010 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:41:10,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 21:41:10,010 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:10,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:10,011 INFO L85 PathProgramCache]: Analyzing trace with hash -894430611, now seen corresponding path program 1 times [2025-03-16 21:41:10,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:41:10,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673931034] [2025-03-16 21:41:10,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:10,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:41:10,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 21:41:10,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 21:41:10,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:10,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:10,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:41:10,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673931034] [2025-03-16 21:41:10,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673931034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:41:10,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:41:10,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:41:10,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89042140] [2025-03-16 21:41:10,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:41:10,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:41:10,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:41:10,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:41:10,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:41:10,130 INFO L87 Difference]: Start difference. First operand 235 states and 311 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:10,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:41:10,260 INFO L93 Difference]: Finished difference Result 424 states and 569 transitions. [2025-03-16 21:41:10,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:41:10,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-16 21:41:10,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:41:10,261 INFO L225 Difference]: With dead ends: 424 [2025-03-16 21:41:10,262 INFO L226 Difference]: Without dead ends: 247 [2025-03-16 21:41:10,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:41:10,263 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 68 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:41:10,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 565 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:41:10,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-16 21:41:10,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 235. [2025-03-16 21:41:10,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.329059829059829) internal successors, (311), 234 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:10,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 311 transitions. [2025-03-16 21:41:10,268 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 311 transitions. Word has length 58 [2025-03-16 21:41:10,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:41:10,269 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 311 transitions. [2025-03-16 21:41:10,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:10,269 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 311 transitions. [2025-03-16 21:41:10,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 21:41:10,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:10,272 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:41:10,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 21:41:10,272 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:10,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:10,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1566107164, now seen corresponding path program 1 times [2025-03-16 21:41:10,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:41:10,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310237580] [2025-03-16 21:41:10,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:10,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:41:10,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 21:41:10,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 21:41:10,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:10,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:10,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:10,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:41:10,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310237580] [2025-03-16 21:41:10,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310237580] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:41:10,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764474000] [2025-03-16 21:41:10,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:10,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:41:10,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:41:10,632 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-16 21:41:10,633 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-16 21:41:10,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 21:41:10,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 21:41:10,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:10,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:10,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 108 conjuncts are in the unsatisfiable core [2025-03-16 21:41:10,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:41:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:11,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:41:12,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:12,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764474000] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:41:12,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 21:41:12,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17, 14] total 37 [2025-03-16 21:41:12,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341792786] [2025-03-16 21:41:12,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 21:41:12,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-16 21:41:12,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:41:12,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-16 21:41:12,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1127, Unknown=0, NotChecked=0, Total=1406 [2025-03-16 21:41:12,390 INFO L87 Difference]: Start difference. First operand 235 states and 311 transitions. Second operand has 38 states, 38 states have (on average 4.342105263157895) internal successors, (165), 37 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:13,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:41:13,882 INFO L93 Difference]: Finished difference Result 753 states and 996 transitions. [2025-03-16 21:41:13,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-16 21:41:13,882 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 4.342105263157895) internal successors, (165), 37 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-16 21:41:13,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:41:13,884 INFO L225 Difference]: With dead ends: 753 [2025-03-16 21:41:13,884 INFO L226 Difference]: Without dead ends: 551 [2025-03-16 21:41:13,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=903, Invalid=3789, Unknown=0, NotChecked=0, Total=4692 [2025-03-16 21:41:13,886 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 1695 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 2006 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1695 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 2024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 21:41:13,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1695 Valid, 1524 Invalid, 2024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2006 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 21:41:13,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-16 21:41:13,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 225. [2025-03-16 21:41:13,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.3035714285714286) internal successors, (292), 224 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:13,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 292 transitions. [2025-03-16 21:41:13,894 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 292 transitions. Word has length 59 [2025-03-16 21:41:13,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:41:13,894 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 292 transitions. [2025-03-16 21:41:13,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.342105263157895) internal successors, (165), 37 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:13,895 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 292 transitions. [2025-03-16 21:41:13,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 21:41:13,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:13,896 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:41:13,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 21:41:14,096 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,SelfDestructingSolverStorable17 [2025-03-16 21:41:14,097 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:14,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:14,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1914414351, now seen corresponding path program 1 times [2025-03-16 21:41:14,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:41:14,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881453555] [2025-03-16 21:41:14,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:14,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:41:14,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 21:41:14,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 21:41:14,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:14,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:14,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:14,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:41:14,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881453555] [2025-03-16 21:41:14,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881453555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:41:14,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:41:14,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:41:14,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223059124] [2025-03-16 21:41:14,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:41:14,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:41:14,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:41:14,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:41:14,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:41:14,210 INFO L87 Difference]: Start difference. First operand 225 states and 292 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:14,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:41:14,249 INFO L93 Difference]: Finished difference Result 413 states and 541 transitions. [2025-03-16 21:41:14,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:41:14,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-16 21:41:14,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:41:14,250 INFO L225 Difference]: With dead ends: 413 [2025-03-16 21:41:14,250 INFO L226 Difference]: Without dead ends: 229 [2025-03-16 21:41:14,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:41:14,251 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:41:14,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 21:41:14,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-03-16 21:41:14,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2025-03-16 21:41:14,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.2982456140350878) internal successors, (296), 228 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:14,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 296 transitions. [2025-03-16 21:41:14,256 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 296 transitions. Word has length 60 [2025-03-16 21:41:14,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:41:14,256 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 296 transitions. [2025-03-16 21:41:14,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:14,256 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 296 transitions. [2025-03-16 21:41:14,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 21:41:14,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:14,257 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:41:14,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 21:41:14,257 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:14,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:14,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1688052272, now seen corresponding path program 1 times [2025-03-16 21:41:14,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:41:14,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173021809] [2025-03-16 21:41:14,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:14,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:41:14,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 21:41:14,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 21:41:14,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:14,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:14,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:14,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:41:14,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173021809] [2025-03-16 21:41:14,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173021809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:41:14,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:41:14,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 21:41:14,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517761274] [2025-03-16 21:41:14,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:41:14,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 21:41:14,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:41:14,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 21:41:14,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:41:14,752 INFO L87 Difference]: Start difference. First operand 229 states and 296 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:14,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:41:14,934 INFO L93 Difference]: Finished difference Result 384 states and 499 transitions. [2025-03-16 21:41:14,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:41:14,934 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 21:41:14,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:41:14,935 INFO L225 Difference]: With dead ends: 384 [2025-03-16 21:41:14,935 INFO L226 Difference]: Without dead ends: 246 [2025-03-16 21:41:14,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:41:14,938 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 165 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:41:14,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 275 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:41:14,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-16 21:41:14,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 230. [2025-03-16 21:41:14,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.296943231441048) internal successors, (297), 229 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:14,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 297 transitions. [2025-03-16 21:41:14,945 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 297 transitions. Word has length 61 [2025-03-16 21:41:14,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:41:14,945 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 297 transitions. [2025-03-16 21:41:14,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:14,945 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 297 transitions. [2025-03-16 21:41:14,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 21:41:14,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:14,946 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:41:14,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 21:41:14,946 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:14,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:14,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1636166172, now seen corresponding path program 1 times [2025-03-16 21:41:14,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:41:14,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050978371] [2025-03-16 21:41:14,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:14,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:41:14,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 21:41:15,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 21:41:15,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:15,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:15,414 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:15,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:41:15,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050978371] [2025-03-16 21:41:15,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050978371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:41:15,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:41:15,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:41:15,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483737448] [2025-03-16 21:41:15,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:41:15,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:41:15,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:41:15,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:41:15,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:41:15,416 INFO L87 Difference]: Start difference. First operand 230 states and 297 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:15,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:41:15,551 INFO L93 Difference]: Finished difference Result 401 states and 514 transitions. [2025-03-16 21:41:15,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:41:15,551 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 21:41:15,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:41:15,552 INFO L225 Difference]: With dead ends: 401 [2025-03-16 21:41:15,552 INFO L226 Difference]: Without dead ends: 275 [2025-03-16 21:41:15,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:41:15,553 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 58 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:41:15,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 346 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:41:15,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-16 21:41:15,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 250. [2025-03-16 21:41:15,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.2730923694779117) internal successors, (317), 249 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:15,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 317 transitions. [2025-03-16 21:41:15,558 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 317 transitions. Word has length 61 [2025-03-16 21:41:15,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:41:15,558 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 317 transitions. [2025-03-16 21:41:15,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:15,559 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 317 transitions. [2025-03-16 21:41:15,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 21:41:15,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:15,559 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:41:15,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 21:41:15,559 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:15,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:15,560 INFO L85 PathProgramCache]: Analyzing trace with hash -756131576, now seen corresponding path program 1 times [2025-03-16 21:41:15,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:41:15,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927926257] [2025-03-16 21:41:15,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:15,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:41:15,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 21:41:15,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 21:41:15,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:15,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:15,958 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:15,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:41:15,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927926257] [2025-03-16 21:41:15,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927926257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:41:15,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:41:15,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:41:15,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281890452] [2025-03-16 21:41:15,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:41:15,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:41:15,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:41:15,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:41:15,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:41:15,960 INFO L87 Difference]: Start difference. First operand 250 states and 317 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:16,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:41:16,100 INFO L93 Difference]: Finished difference Result 398 states and 513 transitions. [2025-03-16 21:41:16,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:41:16,100 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 21:41:16,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:41:16,103 INFO L225 Difference]: With dead ends: 398 [2025-03-16 21:41:16,103 INFO L226 Difference]: Without dead ends: 272 [2025-03-16 21:41:16,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:41:16,105 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 37 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:41:16,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 295 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:41:16,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-16 21:41:16,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2025-03-16 21:41:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 1.2639405204460967) internal successors, (340), 269 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 340 transitions. [2025-03-16 21:41:16,112 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 340 transitions. Word has length 61 [2025-03-16 21:41:16,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:41:16,112 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 340 transitions. [2025-03-16 21:41:16,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 340 transitions. [2025-03-16 21:41:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 21:41:16,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:16,113 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:41:16,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 21:41:16,114 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:16,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:16,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1731566697, now seen corresponding path program 1 times [2025-03-16 21:41:16,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:41:16,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52584559] [2025-03-16 21:41:16,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:16,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:41:16,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 21:41:16,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 21:41:16,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:16,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 21:41:16,198 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 21:41:16,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 21:41:16,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 21:41:16,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:16,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 21:41:16,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 21:41:16,297 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 21:41:16,298 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 21:41:16,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 21:41:16,301 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:41:16,331 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 21:41:16,332 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 21:41:16,340 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 21:41:16,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 09:41:16 BoogieIcfgContainer [2025-03-16 21:41:16,345 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 21:41:16,345 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 21:41:16,345 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 21:41:16,346 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 21:41:16,346 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:41:00" (3/4) ... [2025-03-16 21:41:16,347 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 21:41:16,348 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 21:41:16,349 INFO L158 Benchmark]: Toolchain (without parser) took 16420.06ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 129.6MB in the beginning and 385.3MB in the end (delta: -255.7MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. [2025-03-16 21:41:16,349 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 192.9MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:41:16,349 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.80ms. Allocated memory is still 167.8MB. Free memory was 129.2MB in the beginning and 114.8MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 21:41:16,350 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.27ms. Allocated memory is still 167.8MB. Free memory was 114.8MB in the beginning and 108.1MB in the end (delta: 6.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:41:16,350 INFO L158 Benchmark]: Boogie Preprocessor took 74.75ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 104.1MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 21:41:16,350 INFO L158 Benchmark]: IcfgBuilder took 527.93ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 61.1MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 21:41:16,350 INFO L158 Benchmark]: TraceAbstraction took 15496.73ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 60.4MB in the beginning and 385.4MB in the end (delta: -325.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:41:16,352 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 478.2MB. Free memory was 385.4MB in the beginning and 385.3MB in the end (delta: 99.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 21:41:16,352 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.21ms. Allocated memory is still 192.9MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.80ms. Allocated memory is still 167.8MB. Free memory was 129.2MB in the beginning and 114.8MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.27ms. Allocated memory is still 167.8MB. Free memory was 114.8MB in the beginning and 108.1MB in the end (delta: 6.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 74.75ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 104.1MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 527.93ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 61.1MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 15496.73ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 60.4MB in the beginning and 385.4MB in the end (delta: -325.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 478.2MB. Free memory was 385.4MB in the beginning and 385.3MB in the end (delta: 99.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: 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 shiftRight at line 85, overapproximation of bitwiseOr at line 148, overapproximation of bitwiseAnd at line 89, overapproximation of bitwiseAnd at line 161, overapproximation of bitwiseAnd at line 149, overapproximation of bitwiseAnd at line 127. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L32] const SORT_28 mask_SORT_28 = (SORT_28)-1 >> (sizeof(SORT_28) * 8 - 32); [L33] const SORT_28 msb_SORT_28 = (SORT_28)1 << (32 - 1); [L35] const SORT_4 var_5 = 1; [L36] const SORT_4 var_8 = 0; [L37] const SORT_1 var_15 = 1; [L38] const SORT_4 var_22 = 15; [L39] const SORT_28 var_30 = 1; [L41] SORT_1 input_2; [L42] SORT_1 input_3; [L44] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, var_15=1, var_22=15, var_30=1, var_5=1, var_8=0] [L44] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, var_15=1, var_22=15, var_30=1, var_5=1, var_8=0] [L45] SORT_4 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L47] SORT_4 init_7_arg_1 = var_5; [L48] state_6 = init_7_arg_1 [L49] SORT_4 init_10_arg_1 = var_8; [L50] state_9 = init_10_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L53] input_2 = __VERIFIER_nondet_uchar() [L54] input_3 = __VERIFIER_nondet_uchar() [L57] SORT_4 var_11_arg_0 = state_6; [L58] SORT_4 var_11_arg_1 = state_9; [L59] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L60] SORT_1 var_12_arg_0 = var_11; [L61] SORT_1 var_12 = ~var_12_arg_0; [L62] SORT_1 var_16_arg_0 = var_12; [L63] SORT_1 var_16 = ~var_16_arg_0; [L64] SORT_1 var_17_arg_0 = var_15; [L65] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_17_arg_0=1, var_17_arg_1=-256, var_22=15, var_30=1, var_5=1] [L66] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L66] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L67] EXPR var_17 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L67] var_17 = var_17 & mask_SORT_1 [L68] SORT_1 bad_18_arg_0 = var_17; [L69] CALL __VERIFIER_assert(!(bad_18_arg_0)) [L21] COND FALSE !(!(cond)) [L69] RET __VERIFIER_assert(!(bad_18_arg_0)) [L71] SORT_1 var_37_arg_0 = input_3; [L72] SORT_1 var_37 = ~var_37_arg_0; [L73] SORT_4 var_38_arg_0 = state_6; [L74] SORT_4 var_38_arg_1 = state_9; [L75] SORT_1 var_38 = var_38_arg_0 > var_38_arg_1; [L76] SORT_1 var_39_arg_0 = var_37; [L77] SORT_1 var_39_arg_1 = var_38; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_39_arg_0=-256, var_39_arg_1=1, var_5=1] [L78] EXPR var_39_arg_0 & var_39_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L78] SORT_1 var_39 = var_39_arg_0 & var_39_arg_1; [L79] EXPR var_39 & mask_SORT_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L79] var_39 = var_39 & mask_SORT_1 [L80] SORT_4 var_29_arg_0 = var_22; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_29_arg_0=15, var_30=1, var_39=0, var_5=1] [L81] EXPR var_29_arg_0 & mask_SORT_4 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_39=0, var_5=1] [L81] var_29_arg_0 = var_29_arg_0 & mask_SORT_4 [L82] SORT_28 var_29 = var_29_arg_0; [L83] SORT_28 var_31_arg_0 = var_29; [L84] SORT_28 var_31_arg_1 = var_30; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_31_arg_0=15, var_31_arg_1=1, var_39=0, var_5=1] [L85] EXPR var_31_arg_0 >> var_31_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_39=0, var_5=1] [L85] SORT_28 var_31 = var_31_arg_0 >> var_31_arg_1; [L86] SORT_28 var_32_arg_0 = var_31; [L87] SORT_4 var_32 = var_32_arg_0 >> 0; [L88] SORT_4 var_33_arg_0 = state_6; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_32=258, var_33_arg_0=1, var_39=0, var_5=1] [L89] EXPR var_33_arg_0 & mask_SORT_4 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_32=258, var_39=0, var_5=1] [L89] var_33_arg_0 = var_33_arg_0 & mask_SORT_4 [L90] SORT_28 var_33 = var_33_arg_0; [L91] SORT_28 var_34_arg_0 = var_33; [L92] SORT_28 var_34_arg_1 = var_30; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_32=258, var_34_arg_0=0, var_34_arg_1=1, var_39=0, var_5=1] [L93] EXPR var_34_arg_0 >> var_34_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_32=258, var_39=0, var_5=1] [L93] SORT_28 var_34 = var_34_arg_0 >> var_34_arg_1; [L94] SORT_28 var_35_arg_0 = var_34; [L95] SORT_4 var_35 = var_35_arg_0 >> 0; [L96] SORT_4 var_36_arg_0 = var_32; [L97] SORT_4 var_36_arg_1 = var_35; [L98] SORT_4 var_36 = var_36_arg_0 + var_36_arg_1; [L99] SORT_4 var_26_arg_0 = state_6; [L100] SORT_4 var_26_arg_1 = state_9; [L101] SORT_1 var_26 = var_26_arg_0 < var_26_arg_1; [L102] SORT_4 var_21_arg_0 = state_9; [L103] SORT_4 var_21_arg_1 = state_6; [L104] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L105] SORT_4 var_23_arg_0 = state_6; [L106] SORT_4 var_23_arg_1 = var_22; [L107] SORT_1 var_23 = var_23_arg_0 != var_23_arg_1; [L108] SORT_1 var_24_arg_0 = var_21; [L109] SORT_1 var_24_arg_1 = var_23; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_24_arg_0=0, var_24_arg_1=1, var_26=0, var_30=1, var_36=2, var_39=0, var_5=1] [L110] EXPR var_24_arg_0 | var_24_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_26=0, var_30=1, var_36=2, var_39=0, var_5=1] [L110] SORT_1 var_24 = var_24_arg_0 | var_24_arg_1; [L111] EXPR var_24 & mask_SORT_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_26=0, var_30=1, var_36=2, var_39=0, var_5=1] [L111] var_24 = var_24 & mask_SORT_1 [L112] SORT_4 var_20_arg_0 = state_6; [L113] SORT_4 var_20_arg_1 = var_5; [L114] SORT_4 var_20 = var_20_arg_0 + var_20_arg_1; [L115] SORT_1 var_25_arg_0 = var_24; [L116] SORT_4 var_25_arg_1 = var_20; [L117] SORT_4 var_25_arg_2 = state_9; [L118] SORT_4 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; [L119] SORT_1 var_27_arg_0 = var_26; [L120] SORT_4 var_27_arg_1 = state_6; [L121] SORT_4 var_27_arg_2 = var_25; [L122] SORT_4 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L123] SORT_1 var_40_arg_0 = var_39; [L124] SORT_4 var_40_arg_1 = var_36; [L125] SORT_4 var_40_arg_2 = var_27; [L126] SORT_4 var_40 = var_40_arg_0 ? var_40_arg_1 : var_40_arg_2; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_40=2, var_5=1] [L127] EXPR var_40 & mask_SORT_4 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L127] var_40 = var_40 & mask_SORT_4 [L128] SORT_4 next_41_arg_1 = var_40; [L129] SORT_1 var_48_arg_0 = input_3; [L130] SORT_1 var_48 = ~var_48_arg_0; [L131] SORT_4 var_49_arg_0 = state_6; [L132] SORT_4 var_49_arg_1 = state_9; [L133] SORT_1 var_49 = var_49_arg_0 > var_49_arg_1; [L134] SORT_1 var_50_arg_0 = var_48; [L135] SORT_1 var_50_arg_1 = var_49; VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_50_arg_0=-256, var_50_arg_1=1, var_5=1] [L136] EXPR var_50_arg_0 & var_50_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L136] SORT_1 var_50 = var_50_arg_0 & var_50_arg_1; [L137] EXPR var_50 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L137] var_50 = var_50 & mask_SORT_1 [L138] SORT_4 var_43_arg_0 = state_6; [L139] SORT_4 var_43_arg_1 = state_9; [L140] SORT_1 var_43 = var_43_arg_0 > var_43_arg_1; [L141] SORT_1 var_44_arg_0 = var_43; [L142] SORT_1 var_44 = ~var_44_arg_0; [L143] SORT_4 var_45_arg_0 = state_6; [L144] SORT_4 var_45_arg_1 = var_22; [L145] SORT_1 var_45 = var_45_arg_0 != var_45_arg_1; [L146] SORT_1 var_46_arg_0 = var_44; [L147] SORT_1 var_46_arg_1 = var_45; VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_46_arg_0=-2, var_46_arg_1=1, var_50=0, var_5=1] [L148] EXPR var_46_arg_0 | var_46_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_50=0, var_5=1] [L148] SORT_1 var_46 = var_46_arg_0 | var_46_arg_1; [L149] EXPR var_46 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_50=0, var_5=1] [L149] var_46 = var_46 & mask_SORT_1 [L150] SORT_4 var_42_arg_0 = state_9; [L151] SORT_4 var_42_arg_1 = var_5; [L152] SORT_4 var_42 = var_42_arg_0 + var_42_arg_1; [L153] SORT_1 var_47_arg_0 = var_46; [L154] SORT_4 var_47_arg_1 = var_42; [L155] SORT_4 var_47_arg_2 = state_6; [L156] SORT_4 var_47 = var_47_arg_0 ? var_47_arg_1 : var_47_arg_2; [L157] SORT_1 var_51_arg_0 = var_50; [L158] SORT_4 var_51_arg_1 = state_9; [L159] SORT_4 var_51_arg_2 = var_47; [L160] SORT_4 var_51 = var_51_arg_0 ? var_51_arg_1 : var_51_arg_2; VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, var_15=1, var_22=15, var_30=1, var_51=1, var_5=1] [L161] EXPR var_51 & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, var_15=1, var_22=15, var_30=1, var_5=1] [L161] var_51 = var_51 & mask_SORT_4 [L162] SORT_4 next_52_arg_1 = var_51; [L164] state_6 = next_41_arg_1 [L165] state_9 = next_52_arg_1 [L53] input_2 = __VERIFIER_nondet_uchar() [L54] input_3 = __VERIFIER_nondet_uchar() [L57] SORT_4 var_11_arg_0 = state_6; [L58] SORT_4 var_11_arg_1 = state_9; [L59] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L60] SORT_1 var_12_arg_0 = var_11; [L61] SORT_1 var_12 = ~var_12_arg_0; [L62] SORT_1 var_16_arg_0 = var_12; [L63] SORT_1 var_16 = ~var_16_arg_0; [L64] SORT_1 var_17_arg_0 = var_15; [L65] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_9=1, var_15=1, var_17_arg_0=1, var_17_arg_1=-255, var_22=15, var_30=1, var_5=1] [L66] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_9=1, var_15=1, var_22=15, var_30=1, var_5=1] [L66] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L67] EXPR var_17 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_9=1, var_15=1, var_22=15, var_30=1, var_5=1] [L67] var_17 = var_17 & mask_SORT_1 [L68] SORT_1 bad_18_arg_0 = var_17; [L69] CALL __VERIFIER_assert(!(bad_18_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 113 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.4s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4434 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4434 mSDsluCounter, 8411 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6670 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6208 IncrementalHoareTripleChecker+Invalid, 6253 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 1741 mSDtfsCounter, 6208 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 398 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=270occurred in iteration=22, InterpolantAutomatonStates: 182, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 743 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 1279 NumberOfCodeBlocks, 1279 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1251 ConstructedInterpolants, 0 QuantifiedInterpolants, 8187 SizeOfPredicates, 17 NumberOfNonLiveVariables, 754 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 25 InterpolantComputations, 21 PerfectInterpolantSequences, 122/132 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-16 21:41:16,369 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/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 927306cfdb34082f032dbe87a24c6d688e2dda4e8fb165835d54bffc8f03e27e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:41:18,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:41:18,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-16 21:41:18,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:41:18,287 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:41:18,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:41:18,311 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:41:18,311 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:41:18,312 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:41:18,312 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:41:18,312 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:41:18,313 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:41:18,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:41:18,313 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:41:18,313 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:41:18,313 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:41:18,313 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:41:18,314 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:41:18,314 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:41:18,314 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:41:18,314 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:41:18,314 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 21:41:18,314 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 21:41:18,314 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 21:41:18,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:41:18,314 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:41:18,314 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:41:18,314 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:41:18,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:41:18,314 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:41:18,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:41:18,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:41:18,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:41:18,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:41:18,315 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:41:18,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:41:18,315 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 21:41:18,315 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 21:41:18,315 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:41:18,315 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:41:18,315 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:41:18,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:41:18,315 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 927306cfdb34082f032dbe87a24c6d688e2dda4e8fb165835d54bffc8f03e27e [2025-03-16 21:41:18,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:41:18,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:41:18,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:41:18,558 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:41:18,558 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:41:18,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c [2025-03-16 21:41:19,696 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/393f506c4/2e7aad240f224fc6a5676693420357ce/FLAGfca9cc302 [2025-03-16 21:41:19,886 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:41:19,887 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c [2025-03-16 21:41:19,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/393f506c4/2e7aad240f224fc6a5676693420357ce/FLAGfca9cc302 [2025-03-16 21:41:20,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/393f506c4/2e7aad240f224fc6a5676693420357ce [2025-03-16 21:41:20,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:41:20,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:41:20,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:41:20,287 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:41:20,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:41:20,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:41:20" (1/1) ... [2025-03-16 21:41:20,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d018ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:20, skipping insertion in model container [2025-03-16 21:41:20,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:41:20" (1/1) ... [2025-03-16 21:41:20,302 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:41:20,389 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/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c[1250,1263] [2025-03-16 21:41:20,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:41:20,435 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:41:20,442 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/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c[1250,1263] [2025-03-16 21:41:20,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:41:20,474 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:41:20,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:20 WrapperNode [2025-03-16 21:41:20,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:41:20,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:41:20,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:41:20,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:41:20,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:20" (1/1) ... [2025-03-16 21:41:20,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:20" (1/1) ... [2025-03-16 21:41:20,511 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 154 [2025-03-16 21:41:20,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:41:20,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:41:20,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:41:20,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:41:20,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:20" (1/1) ... [2025-03-16 21:41:20,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:20" (1/1) ... [2025-03-16 21:41:20,525 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:20" (1/1) ... [2025-03-16 21:41:20,541 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-16 21:41:20,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:20" (1/1) ... [2025-03-16 21:41:20,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:20" (1/1) ... [2025-03-16 21:41:20,549 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:20" (1/1) ... [2025-03-16 21:41:20,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:20" (1/1) ... [2025-03-16 21:41:20,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:20" (1/1) ... [2025-03-16 21:41:20,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:20" (1/1) ... [2025-03-16 21:41:20,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:41:20,556 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:41:20,556 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:41:20,556 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:41:20,558 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:20" (1/1) ... [2025-03-16 21:41:20,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:41:20,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:41:20,585 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-16 21:41:20,592 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-16 21:41:20,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:41:20,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 21:41:20,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:41:20,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:41:20,688 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:41:20,690 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:41:20,863 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-16 21:41:20,864 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:41:20,870 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:41:20,871 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:41:20,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:41:20 BoogieIcfgContainer [2025-03-16 21:41:20,872 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:41:20,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:41:20,873 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:41:20,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:41:20,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:41:20" (1/3) ... [2025-03-16 21:41:20,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe2543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:41:20, skipping insertion in model container [2025-03-16 21:41:20,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:41:20" (2/3) ... [2025-03-16 21:41:20,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe2543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:41:20, skipping insertion in model container [2025-03-16 21:41:20,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:41:20" (3/3) ... [2025-03-16 21:41:20,878 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.diagonal_v.c [2025-03-16 21:41:20,887 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:41:20,888 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.diagonal_v.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:41:20,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:41:20,931 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;@1e30a3d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:41:20,931 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:41:20,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:20,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 21:41:20,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:20,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 21:41:20,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:20,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:20,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-03-16 21:41:20,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:41:20,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1644207602] [2025-03-16 21:41:20,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:20,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:41:20,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:41:20,954 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-16 21:41:20,955 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-16 21:41:21,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 21:41:21,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 21:41:21,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:21,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:21,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 21:41:21,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:41:21,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:21,201 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:41:21,201 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 21:41:21,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644207602] [2025-03-16 21:41:21,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644207602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:41:21,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:41:21,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 21:41:21,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934587756] [2025-03-16 21:41:21,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:41:21,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:41:21,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 21:41:21,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:41:21,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:41:21,220 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:21,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:41:21,248 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-03-16 21:41:21,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:41:21,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-16 21:41:21,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:41:21,256 INFO L225 Difference]: With dead ends: 16 [2025-03-16 21:41:21,256 INFO L226 Difference]: Without dead ends: 9 [2025-03-16 21:41:21,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-16 21:41:21,260 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:41:21,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 21:41:21,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-16 21:41:21,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-03-16 21:41:21,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:21,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-03-16 21:41:21,281 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-03-16 21:41:21,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:41:21,282 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-16 21:41:21,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:21,282 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-03-16 21:41:21,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 21:41:21,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:21,283 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-16 21:41:21,289 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-16 21:41:21,487 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-16 21:41:21,488 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:21,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:21,488 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-03-16 21:41:21,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:41:21,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1326097095] [2025-03-16 21:41:21,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:41:21,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:41:21,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:41:21,491 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-16 21:41:21,492 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-16 21:41:21,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 21:41:21,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 21:41:21,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:41:21,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:21,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-16 21:41:21,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:41:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:21,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:41:25,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:25,114 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 21:41:25,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326097095] [2025-03-16 21:41:25,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326097095] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:41:25,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 21:41:25,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-16 21:41:25,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080295801] [2025-03-16 21:41:25,116 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 21:41:25,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:41:25,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 21:41:25,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:41:25,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:41:25,118 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:25,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:41:25,196 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-03-16 21:41:25,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:41:25,196 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-16 21:41:25,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:41:25,196 INFO L225 Difference]: With dead ends: 14 [2025-03-16 21:41:25,197 INFO L226 Difference]: Without dead ends: 12 [2025-03-16 21:41:25,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-16 21:41:25,198 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:41:25,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 21:41:25,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-16 21:41:25,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2025-03-16 21:41:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:25,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-03-16 21:41:25,201 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-03-16 21:41:25,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:41:25,201 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-03-16 21:41:25,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:25,201 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-03-16 21:41:25,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 21:41:25,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:25,202 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-03-16 21:41:25,208 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-16 21:41:25,402 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-16 21:41:25,402 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:25,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:25,403 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-03-16 21:41:25,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:41:25,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [29688927] [2025-03-16 21:41:25,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 21:41:25,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:41:25,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:41:25,405 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-16 21:41:25,407 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-16 21:41:25,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-16 21:41:25,470 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 21:41:25,470 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 21:41:25,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:25,472 WARN L254 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-16 21:41:25,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:41:26,194 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:26,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:41:41,190 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:41,191 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 21:41:41,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29688927] [2025-03-16 21:41:41,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29688927] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:41:41,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 21:41:41,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-03-16 21:41:41,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846284894] [2025-03-16 21:41:41,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 21:41:41,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 21:41:41,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 21:41:41,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 21:41:41,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-16 21:41:41,192 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:43,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-03-16 21:41:45,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:41:45,191 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2025-03-16 21:41:45,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 21:41:45,193 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-16 21:41:45,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:41:45,194 INFO L225 Difference]: With dead ends: 23 [2025-03-16 21:41:45,194 INFO L226 Difference]: Without dead ends: 21 [2025-03-16 21:41:45,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2025-03-16 21:41:45,195 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:41:45,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 22 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 21:41:45,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-16 21:41:45,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2025-03-16 21:41:45,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:45,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2025-03-16 21:41:45,199 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 10 [2025-03-16 21:41:45,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:41:45,199 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2025-03-16 21:41:45,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:41:45,199 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2025-03-16 21:41:45,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 21:41:45,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:41:45,199 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1] [2025-03-16 21:41:45,205 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-16 21:41:45,400 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-16 21:41:45,400 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:41:45,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:41:45,400 INFO L85 PathProgramCache]: Analyzing trace with hash -706015031, now seen corresponding path program 3 times [2025-03-16 21:41:45,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:41:45,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [466438468] [2025-03-16 21:41:45,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 21:41:45,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:41:45,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:41:45,403 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-16 21:41:45,404 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-16 21:41:45,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 6 equivalence classes. [2025-03-16 21:41:45,511 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 21:41:45,512 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-16 21:41:45,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:41:45,514 WARN L254 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-16 21:41:45,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:41:48,344 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:41:48,344 INFO L312 TraceCheckSpWp]: Computing backward predicates...