./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/interleave_bits.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/interleave_bits.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:52:13,239 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:52:13,297 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:52:13,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:52:13,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:52:13,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:52:13,322 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:52:13,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:52:13,323 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:52:13,323 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:52:13,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:52:13,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:52:13,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:52:13,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:52:13,324 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:52:13,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:52:13,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:52:13,324 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:52:13,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:52:13,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:52:13,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:52:13,325 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:52:13,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:52:13,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:52:13,325 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:52:13,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:52:13,325 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:52:13,325 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:52:13,325 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:52:13,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:52:13,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:52:13,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:52:13,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:52:13,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:52:13,325 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:52:13,325 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:52:13,325 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:52:13,325 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:52:13,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:52:13,325 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:52:13,326 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:52:13,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:52:13,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:52:13,326 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb [2025-03-08 00:52:13,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:52:13,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:52:13,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:52:13,537 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:52:13,537 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:52:13,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/interleave_bits.i [2025-03-08 00:52:14,628 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb5b36f7b/c0fac5f347294b0dbd4a7d19a03662f6/FLAG4f96f3949 [2025-03-08 00:52:14,881 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:52:14,881 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2025-03-08 00:52:14,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb5b36f7b/c0fac5f347294b0dbd4a7d19a03662f6/FLAG4f96f3949 [2025-03-08 00:52:14,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb5b36f7b/c0fac5f347294b0dbd4a7d19a03662f6 [2025-03-08 00:52:14,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:52:14,906 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:52:14,907 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:52:14,907 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:52:14,910 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:52:14,910 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:52:14" (1/1) ... [2025-03-08 00:52:14,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f3c0f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:14, skipping insertion in model container [2025-03-08 00:52:14,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:52:14" (1/1) ... [2025-03-08 00:52:14,924 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:52:15,023 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2025-03-08 00:52:15,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:52:15,046 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:52:15,052 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2025-03-08 00:52:15,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:52:15,068 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:52:15,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:15 WrapperNode [2025-03-08 00:52:15,069 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:52:15,070 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:52:15,070 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:52:15,071 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:52:15,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:15" (1/1) ... [2025-03-08 00:52:15,080 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:15" (1/1) ... [2025-03-08 00:52:15,101 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 232 [2025-03-08 00:52:15,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:52:15,102 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:52:15,102 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:52:15,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:52:15,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:15" (1/1) ... [2025-03-08 00:52:15,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:15" (1/1) ... [2025-03-08 00:52:15,109 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:15" (1/1) ... [2025-03-08 00:52:15,117 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 00:52:15,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:15" (1/1) ... [2025-03-08 00:52:15,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:15" (1/1) ... [2025-03-08 00:52:15,120 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:15" (1/1) ... [2025-03-08 00:52:15,121 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:15" (1/1) ... [2025-03-08 00:52:15,122 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:15" (1/1) ... [2025-03-08 00:52:15,122 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:15" (1/1) ... [2025-03-08 00:52:15,124 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:52:15,124 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:52:15,124 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:52:15,124 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:52:15,125 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:15" (1/1) ... [2025-03-08 00:52:15,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:52:15,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:52:15,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:52:15,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:52:15,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:52:15,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:52:15,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:52:15,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:52:15,208 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:52:15,209 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:52:15,908 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-03-08 00:52:15,909 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:52:15,947 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:52:15,948 INFO L336 CfgBuilder]: Removed 4 assume(true) statements. [2025-03-08 00:52:15,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:52:15 BoogieIcfgContainer [2025-03-08 00:52:15,949 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:52:15,950 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:52:15,950 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:52:15,953 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:52:15,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:52:14" (1/3) ... [2025-03-08 00:52:15,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f1a362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:52:15, skipping insertion in model container [2025-03-08 00:52:15,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:15" (2/3) ... [2025-03-08 00:52:15,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f1a362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:52:15, skipping insertion in model container [2025-03-08 00:52:15,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:52:15" (3/3) ... [2025-03-08 00:52:15,955 INFO L128 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2025-03-08 00:52:15,965 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:52:15,966 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interleave_bits.i that has 1 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 00:52:16,001 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:52:16,009 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;@dfe2451, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:52:16,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:52:16,013 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 89 states have (on average 1.550561797752809) internal successors, (138), 90 states have internal predecessors, (138), 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-08 00:52:16,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 00:52:16,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:16,017 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:16,017 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:16,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:16,020 INFO L85 PathProgramCache]: Analyzing trace with hash -700491744, now seen corresponding path program 1 times [2025-03-08 00:52:16,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:16,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575957730] [2025-03-08 00:52:16,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:16,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:16,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 00:52:16,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:52:16,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:16,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:16,288 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-08 00:52:16,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:16,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575957730] [2025-03-08 00:52:16,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575957730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:52:16,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:52:16,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:52:16,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645305449] [2025-03-08 00:52:16,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:52:16,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:52:16,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:16,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:52:16,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:52:16,306 INFO L87 Difference]: Start difference. First operand has 91 states, 89 states have (on average 1.550561797752809) internal successors, (138), 90 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:52:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:16,408 INFO L93 Difference]: Finished difference Result 199 states and 306 transitions. [2025-03-08 00:52:16,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:52:16,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-08 00:52:16,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:16,413 INFO L225 Difference]: With dead ends: 199 [2025-03-08 00:52:16,413 INFO L226 Difference]: Without dead ends: 106 [2025-03-08 00:52:16,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:52:16,420 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 27 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:16,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 204 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:52:16,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-08 00:52:16,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2025-03-08 00:52:16,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 93 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-08 00:52:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 142 transitions. [2025-03-08 00:52:16,441 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 142 transitions. Word has length 31 [2025-03-08 00:52:16,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:16,441 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 142 transitions. [2025-03-08 00:52:16,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-08 00:52:16,441 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 142 transitions. [2025-03-08 00:52:16,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 00:52:16,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:16,442 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:16,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:52:16,443 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:16,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:16,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1047791467, now seen corresponding path program 1 times [2025-03-08 00:52:16,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:16,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052723610] [2025-03-08 00:52:16,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:16,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:16,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 00:52:16,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:52:16,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:16,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:16,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:16,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:16,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052723610] [2025-03-08 00:52:16,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052723610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:52:16,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166289134] [2025-03-08 00:52:16,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:16,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:16,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:52:16,638 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:52:16,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:52:16,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 00:52:16,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:52:16,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:16,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:16,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 00:52:16,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:52:16,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:16,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:52:16,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:16,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166289134] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:52:16,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:52:16,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 00:52:16,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527970981] [2025-03-08 00:52:16,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:52:16,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:52:16,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:16,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:52:16,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:52:16,778 INFO L87 Difference]: Start difference. First operand 94 states and 142 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 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-08 00:52:16,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:16,943 INFO L93 Difference]: Finished difference Result 236 states and 364 transitions. [2025-03-08 00:52:16,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:52:16,944 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 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 41 [2025-03-08 00:52:16,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:16,945 INFO L225 Difference]: With dead ends: 236 [2025-03-08 00:52:16,945 INFO L226 Difference]: Without dead ends: 151 [2025-03-08 00:52:16,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:52:16,947 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 157 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:16,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 498 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:52:16,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-08 00:52:16,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-03-08 00:52:16,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.52) internal successors, (228), 150 states have internal predecessors, (228), 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-08 00:52:16,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 228 transitions. [2025-03-08 00:52:16,961 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 228 transitions. Word has length 41 [2025-03-08 00:52:16,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:16,962 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 228 transitions. [2025-03-08 00:52:16,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 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-08 00:52:16,962 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 228 transitions. [2025-03-08 00:52:16,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 00:52:16,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:16,963 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:16,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 00:52:17,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:17,169 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:17,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:17,170 INFO L85 PathProgramCache]: Analyzing trace with hash 964484868, now seen corresponding path program 1 times [2025-03-08 00:52:17,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:17,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892140125] [2025-03-08 00:52:17,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:17,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:17,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 00:52:17,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 00:52:17,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:17,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 00:52:17,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:17,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892140125] [2025-03-08 00:52:17,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892140125] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:52:17,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21608376] [2025-03-08 00:52:17,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:17,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:17,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:52:17,433 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:52:17,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 00:52:17,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 00:52:17,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 00:52:17,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:17,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:17,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 00:52:17,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:52:17,552 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 00:52:17,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:52:17,640 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 00:52:17,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21608376] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:52:17,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:52:17,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-08 00:52:17,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318476301] [2025-03-08 00:52:17,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:52:17,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 00:52:17,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:17,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 00:52:17,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:52:17,643 INFO L87 Difference]: Start difference. First operand 151 states and 228 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 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-08 00:52:17,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:17,824 INFO L93 Difference]: Finished difference Result 256 states and 390 transitions. [2025-03-08 00:52:17,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:52:17,824 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 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 75 [2025-03-08 00:52:17,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:17,826 INFO L225 Difference]: With dead ends: 256 [2025-03-08 00:52:17,827 INFO L226 Difference]: Without dead ends: 151 [2025-03-08 00:52:17,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:52:17,828 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 290 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:17,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 465 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:52:17,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-08 00:52:17,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-03-08 00:52:17,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.4933333333333334) internal successors, (224), 150 states have internal predecessors, (224), 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-08 00:52:17,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 224 transitions. [2025-03-08 00:52:17,837 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 224 transitions. Word has length 75 [2025-03-08 00:52:17,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:17,837 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 224 transitions. [2025-03-08 00:52:17,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 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-08 00:52:17,838 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 224 transitions. [2025-03-08 00:52:17,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 00:52:17,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:17,842 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:17,849 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-08 00:52:18,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 00:52:18,047 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:18,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:18,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1053237580, now seen corresponding path program 2 times [2025-03-08 00:52:18,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:18,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527254264] [2025-03-08 00:52:18,047 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:52:18,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:18,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-08 00:52:18,069 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 00:52:18,069 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:52:18,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:18,247 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:18,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:18,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527254264] [2025-03-08 00:52:18,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527254264] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:52:18,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805011362] [2025-03-08 00:52:18,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:52:18,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:18,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:52:18,251 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:52:18,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:52:18,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-08 00:52:18,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 00:52:18,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:52:18,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:18,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 00:52:18,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:52:18,376 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:18,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:52:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:18,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805011362] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:52:18,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:52:18,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-08 00:52:18,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213429057] [2025-03-08 00:52:18,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:52:18,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 00:52:18,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:18,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 00:52:18,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:52:18,519 INFO L87 Difference]: Start difference. First operand 151 states and 224 transitions. Second operand has 13 states, 13 states have (on average 9.76923076923077) internal successors, (127), 13 states have internal predecessors, (127), 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-08 00:52:18,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:18,962 INFO L93 Difference]: Finished difference Result 346 states and 518 transitions. [2025-03-08 00:52:18,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:52:18,962 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.76923076923077) internal successors, (127), 13 states have internal predecessors, (127), 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 77 [2025-03-08 00:52:18,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:18,963 INFO L225 Difference]: With dead ends: 346 [2025-03-08 00:52:18,963 INFO L226 Difference]: Without dead ends: 283 [2025-03-08 00:52:18,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:52:18,964 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 699 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:18,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1042 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:52:18,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-08 00:52:18,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2025-03-08 00:52:18,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.475177304964539) internal successors, (416), 282 states have internal predecessors, (416), 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-08 00:52:18,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 416 transitions. [2025-03-08 00:52:18,982 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 416 transitions. Word has length 77 [2025-03-08 00:52:18,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:18,982 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 416 transitions. [2025-03-08 00:52:18,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.76923076923077) internal successors, (127), 13 states have internal predecessors, (127), 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-08 00:52:18,982 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 416 transitions. [2025-03-08 00:52:18,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 00:52:18,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:18,987 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:18,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 00:52:19,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:19,188 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:19,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:19,188 INFO L85 PathProgramCache]: Analyzing trace with hash 542884922, now seen corresponding path program 3 times [2025-03-08 00:52:19,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:19,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413584992] [2025-03-08 00:52:19,188 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:52:19,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:19,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 149 statements into 11 equivalence classes. [2025-03-08 00:52:19,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 43 of 149 statements. [2025-03-08 00:52:19,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:52:19,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-03-08 00:52:19,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:19,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413584992] [2025-03-08 00:52:19,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413584992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:52:19,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:52:19,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 00:52:19,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011625060] [2025-03-08 00:52:19,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:52:19,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:52:19,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:19,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:52:19,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:52:19,496 INFO L87 Difference]: Start difference. First operand 283 states and 416 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 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-08 00:52:19,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:19,745 INFO L93 Difference]: Finished difference Result 883 states and 1346 transitions. [2025-03-08 00:52:19,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 00:52:19,745 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 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 149 [2025-03-08 00:52:19,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:19,749 INFO L225 Difference]: With dead ends: 883 [2025-03-08 00:52:19,750 INFO L226 Difference]: Without dead ends: 611 [2025-03-08 00:52:19,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:52:19,752 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 108 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:19,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 909 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:52:19,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-03-08 00:52:19,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 604. [2025-03-08 00:52:19,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 603 states have (on average 1.4378109452736318) internal successors, (867), 603 states have internal predecessors, (867), 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-08 00:52:19,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 867 transitions. [2025-03-08 00:52:19,786 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 867 transitions. Word has length 149 [2025-03-08 00:52:19,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:19,787 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 867 transitions. [2025-03-08 00:52:19,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 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-08 00:52:19,787 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 867 transitions. [2025-03-08 00:52:19,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 00:52:19,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:19,791 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:19,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 00:52:19,792 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:19,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:19,792 INFO L85 PathProgramCache]: Analyzing trace with hash 102013326, now seen corresponding path program 1 times [2025-03-08 00:52:19,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:19,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639017176] [2025-03-08 00:52:19,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:19,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:19,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 00:52:19,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 00:52:19,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:19,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:20,078 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2025-03-08 00:52:20,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:20,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639017176] [2025-03-08 00:52:20,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639017176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:52:20,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:52:20,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:52:20,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941588635] [2025-03-08 00:52:20,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:52:20,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:52:20,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:20,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:52:20,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:52:20,081 INFO L87 Difference]: Start difference. First operand 604 states and 867 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 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-08 00:52:20,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:20,149 INFO L93 Difference]: Finished difference Result 1390 states and 2019 transitions. [2025-03-08 00:52:20,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:52:20,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 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 150 [2025-03-08 00:52:20,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:20,152 INFO L225 Difference]: With dead ends: 1390 [2025-03-08 00:52:20,155 INFO L226 Difference]: Without dead ends: 812 [2025-03-08 00:52:20,156 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-08 00:52:20,157 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 7 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:20,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 309 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:52:20,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2025-03-08 00:52:20,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2025-03-08 00:52:20,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 811 states have (on average 1.3958076448828607) internal successors, (1132), 811 states have internal predecessors, (1132), 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-08 00:52:20,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1132 transitions. [2025-03-08 00:52:20,188 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1132 transitions. Word has length 150 [2025-03-08 00:52:20,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:20,188 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1132 transitions. [2025-03-08 00:52:20,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 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-08 00:52:20,189 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1132 transitions. [2025-03-08 00:52:20,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 00:52:20,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:20,192 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:20,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 00:52:20,192 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:20,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:20,192 INFO L85 PathProgramCache]: Analyzing trace with hash -145054317, now seen corresponding path program 1 times [2025-03-08 00:52:20,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:20,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376891584] [2025-03-08 00:52:20,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:20,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:20,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 00:52:20,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 00:52:20,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:20,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:20,591 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:20,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:20,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376891584] [2025-03-08 00:52:20,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376891584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:52:20,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291194633] [2025-03-08 00:52:20,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:20,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:20,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:52:20,593 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:52:20,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 00:52:20,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 00:52:20,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 00:52:20,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:20,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:20,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 00:52:20,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:52:20,729 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-08 00:52:20,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:52:20,748 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-03-08 00:52:20,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291194633] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 00:52:20,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:52:20,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13, 6] total 17 [2025-03-08 00:52:20,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796304482] [2025-03-08 00:52:20,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:52:20,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:52:20,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:20,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:52:20,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:52:20,752 INFO L87 Difference]: Start difference. First operand 812 states and 1132 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:52:20,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:20,804 INFO L93 Difference]: Finished difference Result 823 states and 1147 transitions. [2025-03-08 00:52:20,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:52:20,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2025-03-08 00:52:20,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:20,807 INFO L225 Difference]: With dead ends: 823 [2025-03-08 00:52:20,807 INFO L226 Difference]: Without dead ends: 815 [2025-03-08 00:52:20,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:52:20,808 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 1 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:20,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 205 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:52:20,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2025-03-08 00:52:20,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 815. [2025-03-08 00:52:20,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 814 states have (on average 1.3968058968058967) internal successors, (1137), 814 states have internal predecessors, (1137), 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-08 00:52:20,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1137 transitions. [2025-03-08 00:52:20,844 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1137 transitions. Word has length 150 [2025-03-08 00:52:20,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:20,844 INFO L471 AbstractCegarLoop]: Abstraction has 815 states and 1137 transitions. [2025-03-08 00:52:20,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:52:20,844 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1137 transitions. [2025-03-08 00:52:20,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 00:52:20,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:20,849 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:20,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 00:52:21,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:21,050 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:21,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:21,050 INFO L85 PathProgramCache]: Analyzing trace with hash -345757458, now seen corresponding path program 1 times [2025-03-08 00:52:21,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:21,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405690826] [2025-03-08 00:52:21,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:21,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:21,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 00:52:21,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 00:52:21,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:21,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:21,399 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:21,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:21,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405690826] [2025-03-08 00:52:21,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405690826] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:52:21,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583476357] [2025-03-08 00:52:21,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:21,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:21,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:52:21,402 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:52:21,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 00:52:21,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 00:52:21,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 00:52:21,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:21,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:21,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:52:21,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:52:21,541 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-08 00:52:21,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:52:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-03-08 00:52:21,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583476357] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 00:52:21,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:52:21,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13, 5] total 17 [2025-03-08 00:52:21,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785525532] [2025-03-08 00:52:21,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:52:21,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:52:21,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:21,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:52:21,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:52:21,595 INFO L87 Difference]: Start difference. First operand 815 states and 1137 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:52:21,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:21,673 INFO L93 Difference]: Finished difference Result 883 states and 1239 transitions. [2025-03-08 00:52:21,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:52:21,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2025-03-08 00:52:21,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:21,676 INFO L225 Difference]: With dead ends: 883 [2025-03-08 00:52:21,676 INFO L226 Difference]: Without dead ends: 874 [2025-03-08 00:52:21,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:52:21,677 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 32 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:21,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 292 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:52:21,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-03-08 00:52:21,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2025-03-08 00:52:21,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 873 states have (on average 1.4054982817869415) internal successors, (1227), 873 states have internal predecessors, (1227), 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-08 00:52:21,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1227 transitions. [2025-03-08 00:52:21,697 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1227 transitions. Word has length 150 [2025-03-08 00:52:21,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:21,697 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1227 transitions. [2025-03-08 00:52:21,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:52:21,698 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1227 transitions. [2025-03-08 00:52:21,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 00:52:21,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:21,700 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:21,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 00:52:21,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:21,905 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:21,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:21,905 INFO L85 PathProgramCache]: Analyzing trace with hash 798402832, now seen corresponding path program 1 times [2025-03-08 00:52:21,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:21,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300003499] [2025-03-08 00:52:21,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:21,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:21,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 00:52:21,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 00:52:21,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:21,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:22,047 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 91 proven. 9 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2025-03-08 00:52:22,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:22,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300003499] [2025-03-08 00:52:22,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300003499] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:52:22,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088938741] [2025-03-08 00:52:22,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:22,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:22,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:52:22,049 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:52:22,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 00:52:22,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 00:52:22,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 00:52:22,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:22,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:22,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 00:52:22,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:52:22,325 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 46 proven. 102 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-03-08 00:52:22,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:52:22,556 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 139 proven. 9 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-03-08 00:52:22,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088938741] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:52:22,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:52:22,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 6] total 11 [2025-03-08 00:52:22,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236741532] [2025-03-08 00:52:22,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:52:22,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:52:22,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:22,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:52:22,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:52:22,558 INFO L87 Difference]: Start difference. First operand 874 states and 1227 transitions. Second operand has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 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-08 00:52:22,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:22,729 INFO L93 Difference]: Finished difference Result 2060 states and 2861 transitions. [2025-03-08 00:52:22,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:52:22,730 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 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 150 [2025-03-08 00:52:22,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:22,733 INFO L225 Difference]: With dead ends: 2060 [2025-03-08 00:52:22,733 INFO L226 Difference]: Without dead ends: 1285 [2025-03-08 00:52:22,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:52:22,735 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 92 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:22,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 610 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:52:22,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2025-03-08 00:52:22,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1285. [2025-03-08 00:52:22,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1284 states have (on average 1.3450155763239875) internal successors, (1727), 1284 states have internal predecessors, (1727), 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-08 00:52:22,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1727 transitions. [2025-03-08 00:52:22,764 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1727 transitions. Word has length 150 [2025-03-08 00:52:22,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:22,764 INFO L471 AbstractCegarLoop]: Abstraction has 1285 states and 1727 transitions. [2025-03-08 00:52:22,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 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-08 00:52:22,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1727 transitions. [2025-03-08 00:52:22,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 00:52:22,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:22,767 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:22,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 00:52:22,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:22,968 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:22,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:22,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1714677952, now seen corresponding path program 1 times [2025-03-08 00:52:22,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:22,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964948937] [2025-03-08 00:52:22,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:22,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:22,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 00:52:22,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 00:52:22,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:22,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:23,273 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:23,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:23,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964948937] [2025-03-08 00:52:23,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964948937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:52:23,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670558169] [2025-03-08 00:52:23,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:23,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:23,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:52:23,276 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:52:23,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 00:52:23,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 00:52:23,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 00:52:23,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:23,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:23,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 00:52:23,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:52:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-08 00:52:23,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:52:23,457 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-03-08 00:52:23,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670558169] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 00:52:23,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:52:23,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13, 6] total 19 [2025-03-08 00:52:23,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586698416] [2025-03-08 00:52:23,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:52:23,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 00:52:23,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:23,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 00:52:23,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:52:23,459 INFO L87 Difference]: Start difference. First operand 1285 states and 1727 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-08 00:52:23,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:23,612 INFO L93 Difference]: Finished difference Result 1328 states and 1787 transitions. [2025-03-08 00:52:23,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 00:52:23,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 151 [2025-03-08 00:52:23,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:23,616 INFO L225 Difference]: With dead ends: 1328 [2025-03-08 00:52:23,616 INFO L226 Difference]: Without dead ends: 1300 [2025-03-08 00:52:23,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:52:23,618 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 1 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:23,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 382 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:52:23,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2025-03-08 00:52:23,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1300. [2025-03-08 00:52:23,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 1299 states have (on average 1.342571208622017) internal successors, (1744), 1299 states have internal predecessors, (1744), 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-08 00:52:23,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1744 transitions. [2025-03-08 00:52:23,640 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1744 transitions. Word has length 151 [2025-03-08 00:52:23,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:23,640 INFO L471 AbstractCegarLoop]: Abstraction has 1300 states and 1744 transitions. [2025-03-08 00:52:23,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-08 00:52:23,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1744 transitions. [2025-03-08 00:52:23,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 00:52:23,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:23,642 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:23,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 00:52:23,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:23,843 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:23,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:23,844 INFO L85 PathProgramCache]: Analyzing trace with hash 402067445, now seen corresponding path program 1 times [2025-03-08 00:52:23,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:23,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146551687] [2025-03-08 00:52:23,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:23,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:23,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 00:52:23,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 00:52:23,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:23,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:24,112 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:24,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:24,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146551687] [2025-03-08 00:52:24,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146551687] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:52:24,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694789260] [2025-03-08 00:52:24,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:24,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:24,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:52:24,115 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:52:24,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 00:52:24,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 00:52:24,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 00:52:24,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:24,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:24,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 00:52:24,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:52:24,231 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-08 00:52:24,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:52:24,282 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-03-08 00:52:24,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694789260] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 00:52:24,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:52:24,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13, 6] total 17 [2025-03-08 00:52:24,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702688839] [2025-03-08 00:52:24,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:52:24,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:52:24,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:24,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:52:24,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:52:24,284 INFO L87 Difference]: Start difference. First operand 1300 states and 1744 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-08 00:52:24,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:24,335 INFO L93 Difference]: Finished difference Result 1380 states and 1864 transitions. [2025-03-08 00:52:24,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:52:24,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 151 [2025-03-08 00:52:24,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:24,340 INFO L225 Difference]: With dead ends: 1380 [2025-03-08 00:52:24,340 INFO L226 Difference]: Without dead ends: 1304 [2025-03-08 00:52:24,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:52:24,342 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 1 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:24,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 205 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:52:24,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2025-03-08 00:52:24,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1304. [2025-03-08 00:52:24,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 1303 states have (on average 1.343054489639294) internal successors, (1750), 1303 states have internal predecessors, (1750), 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-08 00:52:24,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1750 transitions. [2025-03-08 00:52:24,362 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1750 transitions. Word has length 151 [2025-03-08 00:52:24,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:24,362 INFO L471 AbstractCegarLoop]: Abstraction has 1304 states and 1750 transitions. [2025-03-08 00:52:24,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-08 00:52:24,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1750 transitions. [2025-03-08 00:52:24,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 00:52:24,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:24,365 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:24,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 00:52:24,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 00:52:24,565 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:24,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:24,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1597993114, now seen corresponding path program 1 times [2025-03-08 00:52:24,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:24,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309471962] [2025-03-08 00:52:24,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:24,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:24,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 00:52:24,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 00:52:24,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:24,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:24,695 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 99 proven. 9 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-03-08 00:52:24,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:24,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309471962] [2025-03-08 00:52:24,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309471962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:52:24,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137258579] [2025-03-08 00:52:24,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:24,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:24,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:52:24,697 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:52:24,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 00:52:24,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 00:52:24,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 00:52:24,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:24,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:24,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 00:52:24,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:52:24,964 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 81 proven. 99 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-03-08 00:52:24,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:52:25,161 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 171 proven. 9 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-03-08 00:52:25,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137258579] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:52:25,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:52:25,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 6] total 11 [2025-03-08 00:52:25,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938216302] [2025-03-08 00:52:25,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:52:25,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:52:25,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:25,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:52:25,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:52:25,163 INFO L87 Difference]: Start difference. First operand 1304 states and 1750 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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-08 00:52:25,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:25,350 INFO L93 Difference]: Finished difference Result 2971 states and 3947 transitions. [2025-03-08 00:52:25,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:52:25,351 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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 151 [2025-03-08 00:52:25,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:25,355 INFO L225 Difference]: With dead ends: 2971 [2025-03-08 00:52:25,356 INFO L226 Difference]: Without dead ends: 1753 [2025-03-08 00:52:25,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:52:25,358 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 71 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:25,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 764 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:52:25,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2025-03-08 00:52:25,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1753. [2025-03-08 00:52:25,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1753 states, 1752 states have (on average 1.3013698630136987) internal successors, (2280), 1752 states have internal predecessors, (2280), 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-08 00:52:25,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2280 transitions. [2025-03-08 00:52:25,389 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2280 transitions. Word has length 151 [2025-03-08 00:52:25,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:25,390 INFO L471 AbstractCegarLoop]: Abstraction has 1753 states and 2280 transitions. [2025-03-08 00:52:25,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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-08 00:52:25,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2280 transitions. [2025-03-08 00:52:25,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 00:52:25,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:25,393 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:25,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 00:52:25,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:25,594 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:25,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:25,595 INFO L85 PathProgramCache]: Analyzing trace with hash 427282832, now seen corresponding path program 2 times [2025-03-08 00:52:25,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:25,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109949451] [2025-03-08 00:52:25,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:52:25,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:25,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 151 statements into 2 equivalence classes. [2025-03-08 00:52:25,617 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 00:52:25,617 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:52:25,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:25,848 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 0 proven. 533 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:25,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:25,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109949451] [2025-03-08 00:52:25,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109949451] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:52:25,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694559703] [2025-03-08 00:52:25,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:52:25,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:25,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:52:25,850 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:52:25,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 00:52:25,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 151 statements into 2 equivalence classes. [2025-03-08 00:52:25,928 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 00:52:25,929 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:52:25,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:25,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 00:52:25,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:52:25,973 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2025-03-08 00:52:25,973 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:52:25,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694559703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:52:25,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:52:25,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 15 [2025-03-08 00:52:25,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107965354] [2025-03-08 00:52:25,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:52:25,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 00:52:25,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:25,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 00:52:25,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:52:25,975 INFO L87 Difference]: Start difference. First operand 1753 states and 2280 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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-08 00:52:26,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:26,045 INFO L93 Difference]: Finished difference Result 2924 states and 3869 transitions. [2025-03-08 00:52:26,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 00:52:26,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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 151 [2025-03-08 00:52:26,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:26,050 INFO L225 Difference]: With dead ends: 2924 [2025-03-08 00:52:26,050 INFO L226 Difference]: Without dead ends: 1755 [2025-03-08 00:52:26,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:52:26,052 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 18 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:26,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 211 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:52:26,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2025-03-08 00:52:26,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1755. [2025-03-08 00:52:26,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1754 states have (on average 1.3010262257696694) internal successors, (2282), 1754 states have internal predecessors, (2282), 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-08 00:52:26,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2282 transitions. [2025-03-08 00:52:26,082 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2282 transitions. Word has length 151 [2025-03-08 00:52:26,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:26,082 INFO L471 AbstractCegarLoop]: Abstraction has 1755 states and 2282 transitions. [2025-03-08 00:52:26,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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-08 00:52:26,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2282 transitions. [2025-03-08 00:52:26,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 00:52:26,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:26,085 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:26,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 00:52:26,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 00:52:26,286 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:26,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:26,286 INFO L85 PathProgramCache]: Analyzing trace with hash 850324759, now seen corresponding path program 1 times [2025-03-08 00:52:26,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:26,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752123826] [2025-03-08 00:52:26,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:26,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:26,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 00:52:26,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 00:52:26,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:26,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:26,517 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:26,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:26,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752123826] [2025-03-08 00:52:26,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752123826] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:52:26,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651286074] [2025-03-08 00:52:26,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:26,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:26,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:52:26,520 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:52:26,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 00:52:26,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 00:52:26,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 00:52:26,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:26,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:26,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:52:26,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:52:26,619 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-08 00:52:26,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:52:26,647 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-03-08 00:52:26,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651286074] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 00:52:26,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:52:26,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13, 5] total 17 [2025-03-08 00:52:26,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78644840] [2025-03-08 00:52:26,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:52:26,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:52:26,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:26,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:52:26,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:52:26,649 INFO L87 Difference]: Start difference. First operand 1755 states and 2282 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:52:26,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:26,765 INFO L93 Difference]: Finished difference Result 1776 states and 2307 transitions. [2025-03-08 00:52:26,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:52:26,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2025-03-08 00:52:26,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:26,770 INFO L225 Difference]: With dead ends: 1776 [2025-03-08 00:52:26,770 INFO L226 Difference]: Without dead ends: 1749 [2025-03-08 00:52:26,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:52:26,771 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:26,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:52:26,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2025-03-08 00:52:26,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1749. [2025-03-08 00:52:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1749 states, 1748 states have (on average 1.299771167048055) internal successors, (2272), 1748 states have internal predecessors, (2272), 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-08 00:52:26,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2272 transitions. [2025-03-08 00:52:26,797 INFO L78 Accepts]: Start accepts. Automaton has 1749 states and 2272 transitions. Word has length 152 [2025-03-08 00:52:26,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:26,798 INFO L471 AbstractCegarLoop]: Abstraction has 1749 states and 2272 transitions. [2025-03-08 00:52:26,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:52:26,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2272 transitions. [2025-03-08 00:52:26,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 00:52:26,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:26,800 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:26,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 00:52:27,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 00:52:27,004 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:27,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:27,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1074330685, now seen corresponding path program 1 times [2025-03-08 00:52:27,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:27,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004750093] [2025-03-08 00:52:27,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:27,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:27,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 00:52:27,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 00:52:27,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:27,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:27,240 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:27,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:27,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004750093] [2025-03-08 00:52:27,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004750093] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:52:27,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410237154] [2025-03-08 00:52:27,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:27,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:27,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:52:27,243 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:52:27,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 00:52:27,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 00:52:27,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 00:52:27,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:27,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:27,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 00:52:27,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:52:27,354 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-08 00:52:27,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:52:27,396 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-03-08 00:52:27,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410237154] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 00:52:27,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:52:27,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13, 6] total 19 [2025-03-08 00:52:27,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058502601] [2025-03-08 00:52:27,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:52:27,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 00:52:27,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:27,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 00:52:27,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:52:27,399 INFO L87 Difference]: Start difference. First operand 1749 states and 2272 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:52:27,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:27,490 INFO L93 Difference]: Finished difference Result 1903 states and 2499 transitions. [2025-03-08 00:52:27,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 00:52:27,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2025-03-08 00:52:27,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:27,495 INFO L225 Difference]: With dead ends: 1903 [2025-03-08 00:52:27,495 INFO L226 Difference]: Without dead ends: 1757 [2025-03-08 00:52:27,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:52:27,497 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 1 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:27,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 383 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:52:27,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2025-03-08 00:52:27,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1757. [2025-03-08 00:52:27,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1757 states, 1756 states have (on average 1.2995444191343963) internal successors, (2282), 1756 states have internal predecessors, (2282), 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-08 00:52:27,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 2282 transitions. [2025-03-08 00:52:27,522 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 2282 transitions. Word has length 152 [2025-03-08 00:52:27,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:27,522 INFO L471 AbstractCegarLoop]: Abstraction has 1757 states and 2282 transitions. [2025-03-08 00:52:27,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:52:27,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 2282 transitions. [2025-03-08 00:52:27,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 00:52:27,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:27,525 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:27,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-08 00:52:27,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 00:52:27,726 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:27,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:27,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1967913310, now seen corresponding path program 1 times [2025-03-08 00:52:27,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:27,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102842389] [2025-03-08 00:52:27,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:27,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:27,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 00:52:27,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 00:52:27,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:27,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:28,005 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 0 proven. 533 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:28,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:28,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102842389] [2025-03-08 00:52:28,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102842389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:52:28,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838933024] [2025-03-08 00:52:28,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:28,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:28,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:52:28,008 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:52:28,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 00:52:28,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 00:52:28,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 00:52:28,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:28,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:28,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 00:52:28,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:52:28,531 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 37 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:28,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:52:29,179 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 56 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:29,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838933024] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:52:29,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:52:29,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 16] total 39 [2025-03-08 00:52:29,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803811353] [2025-03-08 00:52:29,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:52:29,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-08 00:52:29,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:29,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-08 00:52:29,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=1067, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 00:52:29,181 INFO L87 Difference]: Start difference. First operand 1757 states and 2282 transitions. Second operand has 39 states, 39 states have (on average 10.025641025641026) internal successors, (391), 39 states have internal predecessors, (391), 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-08 00:52:39,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:39,619 INFO L93 Difference]: Finished difference Result 3429 states and 4501 transitions. [2025-03-08 00:52:39,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-03-08 00:52:39,620 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 10.025641025641026) internal successors, (391), 39 states have internal predecessors, (391), 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 152 [2025-03-08 00:52:39,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:39,626 INFO L225 Difference]: With dead ends: 3429 [2025-03-08 00:52:39,627 INFO L226 Difference]: Without dead ends: 3115 [2025-03-08 00:52:39,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2393 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=2134, Invalid=4186, Unknown=0, NotChecked=0, Total=6320 [2025-03-08 00:52:39,629 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 2462 mSDsluCounter, 4138 mSDsCounter, 0 mSdLazyCounter, 4799 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2462 SdHoareTripleChecker+Valid, 4423 SdHoareTripleChecker+Invalid, 4872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 4799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:39,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2462 Valid, 4423 Invalid, 4872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 4799 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 00:52:39,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3115 states. [2025-03-08 00:52:39,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3115 to 2288. [2025-03-08 00:52:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2288 states, 2287 states have (on average 1.2942719720157412) internal successors, (2960), 2287 states have internal predecessors, (2960), 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-08 00:52:39,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2288 states to 2288 states and 2960 transitions. [2025-03-08 00:52:39,665 INFO L78 Accepts]: Start accepts. Automaton has 2288 states and 2960 transitions. Word has length 152 [2025-03-08 00:52:39,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:39,666 INFO L471 AbstractCegarLoop]: Abstraction has 2288 states and 2960 transitions. [2025-03-08 00:52:39,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 10.025641025641026) internal successors, (391), 39 states have internal predecessors, (391), 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-08 00:52:39,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 2960 transitions. [2025-03-08 00:52:39,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 00:52:39,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:39,669 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:39,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-08 00:52:39,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 00:52:39,874 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:39,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:39,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1957788059, now seen corresponding path program 2 times [2025-03-08 00:52:39,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:39,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573564649] [2025-03-08 00:52:39,874 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:52:39,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:39,882 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 188 statements into 2 equivalence classes. [2025-03-08 00:52:39,901 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 00:52:39,901 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:52:39,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:40,168 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 0 proven. 926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:40,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:40,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573564649] [2025-03-08 00:52:40,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573564649] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:52:40,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556504223] [2025-03-08 00:52:40,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:52:40,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:40,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:52:40,171 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:52:40,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 00:52:40,214 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 188 statements into 2 equivalence classes. [2025-03-08 00:52:40,254 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 00:52:40,254 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:52:40,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:40,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 00:52:40,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:52:40,315 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 794 trivial. 0 not checked. [2025-03-08 00:52:40,316 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:52:40,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556504223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:52:40,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:52:40,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 19 [2025-03-08 00:52:40,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396434329] [2025-03-08 00:52:40,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:52:40,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 00:52:40,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:40,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 00:52:40,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:52:40,317 INFO L87 Difference]: Start difference. First operand 2288 states and 2960 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-08 00:52:40,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:40,424 INFO L93 Difference]: Finished difference Result 4209 states and 5584 transitions. [2025-03-08 00:52:40,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 00:52:40,424 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 188 [2025-03-08 00:52:40,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:40,430 INFO L225 Difference]: With dead ends: 4209 [2025-03-08 00:52:40,430 INFO L226 Difference]: Without dead ends: 2689 [2025-03-08 00:52:40,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:52:40,432 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 44 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:40,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 425 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:52:40,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2689 states. [2025-03-08 00:52:40,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2689 to 2335. [2025-03-08 00:52:40,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 2334 states have (on average 1.3084832904884318) internal successors, (3054), 2334 states have internal predecessors, (3054), 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-08 00:52:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 3054 transitions. [2025-03-08 00:52:40,465 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 3054 transitions. Word has length 188 [2025-03-08 00:52:40,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:40,465 INFO L471 AbstractCegarLoop]: Abstraction has 2335 states and 3054 transitions. [2025-03-08 00:52:40,465 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-08 00:52:40,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 3054 transitions. [2025-03-08 00:52:40,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-08 00:52:40,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:40,469 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:40,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-08 00:52:40,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:40,670 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:40,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:40,670 INFO L85 PathProgramCache]: Analyzing trace with hash -397703748, now seen corresponding path program 1 times [2025-03-08 00:52:40,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:40,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850173590] [2025-03-08 00:52:40,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:40,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:40,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-08 00:52:40,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-08 00:52:40,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:40,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:40,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:40,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850173590] [2025-03-08 00:52:40,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850173590] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:52:40,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130781992] [2025-03-08 00:52:40,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:40,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:40,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:52:40,951 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:52:40,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 00:52:40,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-08 00:52:41,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-08 00:52:41,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:41,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:41,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 00:52:41,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:52:41,071 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2025-03-08 00:52:41,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:52:41,110 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2025-03-08 00:52:41,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130781992] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 00:52:41,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:52:41,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16, 6] total 22 [2025-03-08 00:52:41,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750259593] [2025-03-08 00:52:41,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:52:41,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 00:52:41,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:41,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 00:52:41,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2025-03-08 00:52:41,111 INFO L87 Difference]: Start difference. First operand 2335 states and 3054 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 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-08 00:52:41,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:41,231 INFO L93 Difference]: Finished difference Result 2419 states and 3172 transitions. [2025-03-08 00:52:41,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 00:52:41,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 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 189 [2025-03-08 00:52:41,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:41,235 INFO L225 Difference]: With dead ends: 2419 [2025-03-08 00:52:41,236 INFO L226 Difference]: Without dead ends: 2350 [2025-03-08 00:52:41,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2025-03-08 00:52:41,236 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 1 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:41,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 382 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:52:41,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2025-03-08 00:52:41,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 2350. [2025-03-08 00:52:41,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2350 states, 2349 states have (on average 1.3073648361004684) internal successors, (3071), 2349 states have internal predecessors, (3071), 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-08 00:52:41,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 3071 transitions. [2025-03-08 00:52:41,263 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 3071 transitions. Word has length 189 [2025-03-08 00:52:41,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:41,263 INFO L471 AbstractCegarLoop]: Abstraction has 2350 states and 3071 transitions. [2025-03-08 00:52:41,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 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-08 00:52:41,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 3071 transitions. [2025-03-08 00:52:41,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-08 00:52:41,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:41,266 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:41,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-08 00:52:41,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 00:52:41,469 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:41,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:41,469 INFO L85 PathProgramCache]: Analyzing trace with hash -528498115, now seen corresponding path program 1 times [2025-03-08 00:52:41,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:41,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66113358] [2025-03-08 00:52:41,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:41,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:41,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-08 00:52:41,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-08 00:52:41,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:41,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:41,788 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:41,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:41,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66113358] [2025-03-08 00:52:41,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66113358] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:52:41,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578402260] [2025-03-08 00:52:41,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:41,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:41,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:52:41,790 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:52:41,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 00:52:41,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-08 00:52:41,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-08 00:52:41,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:41,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:41,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 00:52:41,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:52:41,999 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:41,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:52:42,345 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:42,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578402260] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:52:42,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:52:42,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2025-03-08 00:52:42,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308354711] [2025-03-08 00:52:42,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:52:42,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 00:52:42,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:42,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 00:52:42,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2025-03-08 00:52:42,346 INFO L87 Difference]: Start difference. First operand 2350 states and 3071 transitions. Second operand has 31 states, 31 states have (on average 11.193548387096774) internal successors, (347), 31 states have internal predecessors, (347), 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-08 00:52:43,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:43,144 INFO L93 Difference]: Finished difference Result 3204 states and 4250 transitions. [2025-03-08 00:52:43,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 00:52:43,144 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 11.193548387096774) internal successors, (347), 31 states have internal predecessors, (347), 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 189 [2025-03-08 00:52:43,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:43,150 INFO L225 Difference]: With dead ends: 3204 [2025-03-08 00:52:43,150 INFO L226 Difference]: Without dead ends: 2987 [2025-03-08 00:52:43,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=767, Unknown=0, NotChecked=0, Total=992 [2025-03-08 00:52:43,151 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 1898 mSDsluCounter, 3833 mSDsCounter, 0 mSdLazyCounter, 3187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1898 SdHoareTripleChecker+Valid, 4136 SdHoareTripleChecker+Invalid, 3188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:43,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1898 Valid, 4136 Invalid, 3188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3187 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 00:52:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2025-03-08 00:52:43,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 2881. [2025-03-08 00:52:43,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2881 states, 2880 states have (on average 1.3038194444444444) internal successors, (3755), 2880 states have internal predecessors, (3755), 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-08 00:52:43,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2881 states and 3755 transitions. [2025-03-08 00:52:43,187 INFO L78 Accepts]: Start accepts. Automaton has 2881 states and 3755 transitions. Word has length 189 [2025-03-08 00:52:43,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:43,187 INFO L471 AbstractCegarLoop]: Abstraction has 2881 states and 3755 transitions. [2025-03-08 00:52:43,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 11.193548387096774) internal successors, (347), 31 states have internal predecessors, (347), 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-08 00:52:43,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2881 states and 3755 transitions. [2025-03-08 00:52:43,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 00:52:43,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:43,192 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:43,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-08 00:52:43,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:43,392 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:43,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:43,393 INFO L85 PathProgramCache]: Analyzing trace with hash -159123084, now seen corresponding path program 2 times [2025-03-08 00:52:43,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:43,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008358963] [2025-03-08 00:52:43,393 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:52:43,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:43,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 225 statements into 2 equivalence classes. [2025-03-08 00:52:43,403 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 225 statements. [2025-03-08 00:52:43,403 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 00:52:43,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:43,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-03-08 00:52:43,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:43,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008358963] [2025-03-08 00:52:43,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008358963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:52:43,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:52:43,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:52:43,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512202235] [2025-03-08 00:52:43,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:52:43,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:52:43,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:43,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:52:43,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:52:43,426 INFO L87 Difference]: Start difference. First operand 2881 states and 3755 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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-08 00:52:44,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:44,149 INFO L93 Difference]: Finished difference Result 3038 states and 3979 transitions. [2025-03-08 00:52:44,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:52:44,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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 225 [2025-03-08 00:52:44,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:44,154 INFO L225 Difference]: With dead ends: 3038 [2025-03-08 00:52:44,154 INFO L226 Difference]: Without dead ends: 2879 [2025-03-08 00:52:44,155 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-08 00:52:44,155 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:44,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 292 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 00:52:44,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2025-03-08 00:52:44,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 2879. [2025-03-08 00:52:44,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2879 states, 2878 states have (on average 1.3033356497567756) internal successors, (3751), 2878 states have internal predecessors, (3751), 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-08 00:52:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2879 states to 2879 states and 3751 transitions. [2025-03-08 00:52:44,187 INFO L78 Accepts]: Start accepts. Automaton has 2879 states and 3751 transitions. Word has length 225 [2025-03-08 00:52:44,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:44,187 INFO L471 AbstractCegarLoop]: Abstraction has 2879 states and 3751 transitions. [2025-03-08 00:52:44,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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-08 00:52:44,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2879 states and 3751 transitions. [2025-03-08 00:52:44,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 00:52:44,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:44,192 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 14, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:44,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 00:52:44,192 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:44,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:44,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1719186364, now seen corresponding path program 2 times [2025-03-08 00:52:44,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:44,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017706240] [2025-03-08 00:52:44,193 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:52:44,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:44,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 225 statements into 2 equivalence classes. [2025-03-08 00:52:44,244 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 00:52:44,244 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:52:44,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:44,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 1337 trivial. 0 not checked. [2025-03-08 00:52:44,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:44,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017706240] [2025-03-08 00:52:44,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017706240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:52:44,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:52:44,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:52:44,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815133831] [2025-03-08 00:52:44,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:52:44,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:52:44,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:44,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:52:44,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:52:44,462 INFO L87 Difference]: Start difference. First operand 2879 states and 3751 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-08 00:52:44,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:44,628 INFO L93 Difference]: Finished difference Result 3094 states and 4065 transitions. [2025-03-08 00:52:44,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:52:44,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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 225 [2025-03-08 00:52:44,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:44,632 INFO L225 Difference]: With dead ends: 3094 [2025-03-08 00:52:44,632 INFO L226 Difference]: Without dead ends: 2959 [2025-03-08 00:52:44,632 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-08 00:52:44,633 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 50 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:44,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 388 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:52:44,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2025-03-08 00:52:44,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 2955. [2025-03-08 00:52:44,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2955 states, 2954 states have (on average 1.3070412999322951) internal successors, (3861), 2954 states have internal predecessors, (3861), 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-08 00:52:44,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2955 states and 3861 transitions. [2025-03-08 00:52:44,664 INFO L78 Accepts]: Start accepts. Automaton has 2955 states and 3861 transitions. Word has length 225 [2025-03-08 00:52:44,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:44,665 INFO L471 AbstractCegarLoop]: Abstraction has 2955 states and 3861 transitions. [2025-03-08 00:52:44,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-08 00:52:44,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3861 transitions. [2025-03-08 00:52:44,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 00:52:44,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:44,668 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:44,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 00:52:44,668 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:44,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:44,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1909163361, now seen corresponding path program 1 times [2025-03-08 00:52:44,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:44,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151456446] [2025-03-08 00:52:44,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:44,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:44,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 00:52:44,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 00:52:44,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:44,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:45,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1427 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2025-03-08 00:52:45,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:45,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151456446] [2025-03-08 00:52:45,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151456446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:52:45,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:52:45,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 00:52:45,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214500943] [2025-03-08 00:52:45,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:52:45,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:52:45,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:45,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:52:45,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:52:45,085 INFO L87 Difference]: Start difference. First operand 2955 states and 3861 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) 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-08 00:52:45,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:45,253 INFO L93 Difference]: Finished difference Result 5513 states and 7250 transitions. [2025-03-08 00:52:45,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:52:45,254 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) 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 225 [2025-03-08 00:52:45,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:45,259 INFO L225 Difference]: With dead ends: 5513 [2025-03-08 00:52:45,259 INFO L226 Difference]: Without dead ends: 3205 [2025-03-08 00:52:45,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:52:45,262 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 48 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:45,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 460 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:52:45,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3205 states. [2025-03-08 00:52:45,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3205 to 3047. [2025-03-08 00:52:45,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3047 states, 3046 states have (on average 1.2882468811556138) internal successors, (3924), 3046 states have internal predecessors, (3924), 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-08 00:52:45,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3047 states to 3047 states and 3924 transitions. [2025-03-08 00:52:45,312 INFO L78 Accepts]: Start accepts. Automaton has 3047 states and 3924 transitions. Word has length 225 [2025-03-08 00:52:45,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:45,312 INFO L471 AbstractCegarLoop]: Abstraction has 3047 states and 3924 transitions. [2025-03-08 00:52:45,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) 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-08 00:52:45,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3047 states and 3924 transitions. [2025-03-08 00:52:45,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-08 00:52:45,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:45,316 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:45,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 00:52:45,316 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:45,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:45,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1303333547, now seen corresponding path program 1 times [2025-03-08 00:52:45,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:45,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109048094] [2025-03-08 00:52:45,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:45,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:45,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-08 00:52:45,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-08 00:52:45,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:45,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:45,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-03-08 00:52:45,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:45,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109048094] [2025-03-08 00:52:45,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109048094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:52:45,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:52:45,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:52:45,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132119323] [2025-03-08 00:52:45,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:52:45,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:52:45,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:45,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:52:45,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:52:45,459 INFO L87 Difference]: Start difference. First operand 3047 states and 3924 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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-08 00:52:45,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:45,559 INFO L93 Difference]: Finished difference Result 3111 states and 4011 transitions. [2025-03-08 00:52:45,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:52:45,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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 226 [2025-03-08 00:52:45,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:45,563 INFO L225 Difference]: With dead ends: 3111 [2025-03-08 00:52:45,563 INFO L226 Difference]: Without dead ends: 3041 [2025-03-08 00:52:45,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-08 00:52:45,564 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:45,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:52:45,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3041 states. [2025-03-08 00:52:45,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3041 to 3041. [2025-03-08 00:52:45,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3041 states, 3040 states have (on average 1.2875) internal successors, (3914), 3040 states have internal predecessors, (3914), 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-08 00:52:45,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 3914 transitions. [2025-03-08 00:52:45,609 INFO L78 Accepts]: Start accepts. Automaton has 3041 states and 3914 transitions. Word has length 226 [2025-03-08 00:52:45,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:45,609 INFO L471 AbstractCegarLoop]: Abstraction has 3041 states and 3914 transitions. [2025-03-08 00:52:45,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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-08 00:52:45,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 3914 transitions. [2025-03-08 00:52:45,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-08 00:52:45,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:45,612 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:45,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 00:52:45,613 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:45,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:45,613 INFO L85 PathProgramCache]: Analyzing trace with hash -482569110, now seen corresponding path program 1 times [2025-03-08 00:52:45,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:45,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108156490] [2025-03-08 00:52:45,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:45,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:45,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-08 00:52:45,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-08 00:52:45,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:45,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-03-08 00:52:45,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:45,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108156490] [2025-03-08 00:52:45,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108156490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:52:45,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:52:45,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 00:52:45,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924570907] [2025-03-08 00:52:45,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:52:45,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 00:52:45,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:45,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 00:52:45,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:52:45,822 INFO L87 Difference]: Start difference. First operand 3041 states and 3914 transitions. Second operand has 5 states, 5 states have (on average 10.0) 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-08 00:52:46,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 00:52:47,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:47,073 INFO L93 Difference]: Finished difference Result 3278 states and 4252 transitions. [2025-03-08 00:52:47,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 00:52:47,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) 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 226 [2025-03-08 00:52:47,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:47,077 INFO L225 Difference]: With dead ends: 3278 [2025-03-08 00:52:47,078 INFO L226 Difference]: Without dead ends: 3053 [2025-03-08 00:52:47,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:52:47,078 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:47,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 00:52:47,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3053 states. [2025-03-08 00:52:47,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3053 to 3053. [2025-03-08 00:52:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3053 states, 3052 states have (on average 1.2863695937090434) internal successors, (3926), 3052 states have internal predecessors, (3926), 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-08 00:52:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3053 states to 3053 states and 3926 transitions. [2025-03-08 00:52:47,108 INFO L78 Accepts]: Start accepts. Automaton has 3053 states and 3926 transitions. Word has length 226 [2025-03-08 00:52:47,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:47,108 INFO L471 AbstractCegarLoop]: Abstraction has 3053 states and 3926 transitions. [2025-03-08 00:52:47,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) 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-08 00:52:47,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3053 states and 3926 transitions. [2025-03-08 00:52:47,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-08 00:52:47,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:47,111 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:47,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 00:52:47,111 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:47,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:47,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1231348509, now seen corresponding path program 2 times [2025-03-08 00:52:47,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:47,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692558721] [2025-03-08 00:52:47,111 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:52:47,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:47,118 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 226 statements into 2 equivalence classes. [2025-03-08 00:52:47,153 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 226 of 226 statements. [2025-03-08 00:52:47,153 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:52:47,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:47,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1382 trivial. 0 not checked. [2025-03-08 00:52:47,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:47,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692558721] [2025-03-08 00:52:47,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692558721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:52:47,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:52:47,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:52:47,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297578960] [2025-03-08 00:52:47,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:52:47,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:52:47,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:47,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:52:47,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:52:47,330 INFO L87 Difference]: Start difference. First operand 3053 states and 3926 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-08 00:52:48,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:48,088 INFO L93 Difference]: Finished difference Result 3347 states and 4347 transitions. [2025-03-08 00:52:48,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:52:48,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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 226 [2025-03-08 00:52:48,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:48,092 INFO L225 Difference]: With dead ends: 3347 [2025-03-08 00:52:48,092 INFO L226 Difference]: Without dead ends: 3062 [2025-03-08 00:52:48,093 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-08 00:52:48,093 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 16 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:48,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 319 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 00:52:48,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2025-03-08 00:52:48,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 3059. [2025-03-08 00:52:48,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3059 states, 3058 states have (on average 1.2851536952256377) internal successors, (3930), 3058 states have internal predecessors, (3930), 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-08 00:52:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 3930 transitions. [2025-03-08 00:52:48,124 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 3930 transitions. Word has length 226 [2025-03-08 00:52:48,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:48,125 INFO L471 AbstractCegarLoop]: Abstraction has 3059 states and 3930 transitions. [2025-03-08 00:52:48,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-08 00:52:48,125 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 3930 transitions. [2025-03-08 00:52:48,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-08 00:52:48,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:48,128 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:48,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 00:52:48,128 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:48,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:48,128 INFO L85 PathProgramCache]: Analyzing trace with hash -366670290, now seen corresponding path program 1 times [2025-03-08 00:52:48,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:48,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657925727] [2025-03-08 00:52:48,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:48,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:48,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-08 00:52:48,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-08 00:52:48,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:48,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:48,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-03-08 00:52:48,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:48,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657925727] [2025-03-08 00:52:48,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657925727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:52:48,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:52:48,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 00:52:48,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500114588] [2025-03-08 00:52:48,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:52:48,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 00:52:48,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:48,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 00:52:48,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:52:48,328 INFO L87 Difference]: Start difference. First operand 3059 states and 3930 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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-08 00:52:48,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:48,477 INFO L93 Difference]: Finished difference Result 3180 states and 4099 transitions. [2025-03-08 00:52:48,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 00:52:48,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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 227 [2025-03-08 00:52:48,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:48,481 INFO L225 Difference]: With dead ends: 3180 [2025-03-08 00:52:48,481 INFO L226 Difference]: Without dead ends: 3068 [2025-03-08 00:52:48,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:52:48,482 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:48,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 387 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:52:48,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2025-03-08 00:52:48,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 3068. [2025-03-08 00:52:48,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 3067 states have (on average 1.2836648190414086) internal successors, (3937), 3067 states have internal predecessors, (3937), 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-08 00:52:48,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 3937 transitions. [2025-03-08 00:52:48,513 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 3937 transitions. Word has length 227 [2025-03-08 00:52:48,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:48,514 INFO L471 AbstractCegarLoop]: Abstraction has 3068 states and 3937 transitions. [2025-03-08 00:52:48,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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-08 00:52:48,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 3937 transitions. [2025-03-08 00:52:48,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-08 00:52:48,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:48,517 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 14, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:48,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 00:52:48,517 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:48,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:48,517 INFO L85 PathProgramCache]: Analyzing trace with hash 552379875, now seen corresponding path program 1 times [2025-03-08 00:52:48,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:48,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941879629] [2025-03-08 00:52:48,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:48,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:48,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-08 00:52:48,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-08 00:52:48,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:48,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:48,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2025-03-08 00:52:48,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:48,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941879629] [2025-03-08 00:52:48,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941879629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:52:48,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:52:48,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:52:48,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198117354] [2025-03-08 00:52:48,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:52:48,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:52:48,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:48,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:52:48,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:52:48,628 INFO L87 Difference]: Start difference. First operand 3068 states and 3937 transitions. Second operand has 4 states, 4 states have (on average 12.75) 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-08 00:52:49,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:49,727 INFO L93 Difference]: Finished difference Result 3112 states and 3985 transitions. [2025-03-08 00:52:49,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:52:49,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) 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 227 [2025-03-08 00:52:49,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:49,731 INFO L225 Difference]: With dead ends: 3112 [2025-03-08 00:52:49,731 INFO L226 Difference]: Without dead ends: 3072 [2025-03-08 00:52:49,732 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-08 00:52:49,732 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 4 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:49,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 271 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 00:52:49,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2025-03-08 00:52:49,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 3071. [2025-03-08 00:52:49,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3071 states, 3070 states have (on average 1.283387622149837) internal successors, (3940), 3070 states have internal predecessors, (3940), 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-08 00:52:49,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 3940 transitions. [2025-03-08 00:52:49,763 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 3940 transitions. Word has length 227 [2025-03-08 00:52:49,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:49,764 INFO L471 AbstractCegarLoop]: Abstraction has 3071 states and 3940 transitions. [2025-03-08 00:52:49,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) 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-08 00:52:49,764 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 3940 transitions. [2025-03-08 00:52:49,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-08 00:52:49,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:49,767 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:49,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 00:52:49,767 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:49,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:49,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1823970063, now seen corresponding path program 1 times [2025-03-08 00:52:49,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:49,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753408359] [2025-03-08 00:52:49,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:49,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:49,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 00:52:49,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 00:52:49,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:49,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:49,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-03-08 00:52:49,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:49,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753408359] [2025-03-08 00:52:49,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753408359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:52:49,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:52:49,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 00:52:49,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131622570] [2025-03-08 00:52:49,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:52:49,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 00:52:49,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:49,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 00:52:49,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:52:49,961 INFO L87 Difference]: Start difference. First operand 3071 states and 3940 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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-08 00:52:50,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:50,092 INFO L93 Difference]: Finished difference Result 3360 states and 4344 transitions. [2025-03-08 00:52:50,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 00:52:50,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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 228 [2025-03-08 00:52:50,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:50,095 INFO L225 Difference]: With dead ends: 3360 [2025-03-08 00:52:50,095 INFO L226 Difference]: Without dead ends: 3083 [2025-03-08 00:52:50,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:52:50,096 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:50,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:52:50,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2025-03-08 00:52:50,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 3083. [2025-03-08 00:52:50,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3083 states, 3082 states have (on average 1.282284231018819) internal successors, (3952), 3082 states have internal predecessors, (3952), 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-08 00:52:50,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3083 states to 3083 states and 3952 transitions. [2025-03-08 00:52:50,133 INFO L78 Accepts]: Start accepts. Automaton has 3083 states and 3952 transitions. Word has length 228 [2025-03-08 00:52:50,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:50,133 INFO L471 AbstractCegarLoop]: Abstraction has 3083 states and 3952 transitions. [2025-03-08 00:52:50,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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-08 00:52:50,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 3952 transitions. [2025-03-08 00:52:50,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-08 00:52:50,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:50,136 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 14, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:50,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 00:52:50,137 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:50,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:50,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2084462371, now seen corresponding path program 1 times [2025-03-08 00:52:50,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:50,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701939510] [2025-03-08 00:52:50,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:50,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:50,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 00:52:50,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 00:52:50,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:50,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:50,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 76 proven. 16 refuted. 0 times theorem prover too weak. 1336 trivial. 0 not checked. [2025-03-08 00:52:50,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:50,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701939510] [2025-03-08 00:52:50,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701939510] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:52:50,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195645403] [2025-03-08 00:52:50,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:50,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:50,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:52:50,442 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:52:50,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 00:52:50,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 00:52:50,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 00:52:50,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:50,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:50,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:52:50,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:52:50,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2025-03-08 00:52:50,575 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:52:50,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195645403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:52:50,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:52:50,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-03-08 00:52:50,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986590541] [2025-03-08 00:52:50,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:52:50,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 00:52:50,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:50,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 00:52:50,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:52:50,577 INFO L87 Difference]: Start difference. First operand 3083 states and 3952 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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-08 00:52:50,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:50,690 INFO L93 Difference]: Finished difference Result 3203 states and 4116 transitions. [2025-03-08 00:52:50,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 00:52:50,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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 228 [2025-03-08 00:52:50,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:50,693 INFO L225 Difference]: With dead ends: 3203 [2025-03-08 00:52:50,693 INFO L226 Difference]: Without dead ends: 3099 [2025-03-08 00:52:50,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:52:50,694 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 3 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:50,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 382 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:52:50,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3099 states. [2025-03-08 00:52:50,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3099 to 3095. [2025-03-08 00:52:50,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3095 states, 3094 states have (on average 1.2811893988364575) internal successors, (3964), 3094 states have internal predecessors, (3964), 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-08 00:52:50,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3095 states to 3095 states and 3964 transitions. [2025-03-08 00:52:50,727 INFO L78 Accepts]: Start accepts. Automaton has 3095 states and 3964 transitions. Word has length 228 [2025-03-08 00:52:50,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:50,727 INFO L471 AbstractCegarLoop]: Abstraction has 3095 states and 3964 transitions. [2025-03-08 00:52:50,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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-08 00:52:50,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3095 states and 3964 transitions. [2025-03-08 00:52:50,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-08 00:52:50,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:50,730 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:50,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-08 00:52:50,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-08 00:52:50,931 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:50,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:50,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1948795039, now seen corresponding path program 1 times [2025-03-08 00:52:50,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:50,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176148954] [2025-03-08 00:52:50,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:50,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:50,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 00:52:50,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 00:52:50,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:50,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:51,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2025-03-08 00:52:51,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:52:51,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176148954] [2025-03-08 00:52:51,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176148954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:52:51,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:52:51,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:52:51,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23898742] [2025-03-08 00:52:51,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:52:51,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:52:51,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:52:51,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:52:51,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:52:51,038 INFO L87 Difference]: Start difference. First operand 3095 states and 3964 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-08 00:52:51,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:51,429 INFO L93 Difference]: Finished difference Result 3217 states and 4113 transitions. [2025-03-08 00:52:51,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:52:51,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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 228 [2025-03-08 00:52:51,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:51,432 INFO L225 Difference]: With dead ends: 3217 [2025-03-08 00:52:51,432 INFO L226 Difference]: Without dead ends: 3096 [2025-03-08 00:52:51,432 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-08 00:52:51,433 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 5 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:51,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 269 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:52:51,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3096 states. [2025-03-08 00:52:51,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3096 to 3096. [2025-03-08 00:52:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3096 states, 3095 states have (on average 1.2807754442649435) internal successors, (3964), 3095 states have internal predecessors, (3964), 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-08 00:52:51,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 3964 transitions. [2025-03-08 00:52:51,464 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 3964 transitions. Word has length 228 [2025-03-08 00:52:51,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:51,465 INFO L471 AbstractCegarLoop]: Abstraction has 3096 states and 3964 transitions. [2025-03-08 00:52:51,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-08 00:52:51,465 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 3964 transitions. [2025-03-08 00:52:51,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-08 00:52:51,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:51,468 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 14, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:51,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 00:52:51,468 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:51,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:51,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1018728088, now seen corresponding path program 1 times [2025-03-08 00:52:51,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:52:51,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777431400] [2025-03-08 00:52:51,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:51,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:52:51,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-08 00:52:51,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-08 00:52:51,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:51,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 00:52:51,540 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 00:52:51,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-08 00:52:51,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-08 00:52:51,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:51,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 00:52:51,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 00:52:51,653 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 00:52:51,654 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 00:52:51,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 00:52:51,657 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:52:51,721 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 00:52:51,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:52:51 BoogieIcfgContainer [2025-03-08 00:52:51,725 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 00:52:51,725 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 00:52:51,726 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 00:52:51,726 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 00:52:51,726 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:52:15" (3/4) ... [2025-03-08 00:52:51,728 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 00:52:51,729 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 00:52:51,729 INFO L158 Benchmark]: Toolchain (without parser) took 36824.21ms. Allocated memory was 167.8MB in the beginning and 629.1MB in the end (delta: 461.4MB). Free memory was 122.5MB in the beginning and 403.4MB in the end (delta: -281.0MB). Peak memory consumption was 185.7MB. Max. memory is 16.1GB. [2025-03-08 00:52:51,730 INFO L158 Benchmark]: CDTParser took 0.88ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:52:51,730 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.32ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 111.1MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:52:51,730 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.89ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 108.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:52:51,730 INFO L158 Benchmark]: Boogie Preprocessor took 21.97ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 107.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:52:51,731 INFO L158 Benchmark]: IcfgBuilder took 824.90ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 76.8MB in the end (delta: 30.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 00:52:51,731 INFO L158 Benchmark]: TraceAbstraction took 35775.04ms. Allocated memory was 167.8MB in the beginning and 629.1MB in the end (delta: 461.4MB). Free memory was 76.0MB in the beginning and 403.6MB in the end (delta: -327.6MB). Peak memory consumption was 127.0MB. Max. memory is 16.1GB. [2025-03-08 00:52:51,731 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 629.1MB. Free memory was 403.6MB in the beginning and 403.4MB in the end (delta: 132.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:52:51,732 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.88ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 163.32ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 111.1MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.89ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 108.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.97ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 107.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 824.90ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 76.8MB in the end (delta: 30.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 35775.04ms. Allocated memory was 167.8MB in the beginning and 629.1MB in the end (delta: 461.4MB). Free memory was 76.0MB in the beginning and 403.6MB in the end (delta: -327.6MB). Peak memory consumption was 127.0MB. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 629.1MB. Free memory was 403.6MB in the beginning and 403.4MB in the end (delta: 132.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: 25]: 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 shiftLeft at line 50, overapproximation of shiftLeft at line 50, overapproximation of shiftLeft at line 50, overapproximation of bitwiseOr at line 59, overapproximation of bitwiseAnd at line 59. Possible FailurePath: [L42] unsigned short x = __VERIFIER_nondet_ushort(); [L43] unsigned short y = __VERIFIER_nondet_ushort(); [L44] unsigned int xx; [L45] unsigned int yy; [L46] unsigned int zz; [L47] unsigned int z = 0; [L48] unsigned int i = 0; VAL [i=0, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=0, z=0] [L50] EXPR 1U << i VAL [i=0, z=0] [L50] EXPR x & (1U << i) VAL [i=0, x=0, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=0, x=0, z=0] [L50] EXPR 1U << i VAL [i=0, x=0, z=0] [L50] EXPR y & (1U << i) VAL [i=0, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=0, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=0, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=1, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=1, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=1, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=1, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=1, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=1, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=1, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=1, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=1, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=2, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=2, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=2, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=2, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=2, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=2, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=2, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=2, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=2, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=3, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=3, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=3, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=3, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=3, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=3, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=3, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=3, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=3, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=4, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=4, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=4, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=4, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=4, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=4, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=4, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=4, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=4, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=5, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=5, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=5, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=5, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=5, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=5, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=5, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=5, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=5, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=6, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=6, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=6, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=6, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=6, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=6, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=6, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=6, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=6, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=7, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=7, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=7, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=7, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=7, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=7, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=7, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=7, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=7, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=8, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=8, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=8, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=8, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=8, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=8, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=8, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=8, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=8, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=9, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=9, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=9, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=9, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=9, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=9, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=9, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=9, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=9, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=10, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=10, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=10, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=10, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=10, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=10, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=10, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=10, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=10, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=11, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=11, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=11, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=11, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=11, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=11, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=11, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=11, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=11, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=12, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=12, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=12, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=12, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=12, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=12, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=12, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=12, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=12, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=13, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=13, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=13, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=13, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=13, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=13, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=13, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=13, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=13, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=14, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=14, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=14, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=14, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=14, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=14, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=14, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=14, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=14, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=15, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=15, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=15, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=15, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=15, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=15, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=15, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=15, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=15, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=16, x=0, y=1, z=4294967297] [L49] COND FALSE !(i < sizeof(x) * 8) [L53] xx = x [L54] yy = y VAL [xx=0, yy=1, z=4294967297] [L55] EXPR xx | (xx << 8u) VAL [yy=1, z=4294967297] [L55] EXPR (xx | (xx << 8u)) & 16711935U VAL [yy=1, z=4294967297] [L55] xx = (xx | (xx << 8u)) & 16711935U [L56] EXPR xx | (xx << 4u) VAL [yy=1, z=4294967297] [L56] EXPR (xx | (xx << 4u)) & 252645135U VAL [yy=1, z=4294967297] [L56] xx = (xx | (xx << 4u)) & 252645135U [L57] EXPR xx | (xx << 2u) VAL [yy=1, z=4294967297] [L57] EXPR (xx | (xx << 2u)) & 858993459U VAL [yy=1, z=4294967297] [L57] xx = (xx | (xx << 2u)) & 858993459U [L58] EXPR xx | (xx << 1u) VAL [yy=1, z=4294967297] [L58] EXPR (xx | (xx << 1u)) & 1431655765U VAL [yy=1, z=4294967297] [L58] xx = (xx | (xx << 1u)) & 1431655765U [L59] EXPR yy | (yy << 8u) VAL [xx=0, z=4294967297] [L59] EXPR (yy | (yy << 8u)) & 16711935U VAL [xx=0, z=4294967297] [L59] yy = (yy | (yy << 8u)) & 16711935U [L60] EXPR yy | (yy << 4u) VAL [xx=0, z=4294967297] [L60] EXPR (yy | (yy << 4u)) & 252645135U VAL [xx=0, z=4294967297] [L60] yy = (yy | (yy << 4u)) & 252645135U [L61] EXPR yy | (yy << 2u) VAL [xx=0, z=4294967297] [L61] EXPR (yy | (yy << 2u)) & 858993459U VAL [xx=0, z=4294967297] [L61] yy = (yy | (yy << 2u)) & 858993459U [L62] EXPR yy | (yy << 1u) VAL [xx=0, z=4294967297] [L62] EXPR (yy | (yy << 1u)) & 1431655765U VAL [xx=0, z=4294967297] [L62] yy = (yy | (yy << 1u)) & 1431655765U [L64] EXPR xx | (yy << 1U) VAL [z=4294967297] [L64] zz = xx | (yy << 1U) [L66] CALL __VERIFIER_assert(z == zz) [L24] COND TRUE !(cond) [L25] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 91 locations, 138 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.7s, OverallIterations: 31, TraceHistogramMax: 16, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 18.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6036 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6036 mSDsluCounter, 19971 SdHoareTripleChecker+Invalid, 8.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16297 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12702 IncrementalHoareTripleChecker+Invalid, 12840 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 3674 mSDtfsCounter, 12702 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4719 GetRequests, 4369 SyntacticMatches, 0 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2654 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3096occurred in iteration=30, InterpolantAutomatonStates: 237, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 30 MinimizatonAttempts, 1476 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 7816 NumberOfCodeBlocks, 7520 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 9456 ConstructedInterpolants, 0 QuantifiedInterpolants, 23220 SizeOfPredicates, 17 NumberOfNonLiveVariables, 6434 ConjunctsInSsa, 208 ConjunctsInUnsatCore, 61 InterpolantComputations, 23 PerfectInterpolantSequences, 30931/41435 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 00:52:51,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/interleave_bits.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:52:53,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:52:53,548 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 00:52:53,556 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:52:53,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:52:53,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:52:53,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:52:53,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:52:53,582 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:52:53,582 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:52:53,582 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:52:53,582 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:52:53,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:52:53,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:52:53,583 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:52:53,583 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:52:53,583 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:52:53,583 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:52:53,583 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:52:53,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:52:53,583 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:52:53,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:52:53,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:52:53,584 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 00:52:53,585 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 00:52:53,585 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 00:52:53,585 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:52:53,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:52:53,585 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:52:53,585 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:52:53,585 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:52:53,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:52:53,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:52:53,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:52:53,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:52:53,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:52:53,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:52:53,586 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:52:53,586 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:52:53,586 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 00:52:53,586 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 00:52:53,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:52:53,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:52:53,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:52:53,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:52:53,586 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb [2025-03-08 00:52:53,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:52:53,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:52:53,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:52:53,796 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:52:53,796 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:52:53,796 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/interleave_bits.i [2025-03-08 00:52:54,896 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1fee3593/98962338cc6245f0a166bc3fedd503d4/FLAGa17135814 [2025-03-08 00:52:55,064 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:52:55,065 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2025-03-08 00:52:55,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1fee3593/98962338cc6245f0a166bc3fedd503d4/FLAGa17135814 [2025-03-08 00:52:55,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1fee3593/98962338cc6245f0a166bc3fedd503d4 [2025-03-08 00:52:55,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:52:55,459 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:52:55,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:52:55,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:52:55,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:52:55,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:52:55" (1/1) ... [2025-03-08 00:52:55,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ec75d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:55, skipping insertion in model container [2025-03-08 00:52:55,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:52:55" (1/1) ... [2025-03-08 00:52:55,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:52:55,571 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2025-03-08 00:52:55,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:52:55,600 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:52:55,608 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2025-03-08 00:52:55,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:52:55,632 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:52:55,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:55 WrapperNode [2025-03-08 00:52:55,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:52:55,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:52:55,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:52:55,635 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:52:55,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:55" (1/1) ... [2025-03-08 00:52:55,645 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:55" (1/1) ... [2025-03-08 00:52:55,657 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2025-03-08 00:52:55,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:52:55,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:52:55,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:52:55,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:52:55,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:55" (1/1) ... [2025-03-08 00:52:55,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:55" (1/1) ... [2025-03-08 00:52:55,665 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:55" (1/1) ... [2025-03-08 00:52:55,673 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 00:52:55,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:55" (1/1) ... [2025-03-08 00:52:55,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:55" (1/1) ... [2025-03-08 00:52:55,677 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:55" (1/1) ... [2025-03-08 00:52:55,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:55" (1/1) ... [2025-03-08 00:52:55,681 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:55" (1/1) ... [2025-03-08 00:52:55,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:55" (1/1) ... [2025-03-08 00:52:55,683 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:52:55,683 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:52:55,683 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:52:55,683 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:52:55,684 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:55" (1/1) ... [2025-03-08 00:52:55,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:52:55,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:52:55,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:52:55,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:52:55,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:52:55,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 00:52:55,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:52:55,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:52:55,767 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:52:55,768 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:52:55,873 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 00:52:55,873 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:52:55,882 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:52:55,882 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:52:55,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:52:55 BoogieIcfgContainer [2025-03-08 00:52:55,883 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:52:55,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:52:55,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:52:55,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:52:55,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:52:55" (1/3) ... [2025-03-08 00:52:55,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c4b462c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:52:55, skipping insertion in model container [2025-03-08 00:52:55,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:52:55" (2/3) ... [2025-03-08 00:52:55,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c4b462c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:52:55, skipping insertion in model container [2025-03-08 00:52:55,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:52:55" (3/3) ... [2025-03-08 00:52:55,891 INFO L128 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2025-03-08 00:52:55,902 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:52:55,904 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interleave_bits.i that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 00:52:55,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:52:55,948 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;@10d98906, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:52:55,949 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:52:55,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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-08 00:52:55,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 00:52:55,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:55,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 00:52:55,958 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:55,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:55,961 INFO L85 PathProgramCache]: Analyzing trace with hash 38139366, now seen corresponding path program 1 times [2025-03-08 00:52:55,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:52:55,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2145347870] [2025-03-08 00:52:55,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:55,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:55,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:52:55,974 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:52:55,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:52:56,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 00:52:56,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 00:52:56,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:56,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:56,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:52:56,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:52:56,077 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-08 00:52:56,077 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:52:56,077 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:52:56,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145347870] [2025-03-08 00:52:56,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145347870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:52:56,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:52:56,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:52:56,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836462144] [2025-03-08 00:52:56,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:52:56,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:52:56,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:52:56,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:52:56,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:52:56,094 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:52:56,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:56,110 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2025-03-08 00:52:56,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:52:56,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-08 00:52:56,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:56,115 INFO L225 Difference]: With dead ends: 18 [2025-03-08 00:52:56,115 INFO L226 Difference]: Without dead ends: 7 [2025-03-08 00:52:56,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:52:56,120 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:56,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:52:56,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2025-03-08 00:52:56,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-03-08 00:52:56,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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-08 00:52:56,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2025-03-08 00:52:56,141 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2025-03-08 00:52:56,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:56,141 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2025-03-08 00:52:56,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:52:56,141 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2025-03-08 00:52:56,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 00:52:56,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:56,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 00:52:56,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 00:52:56,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:56,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:56,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:56,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1182352094, now seen corresponding path program 1 times [2025-03-08 00:52:56,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:52:56,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [875361167] [2025-03-08 00:52:56,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:52:56,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:56,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:52:56,352 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:52:56,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 00:52:56,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 00:52:56,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 00:52:56,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:52:56,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:56,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:52:56,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:52:56,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:56,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:52:56,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:56,446 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:52:56,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875361167] [2025-03-08 00:52:56,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875361167] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:52:56,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:52:56,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-03-08 00:52:56,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228863004] [2025-03-08 00:52:56,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:52:56,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 00:52:56,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:52:56,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 00:52:56,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:52:56,448 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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-08 00:52:56,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:56,483 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2025-03-08 00:52:56,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:52:56,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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) Word has length 6 [2025-03-08 00:52:56,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:56,484 INFO L225 Difference]: With dead ends: 13 [2025-03-08 00:52:56,484 INFO L226 Difference]: Without dead ends: 10 [2025-03-08 00:52:56,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:52:56,485 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:56,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:52:56,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-08 00:52:56,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-08 00:52:56,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-08 00:52:56,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2025-03-08 00:52:56,487 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2025-03-08 00:52:56,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:56,487 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2025-03-08 00:52:56,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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-08 00:52:56,487 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2025-03-08 00:52:56,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 00:52:56,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:56,488 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2025-03-08 00:52:56,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 00:52:56,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:56,692 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:56,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:56,692 INFO L85 PathProgramCache]: Analyzing trace with hash 455963622, now seen corresponding path program 2 times [2025-03-08 00:52:56,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:52:56,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1112234012] [2025-03-08 00:52:56,693 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:52:56,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:56,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:52:56,696 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:52:56,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:52:56,727 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-03-08 00:52:56,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 00:52:56,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:52:56,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:56,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 00:52:56,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:52:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:56,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:52:56,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:56,896 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:52:56,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112234012] [2025-03-08 00:52:56,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112234012] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:52:56,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:52:56,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-08 00:52:56,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71983481] [2025-03-08 00:52:56,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:52:56,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 00:52:56,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:52:56,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 00:52:56,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:52:56,897 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-08 00:52:57,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:57,010 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2025-03-08 00:52:57,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:52:57,011 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 9 [2025-03-08 00:52:57,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:57,012 INFO L225 Difference]: With dead ends: 19 [2025-03-08 00:52:57,012 INFO L226 Difference]: Without dead ends: 16 [2025-03-08 00:52:57,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:52:57,012 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:57,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:52:57,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-08 00:52:57,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-08 00:52:57,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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-08 00:52:57,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2025-03-08 00:52:57,015 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2025-03-08 00:52:57,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:57,015 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2025-03-08 00:52:57,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-08 00:52:57,016 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2025-03-08 00:52:57,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 00:52:57,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:57,016 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2025-03-08 00:52:57,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 00:52:57,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:57,216 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:57,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:57,217 INFO L85 PathProgramCache]: Analyzing trace with hash -427781914, now seen corresponding path program 3 times [2025-03-08 00:52:57,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:52:57,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1620268478] [2025-03-08 00:52:57,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:52:57,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:57,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:52:57,222 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:52:57,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 00:52:57,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 6 equivalence classes. [2025-03-08 00:52:57,272 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 00:52:57,273 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 00:52:57,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:57,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 00:52:57,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:52:57,376 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:57,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:52:57,649 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:57,649 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:52:57,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620268478] [2025-03-08 00:52:57,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620268478] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:52:57,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:52:57,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2025-03-08 00:52:57,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992437921] [2025-03-08 00:52:57,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:52:57,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 00:52:57,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:52:57,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 00:52:57,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2025-03-08 00:52:57,651 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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-08 00:52:58,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:52:58,153 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2025-03-08 00:52:58,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 00:52:58,153 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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 15 [2025-03-08 00:52:58,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:52:58,154 INFO L225 Difference]: With dead ends: 31 [2025-03-08 00:52:58,154 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 00:52:58,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=771, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 00:52:58,155 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:52:58,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:52:58,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 00:52:58,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-08 00:52:58,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:52:58,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2025-03-08 00:52:58,161 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 15 [2025-03-08 00:52:58,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:52:58,161 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2025-03-08 00:52:58,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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-08 00:52:58,161 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2025-03-08 00:52:58,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 00:52:58,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:52:58,161 INFO L218 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1] [2025-03-08 00:52:58,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 00:52:58,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:58,362 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:52:58,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:52:58,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1136005658, now seen corresponding path program 4 times [2025-03-08 00:52:58,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:52:58,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1542093597] [2025-03-08 00:52:58,362 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:52:58,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:52:58,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:52:58,364 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:52:58,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 00:52:58,387 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-08 00:52:58,425 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 00:52:58,426 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:52:58,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:52:58,430 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-08 00:52:58,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:52:59,361 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:52:59,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:53:10,904 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:53:10,905 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:10,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542093597] [2025-03-08 00:53:10,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542093597] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:53:10,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:53:10,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2025-03-08 00:53:10,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416518706] [2025-03-08 00:53:10,906 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:53:10,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-08 00:53:10,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:10,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-08 00:53:10,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=1043, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 00:53:10,908 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 38 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 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-08 00:53:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:11,570 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2025-03-08 00:53:11,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 00:53:11,571 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 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 21 [2025-03-08 00:53:11,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:11,574 INFO L225 Difference]: With dead ends: 29 [2025-03-08 00:53:11,574 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 00:53:11,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=363, Invalid=1043, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 00:53:11,575 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:11,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:53:11,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 00:53:11,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 00:53:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-08 00:53:11,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 00:53:11,575 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2025-03-08 00:53:11,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:11,575 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 00:53:11,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 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-08 00:53:11,576 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 00:53:11,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 00:53:11,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 00:53:11,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 00:53:11,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:11,781 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1] [2025-03-08 00:53:11,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 00:53:11,992 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 00:53:12,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:53:12 BoogieIcfgContainer [2025-03-08 00:53:12,021 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 00:53:12,022 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 00:53:12,022 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 00:53:12,022 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 00:53:12,023 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:52:55" (3/4) ... [2025-03-08 00:53:12,025 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 00:53:12,031 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-08 00:53:12,031 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 00:53:12,031 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 00:53:12,032 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 00:53:12,080 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 00:53:12,081 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 00:53:12,081 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 00:53:12,081 INFO L158 Benchmark]: Toolchain (without parser) took 16622.08ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 52.7MB in the end (delta: 39.6MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2025-03-08 00:53:12,082 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:53:12,082 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.17ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 80.5MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:53:12,082 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.85ms. Allocated memory is still 117.4MB. Free memory was 80.5MB in the beginning and 79.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:53:12,082 INFO L158 Benchmark]: Boogie Preprocessor took 24.33ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 78.1MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:53:12,082 INFO L158 Benchmark]: IcfgBuilder took 199.55ms. Allocated memory is still 117.4MB. Free memory was 78.1MB in the beginning and 67.4MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:53:12,082 INFO L158 Benchmark]: TraceAbstraction took 16135.14ms. Allocated memory is still 117.4MB. Free memory was 66.7MB in the beginning and 60.0MB in the end (delta: 6.7MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2025-03-08 00:53:12,083 INFO L158 Benchmark]: Witness Printer took 58.96ms. Allocated memory is still 117.4MB. Free memory was 60.0MB in the beginning and 52.7MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:53:12,083 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 173.17ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 80.5MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.85ms. Allocated memory is still 117.4MB. Free memory was 80.5MB in the beginning and 79.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.33ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 78.1MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 199.55ms. Allocated memory is still 117.4MB. Free memory was 78.1MB in the beginning and 67.4MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16135.14ms. Allocated memory is still 117.4MB. Free memory was 66.7MB in the beginning and 60.0MB in the end (delta: 6.7MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. * Witness Printer took 58.96ms. Allocated memory is still 117.4MB. Free memory was 60.0MB in the beginning and 52.7MB in the end (delta: 7.2MB). 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 - PositiveResult [Line: 25]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 11 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.9s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 111 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 505 IncrementalHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 25 mSDtfsCounter, 505 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 12.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=4, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 13.1s InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 98 ConstructedInterpolants, 1 QuantifiedInterpolants, 9653 SizeOfPredicates, 2 NumberOfNonLiveVariables, 193 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 0/404 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 49]: Location Invariant Derived location invariant: ((((((((((((((((((i == 9) && (z == (((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))))) || ((z == ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) && (i == 7))) || ((((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) == z) && (i == 2))) || ((i == 1) && (z == (0 | (((y & 1) << 1) | ((x & 1) << 0)))))) || ((i == 8) && (z == ((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4))))))))) || ((i == 10) && (z == ((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9)))))) || ((z == ((((y & 32768) << 16) | ((x & 32768) << 15)) | ((((y & 16384) << 15) | ((x & 16384) << 14)) | ((((((x & 2048) << 11) | ((y & 2048) << 12)) | (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11)))) | (((x & 4096) << 12) | ((y & 4096) << 13))) | (((y & 8192) << 14) | ((x & 8192) << 13)))))) && (i == 16))) || ((i == 6) && (z == ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4))))))) || ((z == (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11)))) && (i == 11))) || ((z == (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))) && (i == 5))) || ((z == ((((x & 2048) << 11) | ((y & 2048) << 12)) | (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11))))) && (i == 12))) || ((z == ((((((x & 2048) << 11) | ((y & 2048) << 12)) | (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11)))) | (((x & 4096) << 12) | ((y & 4096) << 13))) | (((y & 8192) << 14) | ((x & 8192) << 13)))) && (i == 14))) || (((((((x & 2048) << 11) | ((y & 2048) << 12)) | (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11)))) | (((x & 4096) << 12) | ((y & 4096) << 13))) == z) && (i == 13))) || ((z == ((((y & 16384) << 15) | ((x & 16384) << 14)) | ((((((x & 2048) << 11) | ((y & 2048) << 12)) | (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11)))) | (((x & 4096) << 12) | ((y & 4096) << 13))) | (((y & 8192) << 14) | ((x & 8192) << 13))))) && (i == 15))) || ((i == 0) && (z == 0))) || ((z == ((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2))))) && (i == 4))) || ((i == 3) && (z == (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))))) RESULT: Ultimate proved your program to be correct! [2025-03-08 00:53:12,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE