./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.seq.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.seq.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 51c029c3e6da7a855218885875d9decd9132b07b4b4a0cd8ca561de10b840446 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:26:32,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:26:32,953 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 09:26:32,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:26:32,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:26:32,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:26:32,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:26:32,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:26:32,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:26:32,977 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:26:32,977 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:26:32,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:26:32,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:26:32,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:26:32,977 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:26:32,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:26:32,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:26:32,977 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:26:32,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:26:32,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:26:32,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:26:32,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:26:32,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:26:32,978 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:26:32,978 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:26:32,978 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:26:32,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:26:32,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:26:32,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:26:32,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:26:32,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:26:32,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:26:32,979 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:26:32,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:26:32,979 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:26:32,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:26:32,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:26:32,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:26:32,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:26:32,979 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:26:32,980 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 51c029c3e6da7a855218885875d9decd9132b07b4b4a0cd8ca561de10b840446 [2025-03-08 09:26:33,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:26:33,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:26:33,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:26:33,188 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:26:33,188 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:26:33,189 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.seq.c [2025-03-08 09:26:34,303 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/924a27eb5/968bfad37f064d0983ffcf169b036461/FLAG17aa691d8 [2025-03-08 09:26:34,529 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:26:34,531 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.seq.c [2025-03-08 09:26:34,539 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/924a27eb5/968bfad37f064d0983ffcf169b036461/FLAG17aa691d8 [2025-03-08 09:26:34,880 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/924a27eb5/968bfad37f064d0983ffcf169b036461 [2025-03-08 09:26:34,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:26:34,883 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:26:34,884 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:26:34,884 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:26:34,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:26:34,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:26:34" (1/1) ... [2025-03-08 09:26:34,889 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64812bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:34, skipping insertion in model container [2025-03-08 09:26:34,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:26:34" (1/1) ... [2025-03-08 09:26:34,905 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:26:35,004 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.seq.c[1297,1310] [2025-03-08 09:26:35,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:26:35,039 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:26:35,048 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.seq.c[1297,1310] [2025-03-08 09:26:35,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:26:35,066 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:26:35,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:35 WrapperNode [2025-03-08 09:26:35,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:26:35,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:26:35,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:26:35,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:26:35,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:35" (1/1) ... [2025-03-08 09:26:35,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:35" (1/1) ... [2025-03-08 09:26:35,091 INFO L138 Inliner]: procedures = 18, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 141 [2025-03-08 09:26:35,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:26:35,092 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:26:35,092 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:26:35,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:26:35,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:35" (1/1) ... [2025-03-08 09:26:35,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:35" (1/1) ... [2025-03-08 09:26:35,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:35" (1/1) ... [2025-03-08 09:26:35,109 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6]. The 0 writes are split as follows [0, 0]. [2025-03-08 09:26:35,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:35" (1/1) ... [2025-03-08 09:26:35,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:35" (1/1) ... [2025-03-08 09:26:35,114 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:35" (1/1) ... [2025-03-08 09:26:35,115 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:35" (1/1) ... [2025-03-08 09:26:35,116 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:35" (1/1) ... [2025-03-08 09:26:35,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:35" (1/1) ... [2025-03-08 09:26:35,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:26:35,129 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:26:35,130 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:26:35,130 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:26:35,131 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:35" (1/1) ... [2025-03-08 09:26:35,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:26:35,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:26:35,155 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 09:26:35,158 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 09:26:35,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:26:35,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:26:35,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 09:26:35,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:26:35,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:26:35,241 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:26:35,243 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:26:35,459 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2025-03-08 09:26:35,459 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:26:35,486 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:26:35,486 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:26:35,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:26:35 BoogieIcfgContainer [2025-03-08 09:26:35,487 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:26:35,488 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:26:35,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:26:35,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:26:35,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:26:34" (1/3) ... [2025-03-08 09:26:35,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dacd6a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:26:35, skipping insertion in model container [2025-03-08 09:26:35,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:35" (2/3) ... [2025-03-08 09:26:35,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dacd6a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:26:35, skipping insertion in model container [2025-03-08 09:26:35,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:26:35" (3/3) ... [2025-03-08 09:26:35,495 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.seq.c [2025-03-08 09:26:35,506 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:26:35,507 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.seq.c that has 1 procedures, 38 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:26:35,541 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:26:35,549 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;@3764ff37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:26:35,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:26:35,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 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 09:26:35,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 09:26:35,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:26:35,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:26:35,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:26:35,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:26:35,566 INFO L85 PathProgramCache]: Analyzing trace with hash 2004252329, now seen corresponding path program 1 times [2025-03-08 09:26:35,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:26:35,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976301921] [2025-03-08 09:26:35,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:26:35,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:26:35,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 09:26:35,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 09:26:35,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:26:35,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:26:35,907 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 09:26:35,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:26:35,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976301921] [2025-03-08 09:26:35,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976301921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:26:35,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:26:35,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:26:35,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51174055] [2025-03-08 09:26:35,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:26:35,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:26:35,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:26:35,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:26:35,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:26:35,937 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 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) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 09:26:35,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:26:35,982 INFO L93 Difference]: Finished difference Result 65 states and 93 transitions. [2025-03-08 09:26:35,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:26:35,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 15 [2025-03-08 09:26:35,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:26:35,988 INFO L225 Difference]: With dead ends: 65 [2025-03-08 09:26:35,988 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 09:26:35,990 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 09:26:35,992 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:26:35,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:26:36,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 09:26:36,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-08 09:26:36,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 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 09:26:36,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2025-03-08 09:26:36,013 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 15 [2025-03-08 09:26:36,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:26:36,013 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2025-03-08 09:26:36,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 09:26:36,014 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2025-03-08 09:26:36,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 09:26:36,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:26:36,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:26:36,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 09:26:36,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:26:36,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:26:36,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2006959214, now seen corresponding path program 1 times [2025-03-08 09:26:36,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:26:36,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394830929] [2025-03-08 09:26:36,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:26:36,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:26:36,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 09:26:36,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 09:26:36,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:26:36,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:26:36,137 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 09:26:36,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:26:36,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394830929] [2025-03-08 09:26:36,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394830929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:26:36,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:26:36,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:26:36,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616969434] [2025-03-08 09:26:36,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:26:36,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:26:36,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:26:36,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:26:36,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:26:36,140 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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 09:26:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:26:36,179 INFO L93 Difference]: Finished difference Result 66 states and 91 transitions. [2025-03-08 09:26:36,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:26:36,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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) Word has length 16 [2025-03-08 09:26:36,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:26:36,185 INFO L225 Difference]: With dead ends: 66 [2025-03-08 09:26:36,185 INFO L226 Difference]: Without dead ends: 39 [2025-03-08 09:26:36,185 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 09:26:36,186 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:26:36,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:26:36,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-08 09:26:36,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-08 09:26:36,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 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 09:26:36,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2025-03-08 09:26:36,192 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 16 [2025-03-08 09:26:36,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:26:36,192 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2025-03-08 09:26:36,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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 09:26:36,192 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2025-03-08 09:26:36,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 09:26:36,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:26:36,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:26:36,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 09:26:36,194 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:26:36,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:26:36,194 INFO L85 PathProgramCache]: Analyzing trace with hash -277264572, now seen corresponding path program 1 times [2025-03-08 09:26:36,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:26:36,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930905375] [2025-03-08 09:26:36,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:26:36,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:26:36,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 09:26:36,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 09:26:36,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:26:36,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:26:36,353 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 09:26:36,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:26:36,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930905375] [2025-03-08 09:26:36,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930905375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:26:36,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:26:36,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:26:36,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011881027] [2025-03-08 09:26:36,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:26:36,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:26:36,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:26:36,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:26:36,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:26:36,355 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 09:26:36,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:26:36,407 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2025-03-08 09:26:36,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:26:36,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-03-08 09:26:36,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:26:36,408 INFO L225 Difference]: With dead ends: 68 [2025-03-08 09:26:36,408 INFO L226 Difference]: Without dead ends: 39 [2025-03-08 09:26:36,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:26:36,411 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 44 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:26:36,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 65 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:26:36,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-08 09:26:36,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-08 09:26:36,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 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 09:26:36,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2025-03-08 09:26:36,415 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 17 [2025-03-08 09:26:36,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:26:36,417 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2025-03-08 09:26:36,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 09:26:36,417 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2025-03-08 09:26:36,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 09:26:36,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:26:36,417 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:26:36,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 09:26:36,418 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:26:36,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:26:36,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1883095379, now seen corresponding path program 1 times [2025-03-08 09:26:36,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:26:36,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953044225] [2025-03-08 09:26:36,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:26:36,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:26:36,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 09:26:36,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 09:26:36,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:26:36,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:26:36,544 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 09:26:36,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:26:36,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953044225] [2025-03-08 09:26:36,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953044225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:26:36,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:26:36,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:26:36,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259478464] [2025-03-08 09:26:36,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:26:36,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:26:36,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:26:36,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:26:36,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:26:36,547 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:26:36,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:26:36,600 INFO L93 Difference]: Finished difference Result 68 states and 90 transitions. [2025-03-08 09:26:36,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:26:36,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-08 09:26:36,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:26:36,601 INFO L225 Difference]: With dead ends: 68 [2025-03-08 09:26:36,601 INFO L226 Difference]: Without dead ends: 39 [2025-03-08 09:26:36,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:26:36,601 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 42 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:26:36,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 65 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:26:36,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-08 09:26:36,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-08 09:26:36,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 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 09:26:36,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2025-03-08 09:26:36,606 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 18 [2025-03-08 09:26:36,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:26:36,607 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2025-03-08 09:26:36,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:26:36,607 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2025-03-08 09:26:36,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 09:26:36,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:26:36,607 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:26:36,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 09:26:36,607 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:26:36,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:26:36,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1184157783, now seen corresponding path program 1 times [2025-03-08 09:26:36,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:26:36,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285593545] [2025-03-08 09:26:36,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:26:36,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:26:36,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 09:26:36,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 09:26:36,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:26:36,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:26:36,725 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 09:26:36,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:26:36,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285593545] [2025-03-08 09:26:36,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285593545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:26:36,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:26:36,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:26:36,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029183513] [2025-03-08 09:26:36,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:26:36,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:26:36,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:26:36,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:26:36,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:26:36,726 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:26:36,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:26:36,752 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2025-03-08 09:26:36,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:26:36,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-08 09:26:36,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:26:36,752 INFO L225 Difference]: With dead ends: 66 [2025-03-08 09:26:36,753 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 09:26:36,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:26:36,753 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 36 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:26:36,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 69 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:26:36,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 09:26:36,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-08 09:26:36,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 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 09:26:36,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2025-03-08 09:26:36,756 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 19 [2025-03-08 09:26:36,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:26:36,756 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2025-03-08 09:26:36,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:26:36,756 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2025-03-08 09:26:36,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 09:26:36,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:26:36,757 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] [2025-03-08 09:26:36,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 09:26:36,757 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:26:36,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:26:36,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2017902897, now seen corresponding path program 1 times [2025-03-08 09:26:36,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:26:36,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089227524] [2025-03-08 09:26:36,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:26:36,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:26:36,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 09:26:36,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 09:26:36,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:26:36,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:26:36,782 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 09:26:36,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 09:26:36,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 09:26:36,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:26:36,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:26:36,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 09:26:36,814 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 09:26:36,815 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:26:36,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 09:26:36,819 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-08 09:26:36,843 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-08 09:26:36,849 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:26:36,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:26:36 BoogieIcfgContainer [2025-03-08 09:26:36,853 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:26:36,854 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:26:36,854 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:26:36,854 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:26:36,854 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:26:35" (3/4) ... [2025-03-08 09:26:36,856 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 09:26:36,856 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:26:36,859 INFO L158 Benchmark]: Toolchain (without parser) took 1974.01ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 48.7MB in the end (delta: 57.0MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2025-03-08 09:26:36,859 INFO L158 Benchmark]: CDTParser took 0.51ms. 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 09:26:36,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.31ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 93.5MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 09:26:36,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.67ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 92.1MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 09:26:36,859 INFO L158 Benchmark]: Boogie Preprocessor took 36.45ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 90.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:26:36,859 INFO L158 Benchmark]: IcfgBuilder took 357.34ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 70.4MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 09:26:36,859 INFO L158 Benchmark]: TraceAbstraction took 1364.71ms. Allocated memory is still 142.6MB. Free memory was 69.4MB in the beginning and 49.7MB in the end (delta: 19.7MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2025-03-08 09:26:36,860 INFO L158 Benchmark]: Witness Printer took 2.59ms. Allocated memory is still 142.6MB. Free memory was 49.7MB in the beginning and 48.7MB in the end (delta: 919.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:26:36,860 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.51ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.31ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 93.5MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.67ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 92.1MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.45ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 90.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 357.34ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 70.4MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1364.71ms. Allocated memory is still 142.6MB. Free memory was 69.4MB in the beginning and 49.7MB in the end (delta: 19.7MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. * Witness Printer took 2.59ms. Allocated memory is still 142.6MB. Free memory was 49.7MB in the beginning and 48.7MB in the end (delta: 919.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 22]: 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 bitwiseAnd at line 68, overapproximation of bitwiseAnd at line 59. Possible FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 101); [L31] const SORT_4 msb_SORT_4 = (SORT_4)1 << (101 - 1); [L33] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 32); [L34] const SORT_8 msb_SORT_8 = (SORT_8)1 << (32 - 1); [L36] const SORT_4 var_5 = 1; [L37] const SORT_8 var_9 = 200; [L38] const SORT_1 var_14 = 1; [L39] const SORT_4 var_18 = 0; [L40] const SORT_8 var_23 = 100; [L42] SORT_1 input_2; [L43] SORT_1 input_3; [L45] EXPR __VERIFIER_nondet_uint128() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=(((unsigned __int128) 137438953471 << 64) | 18446744073709551615U), mask_SORT_8=-1, var_14=1, var_18=0, var_23=100, var_5=1, var_9=200] [L45] SORT_4 state_6 = __VERIFIER_nondet_uint128() & mask_SORT_4; [L46] EXPR __VERIFIER_nondet_uint128() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=(((unsigned __int128) 137438953471 << 64) | 18446744073709551615U), mask_SORT_8=-1, var_14=1, var_18=0, var_23=100, var_5=1, var_9=200] [L46] SORT_4 state_19 = __VERIFIER_nondet_uint128() & mask_SORT_4; [L48] SORT_4 init_7_arg_1 = var_5; [L49] state_6 = init_7_arg_1 [L50] SORT_4 init_20_arg_1 = var_18; [L51] state_19 = init_20_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=(((unsigned __int128) 137438953471 << 64) | 18446744073709551615U), mask_SORT_8=-1, state_19=0, state_6=1, var_14=1, var_23=100, var_9=200] [L54] input_2 = __VERIFIER_nondet_uchar() [L55] input_3 = __VERIFIER_nondet_uchar() [L58] SORT_8 var_10_arg_0 = var_9; VAL [mask_SORT_1=1, mask_SORT_4=(((unsigned __int128) 137438953471 << 64) | 18446744073709551615U), mask_SORT_8=-1, state_19=0, state_6=1, var_10_arg_0=200, var_14=1, var_23=100, var_9=200] [L59] EXPR var_10_arg_0 & mask_SORT_8 VAL [mask_SORT_1=1, mask_SORT_4=(((unsigned __int128) 137438953471 << 64) | 18446744073709551615U), mask_SORT_8=-1, state_19=0, state_6=1, var_14=1, var_23=100, var_9=200] [L59] var_10_arg_0 = var_10_arg_0 & mask_SORT_8 [L60] SORT_4 var_10 = var_10_arg_0; [L61] SORT_4 var_11_arg_0 = state_6; [L62] SORT_4 var_11_arg_1 = var_10; [L63] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L64] SORT_1 var_15_arg_0 = var_11; [L65] SORT_1 var_15 = ~var_15_arg_0; [L66] SORT_1 var_16_arg_0 = var_14; [L67] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=(((unsigned __int128) 137438953471 << 64) | 18446744073709551615U), mask_SORT_8=-1, state_19=0, state_6=1, var_14=1, var_16_arg_0=1, var_16_arg_1=-2, var_23=100, var_9=200] [L68] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=(((unsigned __int128) 137438953471 << 64) | 18446744073709551615U), mask_SORT_8=-1, state_19=0, state_6=1, var_14=1, var_23=100, var_9=200] [L68] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L69] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=(((unsigned __int128) 137438953471 << 64) | 18446744073709551615U), mask_SORT_8=-1, state_19=0, state_6=1, var_14=1, var_23=100, var_9=200] [L69] var_16 = var_16 & mask_SORT_1 [L70] SORT_1 bad_17_arg_0 = var_16; [L71] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L22] COND TRUE !(cond) [L22] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 53 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 426 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 245 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 140 IncrementalHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 181 mSDtfsCounter, 140 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=2, InterpolantAutomatonStates: 20, 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, 0.7s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 252 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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 09:26:36,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.seq.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 51c029c3e6da7a855218885875d9decd9132b07b4b4a0cd8ca561de10b840446 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:26:38,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:26:38,795 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-08 09:26:38,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:26:38,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:26:38,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:26:38,822 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:26:38,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:26:38,822 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:26:38,823 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:26:38,823 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:26:38,824 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:26:38,824 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:26:38,824 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:26:38,824 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:26:38,825 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:26:38,825 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:26:38,825 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:26:38,825 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:26:38,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:26:38,825 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:26:38,825 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 09:26:38,825 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 09:26:38,825 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 09:26:38,825 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:26:38,825 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:26:38,825 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:26:38,825 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:26:38,825 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:26:38,826 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:26:38,826 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:26:38,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:26:38,826 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:26:38,826 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:26:38,826 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:26:38,826 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:26:38,826 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 09:26:38,826 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 09:26:38,826 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:26:38,826 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:26:38,826 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:26:38,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:26:38,826 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 51c029c3e6da7a855218885875d9decd9132b07b4b4a0cd8ca561de10b840446 [2025-03-08 09:26:39,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:26:39,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:26:39,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:26:39,051 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:26:39,051 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:26:39,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.seq.c [2025-03-08 09:26:40,207 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c3ba32a8/3721122dbd404c34b4c75469c6def33e/FLAG475b4034b [2025-03-08 09:26:40,400 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:26:40,401 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.seq.c [2025-03-08 09:26:40,408 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c3ba32a8/3721122dbd404c34b4c75469c6def33e/FLAG475b4034b [2025-03-08 09:26:40,772 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c3ba32a8/3721122dbd404c34b4c75469c6def33e [2025-03-08 09:26:40,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:26:40,775 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:26:40,775 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:26:40,777 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:26:40,780 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:26:40,781 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:26:40" (1/1) ... [2025-03-08 09:26:40,781 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30b0aa53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:40, skipping insertion in model container [2025-03-08 09:26:40,782 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:26:40" (1/1) ... [2025-03-08 09:26:40,797 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:26:40,889 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.seq.c[1297,1310] [2025-03-08 09:26:40,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:26:40,915 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:26:40,922 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.seq.c[1297,1310] [2025-03-08 09:26:40,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:26:40,943 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:26:40,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:40 WrapperNode [2025-03-08 09:26:40,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:26:40,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:26:40,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:26:40,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:26:40,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:40" (1/1) ... [2025-03-08 09:26:40,957 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:40" (1/1) ... [2025-03-08 09:26:40,972 INFO L138 Inliner]: procedures = 18, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85 [2025-03-08 09:26:40,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:26:40,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:26:40,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:26:40,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:26:40,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:40" (1/1) ... [2025-03-08 09:26:40,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:40" (1/1) ... [2025-03-08 09:26:40,982 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:40" (1/1) ... [2025-03-08 09:26:40,990 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6]. The 0 writes are split as follows [0, 0]. [2025-03-08 09:26:40,992 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:40" (1/1) ... [2025-03-08 09:26:40,992 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:40" (1/1) ... [2025-03-08 09:26:40,996 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:40" (1/1) ... [2025-03-08 09:26:41,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:40" (1/1) ... [2025-03-08 09:26:41,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:40" (1/1) ... [2025-03-08 09:26:41,002 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:40" (1/1) ... [2025-03-08 09:26:41,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:26:41,007 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:26:41,009 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:26:41,009 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:26:41,010 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:40" (1/1) ... [2025-03-08 09:26:41,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:26:41,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:26:41,039 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 09:26:41,041 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 09:26:41,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:26:41,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 09:26:41,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 09:26:41,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:26:41,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:26:41,119 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:26:41,120 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:26:41,225 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-08 09:26:41,225 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:26:41,231 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:26:41,231 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:26:41,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:26:41 BoogieIcfgContainer [2025-03-08 09:26:41,232 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:26:41,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:26:41,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:26:41,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:26:41,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:26:40" (1/3) ... [2025-03-08 09:26:41,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c887560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:26:41, skipping insertion in model container [2025-03-08 09:26:41,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:26:40" (2/3) ... [2025-03-08 09:26:41,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c887560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:26:41, skipping insertion in model container [2025-03-08 09:26:41,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:26:41" (3/3) ... [2025-03-08 09:26:41,242 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.seq.c [2025-03-08 09:26:41,251 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:26:41,252 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.seq.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:26:41,280 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:26:41,290 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;@7728ff31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:26:41,290 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:26:41,295 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 09:26:41,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 09:26:41,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:26:41,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 09:26:41,302 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:26:41,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:26:41,306 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-08 09:26:41,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:26:41,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [303118033] [2025-03-08 09:26:41,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:26:41,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:26:41,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:26:41,318 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 09:26:41,319 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 09:26:41,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 09:26:41,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 09:26:41,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:26:41,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:26:41,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 09:26:41,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:26:41,639 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 09:26:41,639 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:26:41,639 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:26:41,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303118033] [2025-03-08 09:26:41,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303118033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:26:41,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:26:41,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:26:41,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080241026] [2025-03-08 09:26:41,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:26:41,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:26:41,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:26:41,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:26:41,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:26:41,659 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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 09:26:41,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:26:41,699 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-08 09:26:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:26:41,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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 09:26:41,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:26:41,704 INFO L225 Difference]: With dead ends: 18 [2025-03-08 09:26:41,704 INFO L226 Difference]: Without dead ends: 10 [2025-03-08 09:26:41,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:26:41,707 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:26:41,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:26:41,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-08 09:26:41,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-08 09:26:41,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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 09:26:41,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-08 09:26:41,723 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-08 09:26:41,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:26:41,724 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-08 09:26:41,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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 09:26:41,724 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-08 09:26:41,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 09:26:41,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:26:41,724 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-08 09:26:41,732 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 09:26:41,924 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 09:26:41,925 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:26:41,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:26:41,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-08 09:26:41,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:26:41,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [288492657] [2025-03-08 09:26:41,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:26:41,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:26:41,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:26:41,928 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 09:26:41,929 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 09:26:41,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 09:26:41,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 09:26:41,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:26:41,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:26:41,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 09:26:41,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:26:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:26:42,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:26:42,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:26:42,857 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:26:42,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288492657] [2025-03-08 09:26:42,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288492657] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:26:42,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 09:26:42,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-08 09:26:42,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153416872] [2025-03-08 09:26:42,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 09:26:42,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 09:26:42,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:26:42,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 09:26:42,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-08 09:26:42,860 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:26:43,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:26:43,242 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2025-03-08 09:26:43,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 09:26:43,242 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 09:26:43,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:26:43,243 INFO L225 Difference]: With dead ends: 18 [2025-03-08 09:26:43,243 INFO L226 Difference]: Without dead ends: 16 [2025-03-08 09:26:43,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2025-03-08 09:26:43,244 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:26:43,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:26:43,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-08 09:26:43,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-03-08 09:26:43,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 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 09:26:43,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-03-08 09:26:43,248 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2025-03-08 09:26:43,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:26:43,248 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-03-08 09:26:43,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:26:43,248 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-03-08 09:26:43,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 09:26:43,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:26:43,249 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2025-03-08 09:26:43,257 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 09:26:43,449 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 09:26:43,450 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:26:43,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:26:43,450 INFO L85 PathProgramCache]: Analyzing trace with hash -506187805, now seen corresponding path program 2 times [2025-03-08 09:26:43,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:26:43,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1900793957] [2025-03-08 09:26:43,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 09:26:43,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:26:43,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:26:43,454 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 09:26:43,455 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 09:26:43,499 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-08 09:26:43,529 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 09:26:43,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 09:26:43,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:26:43,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 09:26:43,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:26:43,900 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:26:43,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:26:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:26:47,602 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:26:47,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900793957] [2025-03-08 09:26:47,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900793957] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:26:47,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 09:26:47,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-03-08 09:26:47,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146749392] [2025-03-08 09:26:47,603 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 09:26:47,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 09:26:47,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:26:47,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 09:26:47,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-08 09:26:47,604 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:26:50,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:26:50,702 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2025-03-08 09:26:50,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 09:26:50,703 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 09:26:50,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:26:50,704 INFO L225 Difference]: With dead ends: 30 [2025-03-08 09:26:50,704 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 09:26:50,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2025-03-08 09:26:50,705 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 09:26:50,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 25 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 09:26:50,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 09:26:50,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2025-03-08 09:26:50,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 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 09:26:50,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2025-03-08 09:26:50,712 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2025-03-08 09:26:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:26:50,712 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2025-03-08 09:26:50,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:26:50,713 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2025-03-08 09:26:50,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 09:26:50,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:26:50,713 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2025-03-08 09:26:50,720 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 09:26:50,914 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 09:26:50,914 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:26:50,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:26:50,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1480598813, now seen corresponding path program 3 times [2025-03-08 09:26:50,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:26:50,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1911731585] [2025-03-08 09:26:50,915 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 09:26:50,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:26:50,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:26:50,919 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 09:26:50,919 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 09:26:50,972 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 8 equivalence classes. [2025-03-08 09:26:50,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 11 of 26 statements. [2025-03-08 09:26:50,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 09:26:50,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:26:51,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 09:26:51,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:26:52,014 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 09:26:52,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:27:09,204 WARN L286 SmtUtils]: Spent 9.92s on a formula simplification that was a NOOP. DAG size: 127 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)