./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 1ed4a8166e43af31025ed37886c26d8ffdcca7c92b59539857ec6cced7b52d7d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 07:11:36,018 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 07:11:36,056 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 07:11:36,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 07:11:36,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 07:11:36,089 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 07:11:36,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 07:11:36,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 07:11:36,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 07:11:36,090 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 07:11:36,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 07:11:36,090 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 07:11:36,090 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 07:11:36,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 07:11:36,091 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 07:11:36,091 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 07:11:36,091 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 07:11:36,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 07:11:36,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 07:11:36,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 07:11:36,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 07:11:36,092 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 07:11:36,092 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 07:11:36,092 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 07:11:36,092 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 07:11:36,092 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 07:11:36,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:11:36,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:11:36,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:11:36,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:11:36,095 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 07:11:36,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:11:36,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:11:36,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:11:36,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:11:36,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 07:11:36,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 07:11:36,096 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 07:11:36,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 07:11:36,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 07:11:36,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 07:11:36,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 07:11:36,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 07:11:36,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 07:11:36,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 07:11:36,096 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-jdk21/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 -> 1ed4a8166e43af31025ed37886c26d8ffdcca7c92b59539857ec6cced7b52d7d [2025-01-09 07:11:36,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 07:11:36,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 07:11:36,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 07:11:36,380 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 07:11:36,380 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 07:11:36,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.c [2025-01-09 07:11:37,646 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d369acd1a/b191cb11ad7444a891e8c6fda4749b8d/FLAGda13e1c49 [2025-01-09 07:11:37,898 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 07:11:37,898 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.c [2025-01-09 07:11:37,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d369acd1a/b191cb11ad7444a891e8c6fda4749b8d/FLAGda13e1c49 [2025-01-09 07:11:37,927 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d369acd1a/b191cb11ad7444a891e8c6fda4749b8d [2025-01-09 07:11:37,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 07:11:37,929 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 07:11:37,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 07:11:37,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 07:11:37,935 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 07:11:37,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:11:37" (1/1) ... [2025-01-09 07:11:37,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41826497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:37, skipping insertion in model container [2025-01-09 07:11:37,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:11:37" (1/1) ... [2025-01-09 07:11:37,952 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 07:11:38,091 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.c[1249,1262] [2025-01-09 07:11:38,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:11:38,144 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 07:11:38,154 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.c[1249,1262] [2025-01-09 07:11:38,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:11:38,203 INFO L204 MainTranslator]: Completed translation [2025-01-09 07:11:38,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:38 WrapperNode [2025-01-09 07:11:38,204 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 07:11:38,205 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 07:11:38,205 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 07:11:38,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 07:11:38,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:38" (1/1) ... [2025-01-09 07:11:38,220 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:38" (1/1) ... [2025-01-09 07:11:38,259 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 415 [2025-01-09 07:11:38,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 07:11:38,260 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 07:11:38,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 07:11:38,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 07:11:38,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:38" (1/1) ... [2025-01-09 07:11:38,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:38" (1/1) ... [2025-01-09 07:11:38,274 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:38" (1/1) ... [2025-01-09 07:11:38,288 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 07:11:38,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:38" (1/1) ... [2025-01-09 07:11:38,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:38" (1/1) ... [2025-01-09 07:11:38,298 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:38" (1/1) ... [2025-01-09 07:11:38,300 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:38" (1/1) ... [2025-01-09 07:11:38,303 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:38" (1/1) ... [2025-01-09 07:11:38,306 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:38" (1/1) ... [2025-01-09 07:11:38,308 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:38" (1/1) ... [2025-01-09 07:11:38,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 07:11:38,319 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 07:11:38,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 07:11:38,319 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 07:11:38,319 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:38" (1/1) ... [2025-01-09 07:11:38,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:11:38,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:11:38,343 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 07:11:38,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 07:11:38,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 07:11:38,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 07:11:38,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 07:11:38,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 07:11:38,430 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 07:11:38,431 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 07:11:38,911 INFO L? ?]: Removed 188 outVars from TransFormulas that were not future-live. [2025-01-09 07:11:38,912 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 07:11:38,920 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 07:11:38,922 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 07:11:38,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:11:38 BoogieIcfgContainer [2025-01-09 07:11:38,922 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 07:11:38,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 07:11:38,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 07:11:38,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 07:11:38,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 07:11:37" (1/3) ... [2025-01-09 07:11:38,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a327e94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:11:38, skipping insertion in model container [2025-01-09 07:11:38,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:38" (2/3) ... [2025-01-09 07:11:38,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a327e94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:11:38, skipping insertion in model container [2025-01-09 07:11:38,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:11:38" (3/3) ... [2025-01-09 07:11:38,930 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v4.c [2025-01-09 07:11:38,942 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 07:11:38,943 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.eq_sdp_v4.c that has 1 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 07:11:38,986 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 07:11:38,997 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;@69c8e218, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 07:11:38,997 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 07:11:39,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 92 states have (on average 1.4891304347826086) internal successors, (137), 93 states have internal predecessors, (137), 0 states have call successors, (0), 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-01-09 07:11:39,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 07:11:39,005 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:11:39,006 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:11:39,006 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:11:39,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:11:39,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1364539026, now seen corresponding path program 1 times [2025-01-09 07:11:39,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:11:39,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056561888] [2025-01-09 07:11:39,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:11:39,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:11:39,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 07:11:39,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 07:11:39,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:11:39,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:11:39,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:11:39,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:11:39,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056561888] [2025-01-09 07:11:39,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056561888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:11:39,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:11:39,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:11:39,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925979429] [2025-01-09 07:11:39,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:11:39,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:11:39,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:11:39,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:11:39,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:11:39,590 INFO L87 Difference]: Start difference. First operand has 94 states, 92 states have (on average 1.4891304347826086) internal successors, (137), 93 states have internal predecessors, (137), 0 states have call successors, (0), 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 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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-01-09 07:11:39,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:11:39,648 INFO L93 Difference]: Finished difference Result 139 states and 204 transitions. [2025-01-09 07:11:39,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:11:39,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-01-09 07:11:39,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:11:39,656 INFO L225 Difference]: With dead ends: 139 [2025-01-09 07:11:39,656 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 07:11:39,660 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-01-09 07:11:39,665 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 105 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:11:39,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 249 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:11:39,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 07:11:39,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 07:11:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 90 states have internal predecessors, (131), 0 states have call successors, (0), 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-01-09 07:11:39,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2025-01-09 07:11:39,693 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 35 [2025-01-09 07:11:39,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:11:39,697 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2025-01-09 07:11:39,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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-01-09 07:11:39,697 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2025-01-09 07:11:39,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 07:11:39,698 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:11:39,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:11:39,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 07:11:39,698 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:11:39,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:11:39,700 INFO L85 PathProgramCache]: Analyzing trace with hash -689406165, now seen corresponding path program 1 times [2025-01-09 07:11:39,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:11:39,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536963544] [2025-01-09 07:11:39,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:11:39,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:11:39,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 07:11:39,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 07:11:39,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:11:39,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:11:39,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:11:39,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:11:39,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536963544] [2025-01-09 07:11:39,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536963544] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:11:39,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:11:39,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:11:39,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685441170] [2025-01-09 07:11:39,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:11:39,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:11:39,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:11:39,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:11:39,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:11:39,990 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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-01-09 07:11:40,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:11:40,014 INFO L93 Difference]: Finished difference Result 95 states and 135 transitions. [2025-01-09 07:11:40,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:11:40,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-01-09 07:11:40,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:11:40,016 INFO L225 Difference]: With dead ends: 95 [2025-01-09 07:11:40,016 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 07:11:40,016 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-01-09 07:11:40,016 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:11:40,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 381 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:11:40,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 07:11:40,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-01-09 07:11:40,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 92 states have internal predecessors, (133), 0 states have call successors, (0), 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-01-09 07:11:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2025-01-09 07:11:40,026 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 37 [2025-01-09 07:11:40,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:11:40,028 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2025-01-09 07:11:40,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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-01-09 07:11:40,028 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2025-01-09 07:11:40,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 07:11:40,028 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:11:40,030 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:11:40,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 07:11:40,030 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:11:40,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:11:40,031 INFO L85 PathProgramCache]: Analyzing trace with hash 104940713, now seen corresponding path program 1 times [2025-01-09 07:11:40,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:11:40,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112718955] [2025-01-09 07:11:40,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:11:40,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:11:40,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 07:11:40,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 07:11:40,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:11:40,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 07:11:40,065 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 07:11:40,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 07:11:40,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 07:11:40,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:11:40,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 07:11:40,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 07:11:40,113 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 07:11:40,114 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 07:11:40,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 07:11:40,117 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 07:11:40,149 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 07:11:40,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 07:11:40 BoogieIcfgContainer [2025-01-09 07:11:40,155 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 07:11:40,156 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 07:11:40,156 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 07:11:40,156 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 07:11:40,157 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:11:38" (3/4) ... [2025-01-09 07:11:40,158 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 07:11:40,160 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 07:11:40,161 INFO L158 Benchmark]: Toolchain (without parser) took 2231.65ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 86.3MB in the end (delta: 25.7MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2025-01-09 07:11:40,161 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 07:11:40,161 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.09ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 95.8MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 07:11:40,161 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.89ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 87.1MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 07:11:40,161 INFO L158 Benchmark]: Boogie Preprocessor took 57.92ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 81.6MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 07:11:40,162 INFO L158 Benchmark]: RCFGBuilder took 603.76ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 99.9MB in the end (delta: -18.3MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. [2025-01-09 07:11:40,162 INFO L158 Benchmark]: TraceAbstraction took 1231.82ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 86.3MB in the end (delta: 12.8MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2025-01-09 07:11:40,162 INFO L158 Benchmark]: Witness Printer took 4.46ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 86.3MB in the end (delta: 15.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 07:11:40,165 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.20ms. Allocated memory is still 201.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.09ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 95.8MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.89ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 87.1MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.92ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 81.6MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 603.76ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 99.9MB in the end (delta: -18.3MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1231.82ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 86.3MB in the end (delta: 12.8MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * Witness Printer took 4.46ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 86.3MB in the end (delta: 15.6kB). 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: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 99. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_1 var_9 = 0; [L33] const SORT_5 var_17 = 1; [L34] const SORT_5 var_29 = 0; [L35] const SORT_1 var_75 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_5 input_7; [L42] SORT_5 input_8; [L43] SORT_5 input_27; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L45] SORT_1 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L46] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L47] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L48] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L49] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L50] SORT_5 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L51] SORT_1 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L52] SORT_5 state_34 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L53] SORT_1 state_36 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L54] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L55] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] SORT_1 init_11_arg_1 = var_9; [L58] state_10 = init_11_arg_1 [L59] SORT_1 init_13_arg_1 = var_9; [L60] state_12 = init_13_arg_1 [L61] SORT_1 init_22_arg_1 = var_9; [L62] state_21 = init_22_arg_1 [L63] SORT_1 init_24_arg_1 = var_9; [L64] state_23 = init_24_arg_1 [L65] SORT_1 init_26_arg_1 = var_9; [L66] state_25 = init_26_arg_1 [L67] SORT_5 init_31_arg_1 = var_29; [L68] state_30 = init_31_arg_1 [L69] SORT_1 init_33_arg_1 = var_9; [L70] state_32 = init_33_arg_1 [L71] SORT_5 init_35_arg_1 = var_29; [L72] state_34 = init_35_arg_1 [L73] SORT_1 init_37_arg_1 = var_9; [L74] state_36 = init_37_arg_1 [L75] SORT_1 init_40_arg_1 = var_9; [L76] state_39 = init_40_arg_1 [L77] SORT_1 init_42_arg_1 = var_9; [L78] state_41 = init_42_arg_1 VAL [mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L81] input_2 = __VERIFIER_nondet_uchar() [L82] input_3 = __VERIFIER_nondet_uchar() [L83] input_4 = __VERIFIER_nondet_uchar() [L84] input_6 = __VERIFIER_nondet_uchar() [L85] input_7 = __VERIFIER_nondet_uchar() [L86] EXPR input_7 & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L86] input_7 = input_7 & mask_SORT_5 [L87] input_8 = __VERIFIER_nondet_uchar() [L88] EXPR input_8 & mask_SORT_5 VAL [input_7=0, mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L88] input_8 = input_8 & mask_SORT_5 [L89] input_27 = __VERIFIER_nondet_uchar() [L92] SORT_1 var_14_arg_0 = state_10; [L93] SORT_1 var_14_arg_1 = state_12; [L94] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L95] SORT_5 var_18_arg_0 = var_14; [L96] SORT_5 var_18 = ~var_18_arg_0; [L97] SORT_5 var_19_arg_0 = var_17; [L98] SORT_5 var_19_arg_1 = var_18; VAL [input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_19_arg_0=1, var_19_arg_1=-2, var_29=0, var_75=1, var_9=0] [L99] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L99] SORT_5 var_19 = var_19_arg_0 & var_19_arg_1; [L100] EXPR var_19 & mask_SORT_5 VAL [input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L100] var_19 = var_19 & mask_SORT_5 [L101] SORT_5 bad_20_arg_0 = var_19; [L102] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 105 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 630 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 376 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 254 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=0, InterpolantAutomatonStates: 8, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 142 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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-01-09 07:11:40,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 1ed4a8166e43af31025ed37886c26d8ffdcca7c92b59539857ec6cced7b52d7d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 07:11:42,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 07:11:42,310 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-01-09 07:11:42,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 07:11:42,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 07:11:42,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 07:11:42,344 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 07:11:42,344 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 07:11:42,345 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 07:11:42,345 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 07:11:42,345 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 07:11:42,345 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 07:11:42,345 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 07:11:42,345 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 07:11:42,345 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 07:11:42,346 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 07:11:42,346 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 07:11:42,346 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 07:11:42,346 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 07:11:42,346 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 07:11:42,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 07:11:42,346 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 07:11:42,346 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 07:11:42,346 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 07:11:42,346 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 07:11:42,347 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 07:11:42,347 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 07:11:42,347 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 07:11:42,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:11:42,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:11:42,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:11:42,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:11:42,347 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 07:11:42,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:11:42,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:11:42,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:11:42,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:11:42,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 07:11:42,347 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 07:11:42,347 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 07:11:42,347 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 07:11:42,347 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 07:11:42,347 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 07:11:42,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 07:11:42,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 07:11:42,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 07:11:42,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 07:11:42,348 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-jdk21/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 -> 1ed4a8166e43af31025ed37886c26d8ffdcca7c92b59539857ec6cced7b52d7d [2025-01-09 07:11:42,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 07:11:42,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 07:11:42,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 07:11:42,635 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 07:11:42,638 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 07:11:42,639 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.c [2025-01-09 07:11:43,998 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e70b44ef8/e47fa40843dd4de8ad28e9bad551aabd/FLAG6e53376a8 [2025-01-09 07:11:44,160 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 07:11:44,161 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.c [2025-01-09 07:11:44,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e70b44ef8/e47fa40843dd4de8ad28e9bad551aabd/FLAG6e53376a8 [2025-01-09 07:11:44,176 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e70b44ef8/e47fa40843dd4de8ad28e9bad551aabd [2025-01-09 07:11:44,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 07:11:44,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 07:11:44,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 07:11:44,180 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 07:11:44,183 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 07:11:44,183 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:11:44" (1/1) ... [2025-01-09 07:11:44,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34121465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:44, skipping insertion in model container [2025-01-09 07:11:44,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:11:44" (1/1) ... [2025-01-09 07:11:44,196 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 07:11:44,283 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.c[1249,1262] [2025-01-09 07:11:44,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:11:44,329 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 07:11:44,336 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.c[1249,1262] [2025-01-09 07:11:44,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:11:44,368 INFO L204 MainTranslator]: Completed translation [2025-01-09 07:11:44,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:44 WrapperNode [2025-01-09 07:11:44,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 07:11:44,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 07:11:44,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 07:11:44,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 07:11:44,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:44" (1/1) ... [2025-01-09 07:11:44,380 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:44" (1/1) ... [2025-01-09 07:11:44,403 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 247 [2025-01-09 07:11:44,403 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 07:11:44,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 07:11:44,405 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 07:11:44,405 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 07:11:44,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:44" (1/1) ... [2025-01-09 07:11:44,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:44" (1/1) ... [2025-01-09 07:11:44,419 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:44" (1/1) ... [2025-01-09 07:11:44,439 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 07:11:44,439 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:44" (1/1) ... [2025-01-09 07:11:44,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:44" (1/1) ... [2025-01-09 07:11:44,447 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:44" (1/1) ... [2025-01-09 07:11:44,448 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:44" (1/1) ... [2025-01-09 07:11:44,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:44" (1/1) ... [2025-01-09 07:11:44,454 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:44" (1/1) ... [2025-01-09 07:11:44,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:44" (1/1) ... [2025-01-09 07:11:44,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 07:11:44,461 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 07:11:44,461 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 07:11:44,461 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 07:11:44,462 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:44" (1/1) ... [2025-01-09 07:11:44,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:11:44,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:11:44,492 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 07:11:44,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 07:11:44,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 07:11:44,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 07:11:44,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 07:11:44,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 07:11:44,591 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 07:11:44,592 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 07:11:44,798 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-01-09 07:11:44,799 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 07:11:44,805 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 07:11:44,805 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 07:11:44,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:11:44 BoogieIcfgContainer [2025-01-09 07:11:44,805 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 07:11:44,807 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 07:11:44,807 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 07:11:44,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 07:11:44,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 07:11:44" (1/3) ... [2025-01-09 07:11:44,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e2c30e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:11:44, skipping insertion in model container [2025-01-09 07:11:44,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:11:44" (2/3) ... [2025-01-09 07:11:44,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e2c30e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:11:44, skipping insertion in model container [2025-01-09 07:11:44,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:11:44" (3/3) ... [2025-01-09 07:11:44,818 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v4.c [2025-01-09 07:11:44,829 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 07:11:44,831 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.eq_sdp_v4.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 07:11:44,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 07:11:44,881 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;@12d5cf8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 07:11:44,882 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 07:11:44,884 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-01-09 07:11:44,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 07:11:44,888 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:11:44,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 07:11:44,889 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:11:44,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:11:44,893 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2025-01-09 07:11:44,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 07:11:44,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [639187780] [2025-01-09 07:11:44,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:11:44,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:11:44,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:11:44,907 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:11:44,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 07:11:45,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 07:11:45,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 07:11:45,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:11:45,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:11:45,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 07:11:45,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:11:45,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:11:45,189 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 07:11:45,189 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 07:11:45,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639187780] [2025-01-09 07:11:45,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639187780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:11:45,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:11:45,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:11:45,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735585336] [2025-01-09 07:11:45,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:11:45,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:11:45,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 07:11:45,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:11:45,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:11:45,229 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-01-09 07:11:45,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:11:45,253 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-01-09 07:11:45,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:11:45,254 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-01-09 07:11:45,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:11:45,258 INFO L225 Difference]: With dead ends: 17 [2025-01-09 07:11:45,258 INFO L226 Difference]: Without dead ends: 9 [2025-01-09 07:11:45,260 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-01-09 07:11:45,262 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 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-01-09 07:11:45,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:11:45,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-01-09 07:11:45,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-01-09 07:11:45,277 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-01-09 07:11:45,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-01-09 07:11:45,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-01-09 07:11:45,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:11:45,280 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-01-09 07:11:45,280 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-01-09 07:11:45,280 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-01-09 07:11:45,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 07:11:45,280 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:11:45,280 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-09 07:11:45,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 07:11:45,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:11:45,485 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:11:45,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:11:45,486 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2025-01-09 07:11:45,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 07:11:45,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [919287612] [2025-01-09 07:11:45,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:11:45,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:11:45,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:11:45,491 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:11:45,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 07:11:45,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 07:11:45,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 07:11:45,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:11:45,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:11:45,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 07:11:45,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:11:45,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:11:45,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 07:11:50,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:11:50,302 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 07:11:50,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919287612] [2025-01-09 07:11:50,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919287612] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 07:11:50,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 07:11:50,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-01-09 07:11:50,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547177548] [2025-01-09 07:11:50,302 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 07:11:50,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 07:11:50,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 07:11:50,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 07:11:50,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 07:11:50,304 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-01-09 07:11:50,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:11:50,829 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-01-09 07:11:50,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 07:11:50,832 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-01-09 07:11:50,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:11:50,832 INFO L225 Difference]: With dead ends: 14 [2025-01-09 07:11:50,832 INFO L226 Difference]: Without dead ends: 12 [2025-01-09 07:11:50,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-09 07:11:50,833 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:11:50,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:11:50,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-01-09 07:11:50,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-01-09 07:11:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:11:50,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-01-09 07:11:50,840 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-01-09 07:11:50,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:11:50,840 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-01-09 07:11:50,840 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-01-09 07:11:50,840 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-01-09 07:11:50,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 07:11:50,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:11:50,841 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-01-09 07:11:50,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 07:11:51,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:11:51,041 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:11:51,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:11:51,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2025-01-09 07:11:51,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 07:11:51,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1440581045] [2025-01-09 07:11:51,042 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 07:11:51,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:11:51,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:11:51,046 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:11:51,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 07:11:51,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-09 07:11:51,153 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 07:11:51,153 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 07:11:51,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:11:51,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-09 07:11:51,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:11:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:11:53,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 07:12:04,956 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse28 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_5~0#1|)) (.cse26 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_21~0#1|)) (.cse3 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_75~0#1|))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse26 .cse3)))) (.cse25 (forall ((|v_ULTIMATE.start_main_~var_19_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_0~0#1_16|)))) .cse28))))) (.cse13 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_29~0#1|))))))) (.cse29 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_9~0#1|)))) (.cse15 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_25~0#1|)))) (.cse16 (= ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_30~0#1|))))) (_ bv0 8))) (.cse27 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_23~0#1|))) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse26 .cse27)))))))) (.cse8 (not .cse16)) (.cse6 (bvneg .cse15)) (.cse10 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvmul (_ bv2 32) .cse29)))))))) (.cse20 (not .cse13)) (.cse21 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg .cse29) .cse29)))))))) (.cse12 ((_ zero_extend 24) ((_ extract 7 0) .cse29))) (.cse7 (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|)))) .cse3))) .cse25)) (.cse0 (forall ((|v_ULTIMATE.start_main_~var_19_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_0~0#1_16|)))) .cse28))))) (.cse17 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse26 (bvneg .cse27))))))))) (.cse4 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_39~0#1|)))))) (.cse9 (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|)))) .cse3)) .cse25))) (and (or (and (or .cse0 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse2 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse2))) .cse3)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse5 .cse6))))))) .cse2)))))))) .cse7) .cse8) (or (and .cse9 (or .cse0 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse11 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse10 .cse11))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 .cse11)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse11))) .cse3)))))) .cse13) (or (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse14 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse14))) .cse3)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse5 .cse15))))))) .cse14))))))) .cse0) .cse7) .cse16) (or .cse8 (and .cse9 (or .cse0 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse18 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 .cse17))))))) .cse18))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse4)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse18))) .cse3))))))) (or (and .cse7 (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse19 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse19))) .cse3)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse10 .cse19))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 .cse19))))))) .cse0)) .cse13) (or .cse20 (and .cse9 (or .cse0 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse22 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse21 .cse22))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 .cse22)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse22))) .cse3))))))) (or .cse20 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse23 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse23))) .cse3)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse21 .cse23))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 .cse23))))))) .cse0) .cse7)) (or (and (or .cse0 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse17 .cse15))))))) .cse24))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse4)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse24))) .cse3))))) .cse9) .cse16))))) is different from false [2025-01-09 07:12:16,483 WARN L286 SmtUtils]: Spent 5.44s on a formula simplification that was a NOOP. DAG size: 208 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 07:12:21,816 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-01-09 07:12:21,816 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 07:12:21,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440581045] [2025-01-09 07:12:21,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440581045] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 07:12:21,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 07:12:21,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2025-01-09 07:12:21,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721931797] [2025-01-09 07:12:21,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 07:12:21,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 07:12:21,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 07:12:21,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 07:12:21,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2025-01-09 07:12:21,817 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:12:35,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:12:35,266 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2025-01-09 07:12:35,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 07:12:35,268 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-09 07:12:35,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:12:35,268 INFO L225 Difference]: With dead ends: 17 [2025-01-09 07:12:35,268 INFO L226 Difference]: Without dead ends: 15 [2025-01-09 07:12:35,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=73, Invalid=202, Unknown=1, NotChecked=30, Total=306 [2025-01-09 07:12:35,269 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 07:12:35,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 9 Unchecked, 1.7s Time] [2025-01-09 07:12:35,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-09 07:12:35,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-01-09 07:12:35,272 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-01-09 07:12:35,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-01-09 07:12:35,273 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2025-01-09 07:12:35,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:12:35,273 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-01-09 07:12:35,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:12:35,273 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-01-09 07:12:35,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 07:12:35,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:12:35,273 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2025-01-09 07:12:35,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 07:12:35,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:12:35,474 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:12:35,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:12:35,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 3 times [2025-01-09 07:12:35,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 07:12:35,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1995846267] [2025-01-09 07:12:35,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 07:12:35,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:12:35,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:12:35,478 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:12:35,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 07:12:35,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 4 equivalence classes. [2025-01-09 07:12:35,857 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 07:12:35,857 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 07:12:35,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:12:35,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 07:12:35,865 INFO L279 TraceCheckSpWp]: Computing forward predicates...