./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_DAIO.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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.v_DAIO.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 a68330c23bd8fa71b4f2c1a72229a125c9c545dc64c1e4d5015a2916cb213688 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:08:27,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:08:27,368 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 20:08:27,372 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:08:27,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:08:27,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:08:27,394 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:08:27,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:08:27,395 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:08:27,395 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:08:27,396 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:08:27,396 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:08:27,396 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:08:27,396 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:08:27,397 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:08:27,397 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:08:27,397 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:08:27,397 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:08:27,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:08:27,397 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:08:27,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:08:27,397 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:08:27,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:08:27,397 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:08:27,398 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:08:27,398 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:08:27,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:08:27,398 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:08:27,398 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:08:27,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:08:27,398 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:08:27,398 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:08:27,398 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:08:27,399 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:08:27,399 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:08:27,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:08:27,399 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:08:27,399 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:08:27,399 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:08:27,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:08:27,399 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 -> a68330c23bd8fa71b4f2c1a72229a125c9c545dc64c1e4d5015a2916cb213688 [2025-02-05 20:08:27,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:08:27,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:08:27,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:08:27,670 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:08:27,670 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:08:27,671 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.v_DAIO.c [2025-02-05 20:08:28,837 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/329dd977c/c3c2d6b760bd4e5fae1bcff4230ac0b9/FLAG4745f8dea [2025-02-05 20:08:29,216 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:08:29,217 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_DAIO.c [2025-02-05 20:08:29,228 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/329dd977c/c3c2d6b760bd4e5fae1bcff4230ac0b9/FLAG4745f8dea [2025-02-05 20:08:29,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/329dd977c/c3c2d6b760bd4e5fae1bcff4230ac0b9 [2025-02-05 20:08:29,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:08:29,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:08:29,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:08:29,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:08:29,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:08:29,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:08:29" (1/1) ... [2025-02-05 20:08:29,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5383518e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:29, skipping insertion in model container [2025-02-05 20:08:29,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:08:29" (1/1) ... [2025-02-05 20:08:29,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:08:29,597 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.v_DAIO.c[1246,1259] [2025-02-05 20:08:29,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:08:29,813 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:08:29,823 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.v_DAIO.c[1246,1259] [2025-02-05 20:08:29,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:08:29,935 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:08:29,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:29 WrapperNode [2025-02-05 20:08:29,936 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:08:29,937 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:08:29,937 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:08:29,937 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:08:29,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:29" (1/1) ... [2025-02-05 20:08:29,979 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:29" (1/1) ... [2025-02-05 20:08:30,108 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1815 [2025-02-05 20:08:30,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:08:30,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:08:30,110 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:08:30,110 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:08:30,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:29" (1/1) ... [2025-02-05 20:08:30,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:29" (1/1) ... [2025-02-05 20:08:30,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:29" (1/1) ... [2025-02-05 20:08:30,189 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-02-05 20:08:30,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:29" (1/1) ... [2025-02-05 20:08:30,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:29" (1/1) ... [2025-02-05 20:08:30,302 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:29" (1/1) ... [2025-02-05 20:08:30,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:29" (1/1) ... [2025-02-05 20:08:30,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:29" (1/1) ... [2025-02-05 20:08:30,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:29" (1/1) ... [2025-02-05 20:08:30,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:08:30,350 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:08:30,350 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:08:30,350 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:08:30,351 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:29" (1/1) ... [2025-02-05 20:08:30,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:08:30,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:08:30,383 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-02-05 20:08:30,386 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-02-05 20:08:30,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:08:30,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:08:30,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:08:30,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:08:30,658 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:08:30,662 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:08:31,855 INFO L? ?]: Removed 1165 outVars from TransFormulas that were not future-live. [2025-02-05 20:08:31,855 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:08:31,888 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:08:31,888 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:08:31,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:08:31 BoogieIcfgContainer [2025-02-05 20:08:31,889 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:08:31,890 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:08:31,890 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:08:31,893 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:08:31,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:08:29" (1/3) ... [2025-02-05 20:08:31,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f992656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:08:31, skipping insertion in model container [2025-02-05 20:08:31,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:29" (2/3) ... [2025-02-05 20:08:31,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f992656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:08:31, skipping insertion in model container [2025-02-05 20:08:31,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:08:31" (3/3) ... [2025-02-05 20:08:31,895 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.v_DAIO.c [2025-02-05 20:08:31,904 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:08:31,905 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.v_DAIO.c that has 1 procedures, 230 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:08:31,969 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:08:31,976 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;@6399092, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:08:31,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:08:31,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 230 states, 228 states have (on average 1.4956140350877194) internal successors, (341), 229 states have internal predecessors, (341), 0 states have call successors, (0), 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-02-05 20:08:31,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-05 20:08:31,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:31,983 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:31,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:31,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:31,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1423572003, now seen corresponding path program 1 times [2025-02-05 20:08:31,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:31,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382071894] [2025-02-05 20:08:31,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:31,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:32,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-05 20:08:32,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-05 20:08:32,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:32,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:32,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:08:32,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:32,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382071894] [2025-02-05 20:08:32,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382071894] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:32,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:32,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:08:32,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625725640] [2025-02-05 20:08:32,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:32,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:08:32,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:32,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:08:32,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:08:32,424 INFO L87 Difference]: Start difference. First operand has 230 states, 228 states have (on average 1.4956140350877194) internal successors, (341), 229 states have internal predecessors, (341), 0 states have call successors, (0), 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 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:08:32,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:32,608 INFO L93 Difference]: Finished difference Result 433 states and 645 transitions. [2025-02-05 20:08:32,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:08:32,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-05 20:08:32,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:32,616 INFO L225 Difference]: With dead ends: 433 [2025-02-05 20:08:32,616 INFO L226 Difference]: Without dead ends: 229 [2025-02-05 20:08:32,618 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-02-05 20:08:32,620 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 0 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:32,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 835 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:08:32,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-02-05 20:08:32,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2025-02-05 20:08:32,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.486842105263158) internal successors, (339), 228 states have internal predecessors, (339), 0 states have call successors, (0), 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-02-05 20:08:32,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 339 transitions. [2025-02-05 20:08:32,649 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 339 transitions. Word has length 31 [2025-02-05 20:08:32,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:32,650 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 339 transitions. [2025-02-05 20:08:32,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:08:32,650 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 339 transitions. [2025-02-05 20:08:32,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-05 20:08:32,651 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:32,651 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] [2025-02-05 20:08:32,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 20:08:32,651 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:32,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:32,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1176379694, now seen corresponding path program 1 times [2025-02-05 20:08:32,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:32,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670150828] [2025-02-05 20:08:32,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:32,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:32,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-05 20:08:32,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 20:08:32,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:32,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:32,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:08:32,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:32,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670150828] [2025-02-05 20:08:32,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670150828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:32,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:32,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:08:32,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158079739] [2025-02-05 20:08:32,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:32,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:08:32,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:32,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:08:32,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:08:32,796 INFO L87 Difference]: Start difference. First operand 229 states and 339 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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-02-05 20:08:32,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:32,924 INFO L93 Difference]: Finished difference Result 434 states and 643 transitions. [2025-02-05 20:08:32,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:08:32,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2025-02-05 20:08:32,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:32,926 INFO L225 Difference]: With dead ends: 434 [2025-02-05 20:08:32,926 INFO L226 Difference]: Without dead ends: 231 [2025-02-05 20:08:32,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:08:32,927 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 0 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:32,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 832 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:08:32,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-05 20:08:32,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2025-02-05 20:08:32,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.482608695652174) internal successors, (341), 230 states have internal predecessors, (341), 0 states have call successors, (0), 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-02-05 20:08:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 341 transitions. [2025-02-05 20:08:32,935 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 341 transitions. Word has length 32 [2025-02-05 20:08:32,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:32,936 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 341 transitions. [2025-02-05 20:08:32,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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-02-05 20:08:32,936 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 341 transitions. [2025-02-05 20:08:32,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-05 20:08:32,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:32,936 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] [2025-02-05 20:08:32,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:08:32,937 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:32,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:32,937 INFO L85 PathProgramCache]: Analyzing trace with hash -176522632, now seen corresponding path program 1 times [2025-02-05 20:08:32,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:32,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180473807] [2025-02-05 20:08:32,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:32,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:32,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-05 20:08:32,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-05 20:08:32,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:32,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:08:33,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:33,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180473807] [2025-02-05 20:08:33,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180473807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:33,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:33,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:08:33,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157007922] [2025-02-05 20:08:33,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:33,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:08:33,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:33,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:08:33,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:08:33,184 INFO L87 Difference]: Start difference. First operand 231 states and 341 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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-02-05 20:08:33,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:33,391 INFO L93 Difference]: Finished difference Result 440 states and 650 transitions. [2025-02-05 20:08:33,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:08:33,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-02-05 20:08:33,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:33,397 INFO L225 Difference]: With dead ends: 440 [2025-02-05 20:08:33,397 INFO L226 Difference]: Without dead ends: 235 [2025-02-05 20:08:33,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:08:33,398 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 320 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:33,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1075 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:08:33,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-02-05 20:08:33,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2025-02-05 20:08:33,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.4763948497854078) internal successors, (344), 233 states have internal predecessors, (344), 0 states have call successors, (0), 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-02-05 20:08:33,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 344 transitions. [2025-02-05 20:08:33,405 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 344 transitions. Word has length 33 [2025-02-05 20:08:33,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:33,405 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 344 transitions. [2025-02-05 20:08:33,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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-02-05 20:08:33,406 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 344 transitions. [2025-02-05 20:08:33,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 20:08:33,406 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:33,406 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] [2025-02-05 20:08:33,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:08:33,406 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:33,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:33,407 INFO L85 PathProgramCache]: Analyzing trace with hash 711128503, now seen corresponding path program 1 times [2025-02-05 20:08:33,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:33,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864580270] [2025-02-05 20:08:33,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:33,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:33,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 20:08:33,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 20:08:33,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:33,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:33,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:08:33,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:08:33,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864580270] [2025-02-05 20:08:33,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864580270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:33,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:33,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:08:33,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226511728] [2025-02-05 20:08:33,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:33,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:08:33,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:08:33,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:08:33,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:08:33,627 INFO L87 Difference]: Start difference. First operand 234 states and 344 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 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-02-05 20:08:33,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:33,844 INFO L93 Difference]: Finished difference Result 446 states and 656 transitions. [2025-02-05 20:08:33,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:08:33,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-02-05 20:08:33,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:33,845 INFO L225 Difference]: With dead ends: 446 [2025-02-05 20:08:33,845 INFO L226 Difference]: Without dead ends: 238 [2025-02-05 20:08:33,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:08:33,847 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 318 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:33,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1346 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:08:33,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-02-05 20:08:33,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2025-02-05 20:08:33,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.4763948497854078) internal successors, (344), 233 states have internal predecessors, (344), 0 states have call successors, (0), 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-02-05 20:08:33,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 344 transitions. [2025-02-05 20:08:33,853 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 344 transitions. Word has length 34 [2025-02-05 20:08:33,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:33,853 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 344 transitions. [2025-02-05 20:08:33,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 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-02-05 20:08:33,853 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 344 transitions. [2025-02-05 20:08:33,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 20:08:33,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:33,854 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] [2025-02-05 20:08:33,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:08:33,854 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:33,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:33,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1940432852, now seen corresponding path program 1 times [2025-02-05 20:08:33,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:08:33,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771722259] [2025-02-05 20:08:33,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:33,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:08:33,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 20:08:33,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 20:08:33,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:33,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:08:33,895 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:08:33,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 20:08:33,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 20:08:33,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:33,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:08:33,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:08:33,955 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:08:33,955 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:08:33,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 20:08:33,959 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-05 20:08:34,005 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-05 20:08:34,016 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:08:34,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:08:34 BoogieIcfgContainer [2025-02-05 20:08:34,018 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:08:34,018 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:08:34,018 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:08:34,019 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:08:34,019 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:08:31" (3/4) ... [2025-02-05 20:08:34,020 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:08:34,021 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:08:34,021 INFO L158 Benchmark]: Toolchain (without parser) took 4587.35ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 130.9MB in the beginning and 200.4MB in the end (delta: -69.6MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2025-02-05 20:08:34,022 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 226.5MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:08:34,022 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.59ms. Allocated memory is still 167.8MB. Free memory was 130.9MB in the beginning and 87.5MB in the end (delta: 43.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-05 20:08:34,022 INFO L158 Benchmark]: Boogie Procedure Inliner took 171.97ms. Allocated memory is still 167.8MB. Free memory was 87.5MB in the beginning and 58.4MB in the end (delta: 29.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 20:08:34,022 INFO L158 Benchmark]: Boogie Preprocessor took 238.94ms. Allocated memory is still 167.8MB. Free memory was 58.4MB in the beginning and 109.1MB in the end (delta: -50.7MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2025-02-05 20:08:34,022 INFO L158 Benchmark]: IcfgBuilder took 1538.74ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 43.4MB in the end (delta: 65.6MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. [2025-02-05 20:08:34,023 INFO L158 Benchmark]: TraceAbstraction took 2127.97ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 42.4MB in the beginning and 200.5MB in the end (delta: -158.1MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. [2025-02-05 20:08:34,023 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 260.0MB. Free memory was 200.5MB in the beginning and 200.4MB in the end (delta: 21.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:08:34,024 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 226.5MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.59ms. Allocated memory is still 167.8MB. Free memory was 130.9MB in the beginning and 87.5MB in the end (delta: 43.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 171.97ms. Allocated memory is still 167.8MB. Free memory was 87.5MB in the beginning and 58.4MB in the end (delta: 29.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 238.94ms. Allocated memory is still 167.8MB. Free memory was 58.4MB in the beginning and 109.1MB in the end (delta: -50.7MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. * IcfgBuilder took 1538.74ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 43.4MB in the end (delta: 65.6MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2127.97ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 42.4MB in the beginning and 200.5MB in the end (delta: -158.1MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 260.0MB. Free memory was 200.5MB in the beginning and 200.4MB in the end (delta: 21.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 300. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 4); [L30] const SORT_10 msb_SORT_10 = (SORT_10)1 << (4 - 1); [L32] const SORT_16 mask_SORT_16 = (SORT_16)-1 >> (sizeof(SORT_16) * 8 - 32); [L33] const SORT_16 msb_SORT_16 = (SORT_16)1 << (32 - 1); [L35] const SORT_32 mask_SORT_32 = (SORT_32)-1 >> (sizeof(SORT_32) * 8 - 7); [L36] const SORT_32 msb_SORT_32 = (SORT_32)1 << (7 - 1); [L38] const SORT_40 mask_SORT_40 = (SORT_40)-1 >> (sizeof(SORT_40) * 8 - 9); [L39] const SORT_40 msb_SORT_40 = (SORT_40)1 << (9 - 1); [L41] const SORT_60 mask_SORT_60 = (SORT_60)-1 >> (sizeof(SORT_60) * 8 - 20); [L42] const SORT_60 msb_SORT_60 = (SORT_60)1 << (20 - 1); [L44] const SORT_357 mask_SORT_357 = (SORT_357)-1 >> (sizeof(SORT_357) * 8 - 2); [L45] const SORT_357 msb_SORT_357 = (SORT_357)1 << (2 - 1); [L47] const SORT_359 mask_SORT_359 = (SORT_359)-1 >> (sizeof(SORT_359) * 8 - 3); [L48] const SORT_359 msb_SORT_359 = (SORT_359)1 << (3 - 1); [L50] const SORT_1 var_13 = 0; [L51] const SORT_16 var_18 = 1; [L52] const SORT_16 var_23 = 0; [L53] const SORT_1 var_28 = 1; [L54] const SORT_32 var_33 = 0; [L55] const SORT_40 var_41 = 0; [L56] const SORT_10 var_48 = 0; [L57] const SORT_16 var_67 = 31; [L58] const SORT_16 var_71 = 32; [L59] const SORT_10 var_74 = 3; [L60] const SORT_16 var_90 = 2; [L61] const SORT_10 var_96 = 5; [L62] const SORT_10 var_117 = 7; [L63] const SORT_10 var_136 = 9; [L64] const SORT_32 var_233 = 4; [L65] const SORT_10 var_235 = 2; [L66] const SORT_32 var_254 = 1; [L67] const SORT_16 var_256 = 191; [L68] const SORT_10 var_259 = 6; [L69] const SORT_10 var_282 = 4; [L70] const SORT_10 var_307 = 8; [L71] const SORT_40 var_315 = 1; [L72] const SORT_10 var_321 = 10; [L73] const SORT_10 var_329 = 1; [L75] SORT_1 input_2; [L76] SORT_1 input_3; [L77] SORT_1 input_4; [L78] SORT_1 input_5; [L79] SORT_1 input_6; [L80] SORT_1 input_7; [L81] SORT_1 input_8; [L82] SORT_1 input_9; [L83] SORT_10 input_11; [L84] SORT_10 input_12; [L85] SORT_1 input_38; [L86] SORT_1 input_44; [L87] SORT_1 input_46; [L88] SORT_1 input_52; [L89] SORT_1 input_54; [L90] SORT_1 input_56; [L91] SORT_1 input_58; [L92] SORT_60 input_61; [L93] SORT_1 input_63; [L94] SORT_1 input_64; [L95] SORT_1 input_65; [L96] SORT_1 input_77; [L97] SORT_1 input_82; [L98] SORT_1 input_86; [L99] SORT_1 input_87; [L100] SORT_1 input_88; [L101] SORT_1 input_99; [L102] SORT_1 input_104; [L103] SORT_1 input_108; [L104] SORT_1 input_109; [L105] SORT_1 input_110; [L106] SORT_1 input_120; [L107] SORT_1 input_125; [L108] SORT_1 input_127; [L109] SORT_1 input_128; [L110] SORT_1 input_129; [L111] SORT_1 input_139; [L112] SORT_1 input_144; [L113] SORT_1 input_151; [L114] SORT_1 input_155; [L115] SORT_1 input_156; [L116] SORT_1 input_157; [L117] SORT_1 input_164; [L118] SORT_1 input_169; [L119] SORT_1 input_173; [L120] SORT_1 input_174; [L121] SORT_1 input_175; [L122] SORT_1 input_182; [L123] SORT_1 input_187; [L124] SORT_1 input_191; [L125] SORT_1 input_192; [L126] SORT_1 input_193; [L127] SORT_1 input_200; [L128] SORT_1 input_205; [L129] SORT_1 input_207; [L130] SORT_1 input_208; [L131] SORT_1 input_209; [L132] SORT_1 input_216; [L133] SORT_1 input_221; [L134] SORT_1 input_228; [L135] SORT_32 input_232; [L136] SORT_32 input_238; [L137] SORT_32 input_242; [L138] SORT_32 input_249; [L139] SORT_32 input_253; [L140] SORT_32 input_262; [L141] SORT_32 input_264; [L142] SORT_32 input_271; [L143] SORT_32 input_278; [L144] SORT_32 input_285; [L145] SORT_32 input_292; [L146] SORT_32 input_296; [L147] SORT_32 input_303; [L148] SORT_32 input_311; [L149] SORT_40 input_324; [L150] SORT_10 input_328; [L151] SORT_10 input_334; [L152] SORT_10 input_340; [L153] SORT_10 input_344; [L154] SORT_10 input_346; [L155] SORT_10 input_350; [L156] SORT_10 input_363; [L157] SORT_10 input_367; [L158] SORT_10 input_369; [L159] SORT_10 input_373; [L160] SORT_10 input_377; [L161] SORT_10 input_381; [L162] SORT_10 input_385; [L163] SORT_10 input_389; [L164] SORT_10 input_406; [L166] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_32=127, mask_SORT_357=3, mask_SORT_359=7, mask_SORT_40=511, var_117=7, var_136=9, var_13=0, var_18=1, var_233=4, var_235=2, var_23=0, var_254=1, var_256=191, var_259=6, var_282=4, var_28=1, var_307=8, var_315=1, var_321=10, var_329=1, var_33=0, var_41=0, var_48=0, var_67=31, var_71=32, var_74=3, var_90=2, var_96=5] [L166] SORT_1 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L167] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_32=127, mask_SORT_357=3, mask_SORT_359=7, mask_SORT_40=511, var_117=7, var_136=9, var_13=0, var_18=1, var_233=4, var_235=2, var_23=0, var_254=1, var_256=191, var_259=6, var_282=4, var_28=1, var_307=8, var_315=1, var_321=10, var_329=1, var_33=0, var_41=0, var_48=0, var_67=31, var_71=32, var_74=3, var_90=2, var_96=5] [L167] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L168] EXPR __VERIFIER_nondet_uchar() & mask_SORT_32 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_32=127, mask_SORT_357=3, mask_SORT_359=7, mask_SORT_40=511, var_117=7, var_136=9, var_13=0, var_18=1, var_233=4, var_235=2, var_23=0, var_254=1, var_256=191, var_259=6, var_282=4, var_28=1, var_307=8, var_315=1, var_321=10, var_329=1, var_33=0, var_41=0, var_48=0, var_67=31, var_71=32, var_74=3, var_90=2, var_96=5] [L168] SORT_32 state_34 = __VERIFIER_nondet_uchar() & mask_SORT_32; [L169] EXPR __VERIFIER_nondet_uchar() & mask_SORT_32 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_32=127, mask_SORT_357=3, mask_SORT_359=7, mask_SORT_40=511, var_117=7, var_136=9, var_13=0, var_18=1, var_233=4, var_235=2, var_23=0, var_254=1, var_256=191, var_259=6, var_282=4, var_28=1, var_307=8, var_315=1, var_321=10, var_329=1, var_33=0, var_41=0, var_48=0, var_67=31, var_71=32, var_74=3, var_90=2, var_96=5] [L169] SORT_32 state_36 = __VERIFIER_nondet_uchar() & mask_SORT_32; [L170] EXPR __VERIFIER_nondet_ushort() & mask_SORT_40 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_32=127, mask_SORT_357=3, mask_SORT_359=7, mask_SORT_40=511, var_117=7, var_136=9, var_13=0, var_18=1, var_233=4, var_235=2, var_23=0, var_254=1, var_256=191, var_259=6, var_282=4, var_28=1, var_307=8, var_315=1, var_321=10, var_329=1, var_33=0, var_41=0, var_48=0, var_67=31, var_71=32, var_74=3, var_90=2, var_96=5] [L170] SORT_40 state_42 = __VERIFIER_nondet_ushort() & mask_SORT_40; [L171] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_32=127, mask_SORT_357=3, mask_SORT_359=7, mask_SORT_40=511, var_117=7, var_136=9, var_13=0, var_18=1, var_233=4, var_235=2, var_23=0, var_254=1, var_256=191, var_259=6, var_282=4, var_28=1, var_307=8, var_315=1, var_321=10, var_329=1, var_33=0, var_41=0, var_48=0, var_67=31, var_71=32, var_74=3, var_90=2, var_96=5] [L171] SORT_10 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L173] SORT_1 init_15_arg_1 = var_13; [L174] state_14 = init_15_arg_1 [L175] SORT_1 init_21_arg_1 = var_13; [L176] state_20 = init_21_arg_1 [L177] SORT_32 init_35_arg_1 = var_33; [L178] state_34 = init_35_arg_1 [L179] SORT_32 init_37_arg_1 = var_33; [L180] state_36 = init_37_arg_1 [L181] SORT_40 init_43_arg_1 = var_41; [L182] state_42 = init_43_arg_1 [L183] SORT_10 init_50_arg_1 = var_48; [L184] state_49 = init_50_arg_1 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_32=127, mask_SORT_357=3, mask_SORT_359=7, mask_SORT_40=511, state_14=0, state_20=0, state_34=0, state_36=0, state_42=0, state_49=0, var_117=7, var_136=9, var_13=0, var_18=1, var_233=4, var_235=2, var_23=0, var_254=1, var_256=191, var_259=6, var_282=4, var_28=1, var_307=8, var_315=1, var_321=10, var_329=1, var_33=0, var_41=0, var_48=0, var_67=31, var_71=32, var_74=3, var_90=2, var_96=5] [L187] input_2 = __VERIFIER_nondet_uchar() [L188] input_3 = __VERIFIER_nondet_uchar() [L189] input_4 = __VERIFIER_nondet_uchar() [L190] input_5 = __VERIFIER_nondet_uchar() [L191] input_6 = __VERIFIER_nondet_uchar() [L192] EXPR input_6 & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_32=127, mask_SORT_357=3, mask_SORT_359=7, mask_SORT_40=511, state_14=0, state_20=0, state_34=0, state_36=0, state_42=0, state_49=0, var_117=7, var_136=9, var_13=0, var_18=1, var_233=4, var_235=2, var_23=0, var_254=1, var_256=191, var_259=6, var_282=4, var_28=1, var_307=8, var_315=1, var_321=10, var_329=1, var_33=0, var_41=0, var_48=0, var_67=31, var_71=32, var_74=3, var_90=2, var_96=5] [L192] input_6 = input_6 & mask_SORT_1 [L193] input_7 = __VERIFIER_nondet_uchar() [L194] input_8 = __VERIFIER_nondet_uchar() [L195] input_9 = __VERIFIER_nondet_uchar() [L196] EXPR input_9 & mask_SORT_1 VAL [input_6=0, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_32=127, mask_SORT_357=3, mask_SORT_359=7, mask_SORT_40=511, state_14=0, state_20=0, state_34=0, state_36=0, state_42=0, state_49=0, var_117=7, var_136=9, var_13=0, var_18=1, var_233=4, var_235=2, var_23=0, var_254=1, var_256=191, var_259=6, var_282=4, var_28=1, var_307=8, var_315=1, var_321=10, var_329=1, var_33=0, var_41=0, var_48=0, var_67=31, var_71=32, var_74=3, var_90=2, var_96=5] [L196] input_9 = input_9 & mask_SORT_1 [L197] input_11 = __VERIFIER_nondet_uchar() [L198] input_12 = __VERIFIER_nondet_uchar() [L199] input_38 = __VERIFIER_nondet_uchar() [L200] input_44 = __VERIFIER_nondet_uchar() [L201] input_46 = __VERIFIER_nondet_uchar() [L202] input_52 = __VERIFIER_nondet_uchar() [L203] input_54 = __VERIFIER_nondet_uchar() [L204] input_56 = __VERIFIER_nondet_uchar() [L205] input_58 = __VERIFIER_nondet_uchar() [L206] input_61 = __VERIFIER_nondet_uint() [L207] input_63 = __VERIFIER_nondet_uchar() [L208] input_64 = __VERIFIER_nondet_uchar() [L209] input_65 = __VERIFIER_nondet_uchar() [L210] input_77 = __VERIFIER_nondet_uchar() [L211] input_82 = __VERIFIER_nondet_uchar() [L212] input_86 = __VERIFIER_nondet_uchar() [L213] input_87 = __VERIFIER_nondet_uchar() [L214] input_88 = __VERIFIER_nondet_uchar() [L215] input_99 = __VERIFIER_nondet_uchar() [L216] input_104 = __VERIFIER_nondet_uchar() [L217] input_108 = __VERIFIER_nondet_uchar() [L218] input_109 = __VERIFIER_nondet_uchar() [L219] input_110 = __VERIFIER_nondet_uchar() [L220] input_120 = __VERIFIER_nondet_uchar() [L221] input_125 = __VERIFIER_nondet_uchar() [L222] input_127 = __VERIFIER_nondet_uchar() [L223] input_128 = __VERIFIER_nondet_uchar() [L224] input_129 = __VERIFIER_nondet_uchar() [L225] input_139 = __VERIFIER_nondet_uchar() [L226] input_144 = __VERIFIER_nondet_uchar() [L227] input_151 = __VERIFIER_nondet_uchar() [L228] input_155 = __VERIFIER_nondet_uchar() [L229] input_156 = __VERIFIER_nondet_uchar() [L230] input_157 = __VERIFIER_nondet_uchar() [L231] input_164 = __VERIFIER_nondet_uchar() [L232] input_169 = __VERIFIER_nondet_uchar() [L233] input_173 = __VERIFIER_nondet_uchar() [L234] input_174 = __VERIFIER_nondet_uchar() [L235] input_175 = __VERIFIER_nondet_uchar() [L236] input_182 = __VERIFIER_nondet_uchar() [L237] input_187 = __VERIFIER_nondet_uchar() [L238] input_191 = __VERIFIER_nondet_uchar() [L239] input_192 = __VERIFIER_nondet_uchar() [L240] input_193 = __VERIFIER_nondet_uchar() [L241] input_200 = __VERIFIER_nondet_uchar() [L242] input_205 = __VERIFIER_nondet_uchar() [L243] input_207 = __VERIFIER_nondet_uchar() [L244] input_208 = __VERIFIER_nondet_uchar() [L245] input_209 = __VERIFIER_nondet_uchar() [L246] input_216 = __VERIFIER_nondet_uchar() [L247] input_221 = __VERIFIER_nondet_uchar() [L248] input_228 = __VERIFIER_nondet_uchar() [L249] input_232 = __VERIFIER_nondet_uchar() [L250] input_238 = __VERIFIER_nondet_uchar() [L251] input_242 = __VERIFIER_nondet_uchar() [L252] input_249 = __VERIFIER_nondet_uchar() [L253] input_253 = __VERIFIER_nondet_uchar() [L254] input_262 = __VERIFIER_nondet_uchar() [L255] input_264 = __VERIFIER_nondet_uchar() [L256] input_271 = __VERIFIER_nondet_uchar() [L257] input_278 = __VERIFIER_nondet_uchar() [L258] input_285 = __VERIFIER_nondet_uchar() [L259] input_292 = __VERIFIER_nondet_uchar() [L260] input_296 = __VERIFIER_nondet_uchar() [L261] input_303 = __VERIFIER_nondet_uchar() [L262] input_311 = __VERIFIER_nondet_uchar() [L263] input_324 = __VERIFIER_nondet_ushort() [L264] input_328 = __VERIFIER_nondet_uchar() [L265] input_334 = __VERIFIER_nondet_uchar() [L266] input_340 = __VERIFIER_nondet_uchar() [L267] input_344 = __VERIFIER_nondet_uchar() [L268] input_346 = __VERIFIER_nondet_uchar() [L269] input_350 = __VERIFIER_nondet_uchar() [L270] input_363 = __VERIFIER_nondet_uchar() [L271] input_367 = __VERIFIER_nondet_uchar() [L272] input_369 = __VERIFIER_nondet_uchar() [L273] input_373 = __VERIFIER_nondet_uchar() [L274] input_377 = __VERIFIER_nondet_uchar() [L275] input_381 = __VERIFIER_nondet_uchar() [L276] input_385 = __VERIFIER_nondet_uchar() [L277] input_389 = __VERIFIER_nondet_uchar() [L278] input_406 = __VERIFIER_nondet_uchar() [L281] SORT_1 var_17_arg_0 = state_14; VAL [input_6=0, input_9=0, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_32=127, mask_SORT_357=3, mask_SORT_359=7, mask_SORT_40=511, state_14=0, state_20=0, state_34=0, state_36=0, state_42=0, state_49=0, var_117=7, var_136=9, var_13=0, var_17_arg_0=0, var_18=1, var_233=4, var_235=2, var_23=0, var_254=1, var_256=191, var_259=6, var_282=4, var_28=1, var_307=8, var_315=1, var_321=10, var_329=1, var_33=0, var_41=0, var_48=0, var_67=31, var_71=32, var_74=3, var_90=2, var_96=5] [L282] EXPR var_17_arg_0 & mask_SORT_1 VAL [input_6=0, input_9=0, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_32=127, mask_SORT_357=3, mask_SORT_359=7, mask_SORT_40=511, state_14=0, state_20=0, state_34=0, state_36=0, state_42=0, state_49=0, var_117=7, var_136=9, var_13=0, var_18=1, var_233=4, var_235=2, var_23=0, var_254=1, var_256=191, var_259=6, var_282=4, var_28=1, var_307=8, var_315=1, var_321=10, var_329=1, var_33=0, var_41=0, var_48=0, var_67=31, var_71=32, var_74=3, var_90=2, var_96=5] [L282] var_17_arg_0 = var_17_arg_0 & mask_SORT_1 [L283] SORT_16 var_17 = var_17_arg_0; [L284] SORT_16 var_19_arg_0 = var_17; [L285] SORT_16 var_19_arg_1 = var_18; [L286] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L287] SORT_1 var_22_arg_0 = state_20; VAL [input_6=0, input_9=0, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_32=127, mask_SORT_357=3, mask_SORT_359=7, mask_SORT_40=511, state_14=0, state_20=0, state_34=0, state_36=0, state_42=0, state_49=0, var_117=7, var_136=9, var_13=0, var_18=1, var_19=0, var_22_arg_0=0, var_233=4, var_235=2, var_23=0, var_254=1, var_256=191, var_259=6, var_282=4, var_28=1, var_307=8, var_315=1, var_321=10, var_329=1, var_33=0, var_41=0, var_48=0, var_67=31, var_71=32, var_74=3, var_90=2, var_96=5] [L288] EXPR var_22_arg_0 & mask_SORT_1 VAL [input_6=0, input_9=0, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_32=127, mask_SORT_357=3, mask_SORT_359=7, mask_SORT_40=511, state_14=0, state_20=0, state_34=0, state_36=0, state_42=0, state_49=0, var_117=7, var_136=9, var_13=0, var_18=1, var_19=0, var_233=4, var_235=2, var_23=0, var_254=1, var_256=191, var_259=6, var_282=4, var_28=1, var_307=8, var_315=1, var_321=10, var_329=1, var_33=0, var_41=0, var_48=0, var_67=31, var_71=32, var_74=3, var_90=2, var_96=5] [L288] var_22_arg_0 = var_22_arg_0 & mask_SORT_1 [L289] SORT_16 var_22 = var_22_arg_0; [L290] SORT_16 var_24_arg_0 = var_22; [L291] SORT_16 var_24_arg_1 = var_23; [L292] SORT_1 var_24 = var_24_arg_0 == var_24_arg_1; [L293] SORT_1 var_25_arg_0 = var_19; [L294] SORT_1 var_25_arg_1 = var_24; VAL [input_6=0, input_9=0, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_32=127, mask_SORT_357=3, mask_SORT_359=7, mask_SORT_40=511, state_14=0, state_20=0, state_34=0, state_36=0, state_42=0, state_49=0, var_117=7, var_136=9, var_13=0, var_18=1, var_233=4, var_235=2, var_23=0, var_254=1, var_256=191, var_259=6, var_25_arg_0=0, var_25_arg_1=1, var_282=4, var_28=1, var_307=8, var_315=1, var_321=10, var_329=1, var_33=0, var_41=0, var_48=0, var_67=31, var_71=32, var_74=3, var_90=2, var_96=5] [L295] EXPR var_25_arg_0 | var_25_arg_1 VAL [input_6=0, input_9=0, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_32=127, mask_SORT_357=3, mask_SORT_359=7, mask_SORT_40=511, state_14=0, state_20=0, state_34=0, state_36=0, state_42=0, state_49=0, var_117=7, var_136=9, var_13=0, var_18=1, var_233=4, var_235=2, var_23=0, var_254=1, var_256=191, var_259=6, var_282=4, var_28=1, var_307=8, var_315=1, var_321=10, var_329=1, var_33=0, var_41=0, var_48=0, var_67=31, var_71=32, var_74=3, var_90=2, var_96=5] [L295] SORT_1 var_25 = var_25_arg_0 | var_25_arg_1; [L296] SORT_1 var_29_arg_0 = var_25; [L297] SORT_1 var_29 = ~var_29_arg_0; [L298] SORT_1 var_30_arg_0 = var_28; [L299] SORT_1 var_30_arg_1 = var_29; VAL [input_6=0, input_9=0, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_32=127, mask_SORT_357=3, mask_SORT_359=7, mask_SORT_40=511, state_14=0, state_20=0, state_34=0, state_36=0, state_42=0, state_49=0, var_117=7, var_136=9, var_13=0, var_18=1, var_233=4, var_235=2, var_23=0, var_254=1, var_256=191, var_259=6, var_282=4, var_28=1, var_307=8, var_30_arg_0=1, var_30_arg_1=-2, var_315=1, var_321=10, var_329=1, var_33=0, var_41=0, var_48=0, var_67=31, var_71=32, var_74=3, var_90=2, var_96=5] [L300] EXPR var_30_arg_0 & var_30_arg_1 VAL [input_6=0, input_9=0, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_32=127, mask_SORT_357=3, mask_SORT_359=7, mask_SORT_40=511, state_14=0, state_20=0, state_34=0, state_36=0, state_42=0, state_49=0, var_117=7, var_136=9, var_13=0, var_18=1, var_233=4, var_235=2, var_23=0, var_254=1, var_256=191, var_259=6, var_282=4, var_28=1, var_307=8, var_315=1, var_321=10, var_329=1, var_33=0, var_41=0, var_48=0, var_67=31, var_71=32, var_74=3, var_90=2, var_96=5] [L300] SORT_1 var_30 = var_30_arg_0 & var_30_arg_1; [L301] EXPR var_30 & mask_SORT_1 VAL [input_6=0, input_9=0, mask_SORT_10=15, mask_SORT_1=1, mask_SORT_32=127, mask_SORT_357=3, mask_SORT_359=7, mask_SORT_40=511, state_14=0, state_20=0, state_34=0, state_36=0, state_42=0, state_49=0, var_117=7, var_136=9, var_13=0, var_18=1, var_233=4, var_235=2, var_23=0, var_254=1, var_256=191, var_259=6, var_282=4, var_28=1, var_307=8, var_315=1, var_321=10, var_329=1, var_33=0, var_41=0, var_48=0, var_67=31, var_71=32, var_74=3, var_90=2, var_96=5] [L301] var_30 = var_30 & mask_SORT_1 [L302] SORT_1 bad_31_arg_0 = var_30; [L303] CALL __VERIFIER_assert(!(bad_31_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 230 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 638 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 638 mSDsluCounter, 4088 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2984 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 965 IncrementalHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 1104 mSDtfsCounter, 965 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=3, InterpolantAutomatonStates: 21, 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, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 316 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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-02-05 20:08:34,040 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.v_DAIO.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 a68330c23bd8fa71b4f2c1a72229a125c9c545dc64c1e4d5015a2916cb213688 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:08:36,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:08:36,134 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-05 20:08:36,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:08:36,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:08:36,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:08:36,154 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:08:36,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:08:36,154 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:08:36,154 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:08:36,154 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:08:36,154 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:08:36,154 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:08:36,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:08:36,155 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:08:36,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:08:36,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:08:36,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:08:36,155 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:08:36,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:08:36,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:08:36,155 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:08:36,155 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:08:36,155 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:08:36,155 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:08:36,155 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:08:36,155 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:08:36,155 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:08:36,155 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:08:36,155 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:08:36,155 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:08:36,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:08:36,156 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:08:36,156 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:08:36,156 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:08:36,156 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:08:36,156 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:08:36,156 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:08:36,156 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:08:36,156 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:08:36,156 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:08:36,156 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:08:36,156 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 -> a68330c23bd8fa71b4f2c1a72229a125c9c545dc64c1e4d5015a2916cb213688 [2025-02-05 20:08:36,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:08:36,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:08:36,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:08:36,470 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:08:36,471 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:08:36,472 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.v_DAIO.c [2025-02-05 20:08:37,695 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6820304ab/e6ffee88739e45c5b64b63c245e4e2f6/FLAG4d2e27ae8 [2025-02-05 20:08:37,980 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:08:37,981 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_DAIO.c [2025-02-05 20:08:38,002 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6820304ab/e6ffee88739e45c5b64b63c245e4e2f6/FLAG4d2e27ae8 [2025-02-05 20:08:38,026 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6820304ab/e6ffee88739e45c5b64b63c245e4e2f6 [2025-02-05 20:08:38,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:08:38,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:08:38,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:08:38,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:08:38,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:08:38,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:08:38" (1/1) ... [2025-02-05 20:08:38,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4204175e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:38, skipping insertion in model container [2025-02-05 20:08:38,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:08:38" (1/1) ... [2025-02-05 20:08:38,087 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:08:38,228 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.v_DAIO.c[1246,1259] [2025-02-05 20:08:38,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:08:38,426 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:08:38,433 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.v_DAIO.c[1246,1259] [2025-02-05 20:08:38,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:08:38,549 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:08:38,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:38 WrapperNode [2025-02-05 20:08:38,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:08:38,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:08:38,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:08:38,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:08:38,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:38" (1/1) ... [2025-02-05 20:08:38,581 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:38" (1/1) ... [2025-02-05 20:08:38,626 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1375 [2025-02-05 20:08:38,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:08:38,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:08:38,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:08:38,627 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:08:38,637 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:38" (1/1) ... [2025-02-05 20:08:38,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:38" (1/1) ... [2025-02-05 20:08:38,649 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:38" (1/1) ... [2025-02-05 20:08:38,685 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-02-05 20:08:38,686 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:38" (1/1) ... [2025-02-05 20:08:38,686 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:38" (1/1) ... [2025-02-05 20:08:38,705 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:38" (1/1) ... [2025-02-05 20:08:38,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:38" (1/1) ... [2025-02-05 20:08:38,711 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:38" (1/1) ... [2025-02-05 20:08:38,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:38" (1/1) ... [2025-02-05 20:08:38,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:08:38,734 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:08:38,734 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:08:38,734 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:08:38,735 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:38" (1/1) ... [2025-02-05 20:08:38,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:08:38,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:08:38,762 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-02-05 20:08:38,766 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-02-05 20:08:38,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:08:38,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:08:38,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:08:38,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:08:39,006 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:08:39,008 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:08:39,642 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2025-02-05 20:08:39,642 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:08:39,648 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:08:39,649 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:08:39,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:08:39 BoogieIcfgContainer [2025-02-05 20:08:39,649 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:08:39,651 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:08:39,651 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:08:39,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:08:39,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:08:38" (1/3) ... [2025-02-05 20:08:39,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aeb5a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:08:39, skipping insertion in model container [2025-02-05 20:08:39,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:08:38" (2/3) ... [2025-02-05 20:08:39,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aeb5a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:08:39, skipping insertion in model container [2025-02-05 20:08:39,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:08:39" (3/3) ... [2025-02-05 20:08:39,658 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.v_DAIO.c [2025-02-05 20:08:39,671 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:08:39,672 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.v_DAIO.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:08:39,708 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:08:39,717 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;@8739b35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:08:39,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:08:39,720 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-02-05 20:08:39,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-05 20:08:39,724 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:39,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-05 20:08:39,725 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:39,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:39,729 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-02-05 20:08:39,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:08:39,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [138538021] [2025-02-05 20:08:39,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:39,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:08:39,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:08:39,743 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-02-05 20:08:39,747 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-02-05 20:08:40,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-05 20:08:40,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-05 20:08:40,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:40,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:40,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 20:08:40,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:08:40,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:08:40,155 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:08:40,156 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:08:40,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138538021] [2025-02-05 20:08:40,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138538021] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:08:40,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:08:40,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:08:40,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948450049] [2025-02-05 20:08:40,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:08:40,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:08:40,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:08:40,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:08:40,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:08:40,173 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-02-05 20:08:40,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:08:40,220 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-02-05 20:08:40,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:08:40,222 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-02-05 20:08:40,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:08:40,226 INFO L225 Difference]: With dead ends: 18 [2025-02-05 20:08:40,226 INFO L226 Difference]: Without dead ends: 10 [2025-02-05 20:08:40,228 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-02-05 20:08:40,229 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:08:40,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:08:40,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-02-05 20:08:40,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-02-05 20:08:40,244 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-02-05 20:08:40,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-02-05 20:08:40,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-02-05 20:08:40,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:08:40,248 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-02-05 20:08:40,248 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-02-05 20:08:40,248 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-02-05 20:08:40,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 20:08:40,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:08:40,248 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-05 20:08:40,259 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-02-05 20:08:40,449 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-02-05 20:08:40,450 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:08:40,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:08:40,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-02-05 20:08:40,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:08:40,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [979465376] [2025-02-05 20:08:40,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:08:40,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:08:40,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:08:40,454 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-02-05 20:08:40,455 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-02-05 20:08:40,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 20:08:40,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 20:08:40,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:08:40,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:08:40,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 20:08:40,766 INFO L279 TraceCheckSpWp]: Computing forward predicates...