./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.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 caa84a091b99b66a1da3990b205ee8e8e4cfa2478d32b035bf8784a52ef5640a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:02:39,614 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:02:39,667 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 23:02:39,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:02:39,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:02:39,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:02:39,690 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:02:39,691 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:02:39,691 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:02:39,691 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:02:39,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:02:39,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:02:39,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:02:39,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:02:39,691 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:02:39,691 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:02:39,692 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:02:39,692 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 23:02:39,693 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:02:39,693 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:02:39,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:02:39,693 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:02:39,693 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:02:39,693 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:02:39,693 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:02:39,693 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:02:39,693 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:02:39,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:02:39,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:02:39,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:02:39,694 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:02:39,694 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:02:39,694 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:02:39,694 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:02:39,694 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 23:02:39,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 23:02:39,695 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:02:39,695 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:02:39,695 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:02:39,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:02:39,695 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 -> caa84a091b99b66a1da3990b205ee8e8e4cfa2478d32b035bf8784a52ef5640a [2025-02-07 23:02:39,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:02:39,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:02:39,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:02:39,904 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:02:39,904 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:02:39,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c [2025-02-07 23:02:40,972 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0476162d4/5b7a720e1e2545b9ae3b55391dfd5ba7/FLAG5e610c8c0 [2025-02-07 23:02:41,198 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:02:41,198 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c [2025-02-07 23:02:41,205 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0476162d4/5b7a720e1e2545b9ae3b55391dfd5ba7/FLAG5e610c8c0 [2025-02-07 23:02:41,538 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0476162d4/5b7a720e1e2545b9ae3b55391dfd5ba7 [2025-02-07 23:02:41,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:02:41,541 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:02:41,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:02:41,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:02:41,545 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:02:41,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:02:41" (1/1) ... [2025-02-07 23:02:41,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a989ae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:41, skipping insertion in model container [2025-02-07 23:02:41,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:02:41" (1/1) ... [2025-02-07 23:02:41,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:02:41,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c[1249,1262] [2025-02-07 23:02:41,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:02:41,704 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:02:41,713 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c[1249,1262] [2025-02-07 23:02:41,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:02:41,765 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:02:41,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:41 WrapperNode [2025-02-07 23:02:41,766 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:02:41,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:02:41,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:02:41,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:02:41,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:41" (1/1) ... [2025-02-07 23:02:41,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:41" (1/1) ... [2025-02-07 23:02:41,828 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 417 [2025-02-07 23:02:41,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:02:41,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:02:41,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:02:41,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:02:41,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:41" (1/1) ... [2025-02-07 23:02:41,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:41" (1/1) ... [2025-02-07 23:02:41,852 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:41" (1/1) ... [2025-02-07 23:02:41,885 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-07 23:02:41,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:41" (1/1) ... [2025-02-07 23:02:41,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:41" (1/1) ... [2025-02-07 23:02:41,895 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:41" (1/1) ... [2025-02-07 23:02:41,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:41" (1/1) ... [2025-02-07 23:02:41,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:41" (1/1) ... [2025-02-07 23:02:41,907 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:41" (1/1) ... [2025-02-07 23:02:41,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:02:41,917 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:02:41,918 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:02:41,918 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:02:41,919 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:41" (1/1) ... [2025-02-07 23:02:41,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:02:41,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:02:41,946 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-07 23:02:41,949 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-07 23:02:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:02:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 23:02:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:02:41,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:02:42,082 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:02:42,084 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:02:42,632 INFO L? ?]: Removed 167 outVars from TransFormulas that were not future-live. [2025-02-07 23:02:42,632 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:02:42,657 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:02:42,657 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:02:42,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:02:42 BoogieIcfgContainer [2025-02-07 23:02:42,658 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:02:42,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:02:42,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:02:42,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:02:42,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:02:41" (1/3) ... [2025-02-07 23:02:42,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c51693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:02:42, skipping insertion in model container [2025-02-07 23:02:42,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:41" (2/3) ... [2025-02-07 23:02:42,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c51693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:02:42, skipping insertion in model container [2025-02-07 23:02:42,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:02:42" (3/3) ... [2025-02-07 23:02:42,666 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v1.c [2025-02-07 23:02:42,680 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:02:42,682 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.eq_sdp_v1.c that has 1 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:02:42,750 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:02:42,759 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;@60467554, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:02:42,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:02:42,763 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 90 states have (on average 1.5) internal successors, (135), 91 states have internal predecessors, (135), 0 states have call successors, (0), 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-07 23:02:42,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-07 23:02:42,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:02:42,770 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:02:42,770 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:02:42,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:02:42,778 INFO L85 PathProgramCache]: Analyzing trace with hash -297899566, now seen corresponding path program 1 times [2025-02-07 23:02:42,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:02:42,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990646116] [2025-02-07 23:02:42,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:02:42,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:02:42,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-07 23:02:42,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-07 23:02:42,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:02:42,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:02:43,253 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-07 23:02:43,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:02:43,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990646116] [2025-02-07 23:02:43,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990646116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:02:43,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:02:43,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:02:43,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993544988] [2025-02-07 23:02:43,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:02:43,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:02:43,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:02:43,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:02:43,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:02:43,277 INFO L87 Difference]: Start difference. First operand has 92 states, 90 states have (on average 1.5) internal successors, (135), 91 states have internal predecessors, (135), 0 states have call successors, (0), 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 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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-07 23:02:43,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:02:43,364 INFO L93 Difference]: Finished difference Result 135 states and 199 transitions. [2025-02-07 23:02:43,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:02:43,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-02-07 23:02:43,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:02:43,372 INFO L225 Difference]: With dead ends: 135 [2025-02-07 23:02:43,373 INFO L226 Difference]: Without dead ends: 92 [2025-02-07 23:02:43,375 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-07 23:02:43,377 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:02:43,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 322 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:02:43,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-07 23:02:43,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-07 23:02:43,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4725274725274726) internal successors, (134), 91 states have internal predecessors, (134), 0 states have call successors, (0), 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-07 23:02:43,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2025-02-07 23:02:43,403 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 38 [2025-02-07 23:02:43,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:02:43,403 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2025-02-07 23:02:43,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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-07 23:02:43,404 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2025-02-07 23:02:43,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-07 23:02:43,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:02:43,405 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:02:43,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 23:02:43,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:02:43,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:02:43,406 INFO L85 PathProgramCache]: Analyzing trace with hash -640272783, now seen corresponding path program 1 times [2025-02-07 23:02:43,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:02:43,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296680162] [2025-02-07 23:02:43,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:02:43,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:02:43,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-07 23:02:43,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-07 23:02:43,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:02:43,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:02:43,582 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-07 23:02:43,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:02:43,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296680162] [2025-02-07 23:02:43,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296680162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:02:43,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:02:43,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:02:43,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433601047] [2025-02-07 23:02:43,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:02:43,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:02:43,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:02:43,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:02:43,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:02:43,587 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 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-07 23:02:43,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:02:43,672 INFO L93 Difference]: Finished difference Result 137 states and 198 transitions. [2025-02-07 23:02:43,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:02:43,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-02-07 23:02:43,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:02:43,675 INFO L225 Difference]: With dead ends: 137 [2025-02-07 23:02:43,675 INFO L226 Difference]: Without dead ends: 94 [2025-02-07 23:02:43,675 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-07 23:02:43,676 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:02:43,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 319 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:02:43,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-07 23:02:43,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-07 23:02:43,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 93 states have internal predecessors, (136), 0 states have call successors, (0), 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-07 23:02:43,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2025-02-07 23:02:43,686 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 39 [2025-02-07 23:02:43,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:02:43,686 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2025-02-07 23:02:43,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 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-07 23:02:43,688 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2025-02-07 23:02:43,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-07 23:02:43,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:02:43,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:02:43,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 23:02:43,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:02:43,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:02:43,689 INFO L85 PathProgramCache]: Analyzing trace with hash -737077843, now seen corresponding path program 1 times [2025-02-07 23:02:43,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:02:43,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061151510] [2025-02-07 23:02:43,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:02:43,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:02:43,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-07 23:02:43,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-07 23:02:43,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:02:43,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:02:43,939 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-07 23:02:43,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:02:43,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061151510] [2025-02-07 23:02:43,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061151510] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:02:43,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:02:43,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:02:43,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847425645] [2025-02-07 23:02:43,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:02:43,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:02:43,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:02:43,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:02:43,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:02:43,941 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:02:44,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:02:44,012 INFO L93 Difference]: Finished difference Result 137 states and 197 transitions. [2025-02-07 23:02:44,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:02:44,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-02-07 23:02:44,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:02:44,014 INFO L225 Difference]: With dead ends: 137 [2025-02-07 23:02:44,014 INFO L226 Difference]: Without dead ends: 92 [2025-02-07 23:02:44,014 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-07 23:02:44,014 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 100 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:02:44,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 206 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:02:44,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-07 23:02:44,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-07 23:02:44,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4505494505494505) internal successors, (132), 91 states have internal predecessors, (132), 0 states have call successors, (0), 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-07 23:02:44,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2025-02-07 23:02:44,021 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 40 [2025-02-07 23:02:44,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:02:44,022 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2025-02-07 23:02:44,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:02:44,022 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2025-02-07 23:02:44,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-07 23:02:44,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:02:44,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:02:44,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 23:02:44,025 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:02:44,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:02:44,025 INFO L85 PathProgramCache]: Analyzing trace with hash 349987430, now seen corresponding path program 1 times [2025-02-07 23:02:44,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:02:44,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860763219] [2025-02-07 23:02:44,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:02:44,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:02:44,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-07 23:02:44,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-07 23:02:44,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:02:44,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:02:44,066 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 23:02:44,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-07 23:02:44,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-07 23:02:44,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:02:44,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:02:44,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 23:02:44,106 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 23:02:44,109 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 23:02:44,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 23:02:44,113 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-07 23:02:44,139 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:02:44,150 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 23:02:44,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 11:02:44 BoogieIcfgContainer [2025-02-07 23:02:44,154 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 23:02:44,155 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 23:02:44,155 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 23:02:44,155 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 23:02:44,155 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:02:42" (3/4) ... [2025-02-07 23:02:44,157 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 23:02:44,158 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 23:02:44,159 INFO L158 Benchmark]: Toolchain (without parser) took 2617.29ms. Allocated memory is still 167.8MB. Free memory was 132.6MB in the beginning and 108.5MB in the end (delta: 24.1MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2025-02-07 23:02:44,159 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:02:44,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.03ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 116.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 23:02:44,160 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.27ms. Allocated memory is still 167.8MB. Free memory was 116.2MB in the beginning and 107.4MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:02:44,160 INFO L158 Benchmark]: Boogie Preprocessor took 84.17ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 102.4MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:02:44,161 INFO L158 Benchmark]: IcfgBuilder took 740.39ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 48.3MB in the end (delta: 54.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-07 23:02:44,161 INFO L158 Benchmark]: TraceAbstraction took 1494.52ms. Allocated memory is still 167.8MB. Free memory was 47.9MB in the beginning and 108.5MB in the end (delta: -60.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:02:44,161 INFO L158 Benchmark]: Witness Printer took 3.20ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 108.5MB in the end (delta: 30.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:02:44,163 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.03ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 116.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.27ms. Allocated memory is still 167.8MB. Free memory was 116.2MB in the beginning and 107.4MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.17ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 102.4MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 740.39ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 48.3MB in the end (delta: 54.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1494.52ms. Allocated memory is still 167.8MB. Free memory was 47.9MB in the beginning and 108.5MB in the end (delta: -60.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.20ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 108.5MB in the end (delta: 30.0kB). 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 102. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_1 var_10 = 0; [L33] const SORT_5 var_18 = 1; [L34] const SORT_5 var_28 = 0; [L36] SORT_1 input_2; [L37] SORT_1 input_3; [L38] SORT_1 input_4; [L39] SORT_5 input_6; [L40] SORT_5 input_7; [L41] SORT_5 input_8; [L42] SORT_5 input_9; [L44] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L44] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L45] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L46] SORT_1 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L47] SORT_1 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L48] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L49] SORT_5 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L50] SORT_5 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L51] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L52] SORT_5 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L53] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L54] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L55] SORT_1 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] SORT_1 init_12_arg_1 = var_10; [L58] state_11 = init_12_arg_1 [L59] SORT_1 init_14_arg_1 = var_10; [L60] state_13 = init_14_arg_1 [L61] SORT_1 init_23_arg_1 = var_10; [L62] state_22 = init_23_arg_1 [L63] SORT_1 init_25_arg_1 = var_10; [L64] state_24 = init_25_arg_1 [L65] SORT_1 init_27_arg_1 = var_10; [L66] state_26 = init_27_arg_1 [L67] SORT_5 init_30_arg_1 = var_28; [L68] state_29 = init_30_arg_1 [L69] SORT_5 init_32_arg_1 = var_28; [L70] state_31 = init_32_arg_1 [L71] SORT_1 init_34_arg_1 = var_10; [L72] state_33 = init_34_arg_1 [L73] SORT_5 init_36_arg_1 = var_28; [L74] state_35 = init_36_arg_1 [L75] SORT_1 init_38_arg_1 = var_10; [L76] state_37 = init_38_arg_1 [L77] SORT_1 init_41_arg_1 = var_10; [L78] state_40 = init_41_arg_1 [L79] SORT_1 init_43_arg_1 = var_10; [L80] state_42 = init_43_arg_1 VAL [mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] EXPR input_7 & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] EXPR input_8 & mask_SORT_5 VAL [input_7=0, mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] EXPR input_9 & mask_SORT_5 VAL [input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_20_arg_0=1, var_20_arg_1=-2, var_28=0] [L102] EXPR var_20_arg_0 & var_20_arg_1 VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] EXPR var_20 & mask_SORT_5 VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; [L105] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 100 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 847 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 525 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 200 IncrementalHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 322 mSDtfsCounter, 200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=2, InterpolantAutomatonStates: 12, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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-07 23:02:44,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.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 caa84a091b99b66a1da3990b205ee8e8e4cfa2478d32b035bf8784a52ef5640a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:02:46,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:02:46,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-07 23:02:46,202 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:02:46,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:02:46,218 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:02:46,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:02:46,219 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:02:46,219 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:02:46,219 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:02:46,219 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:02:46,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:02:46,220 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:02:46,220 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:02:46,220 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:02:46,220 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:02:46,220 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:02:46,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:02:46,220 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:02:46,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:02:46,220 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:02:46,220 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 23:02:46,220 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 23:02:46,220 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 23:02:46,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:02:46,220 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:02:46,220 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:02:46,220 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:02:46,220 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:02:46,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:02:46,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:02:46,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:02:46,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:02:46,221 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:02:46,221 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:02:46,221 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:02:46,221 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 23:02:46,221 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 23:02:46,221 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:02:46,221 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:02:46,221 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:02:46,221 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:02:46,221 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 -> caa84a091b99b66a1da3990b205ee8e8e4cfa2478d32b035bf8784a52ef5640a [2025-02-07 23:02:46,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:02:46,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:02:46,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:02:46,481 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:02:46,481 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:02:46,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c [2025-02-07 23:02:47,679 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14a0ab7c9/a117c6d6562d4d1caefee3da30282321/FLAG840df4dc0 [2025-02-07 23:02:47,894 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:02:47,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c [2025-02-07 23:02:47,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14a0ab7c9/a117c6d6562d4d1caefee3da30282321/FLAG840df4dc0 [2025-02-07 23:02:48,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14a0ab7c9/a117c6d6562d4d1caefee3da30282321 [2025-02-07 23:02:48,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:02:48,236 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:02:48,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:02:48,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:02:48,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:02:48,240 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:02:48" (1/1) ... [2025-02-07 23:02:48,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cd97955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:48, skipping insertion in model container [2025-02-07 23:02:48,242 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:02:48" (1/1) ... [2025-02-07 23:02:48,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:02:48,353 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c[1249,1262] [2025-02-07 23:02:48,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:02:48,407 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:02:48,416 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c[1249,1262] [2025-02-07 23:02:48,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:02:48,463 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:02:48,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:48 WrapperNode [2025-02-07 23:02:48,464 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:02:48,465 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:02:48,465 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:02:48,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:02:48,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:48" (1/1) ... [2025-02-07 23:02:48,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:48" (1/1) ... [2025-02-07 23:02:48,502 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 249 [2025-02-07 23:02:48,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:02:48,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:02:48,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:02:48,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:02:48,509 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:48" (1/1) ... [2025-02-07 23:02:48,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:48" (1/1) ... [2025-02-07 23:02:48,512 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:48" (1/1) ... [2025-02-07 23:02:48,524 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-07 23:02:48,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:48" (1/1) ... [2025-02-07 23:02:48,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:48" (1/1) ... [2025-02-07 23:02:48,533 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:48" (1/1) ... [2025-02-07 23:02:48,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:48" (1/1) ... [2025-02-07 23:02:48,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:48" (1/1) ... [2025-02-07 23:02:48,537 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:48" (1/1) ... [2025-02-07 23:02:48,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:02:48,539 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:02:48,539 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:02:48,540 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:02:48,541 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:48" (1/1) ... [2025-02-07 23:02:48,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:02:48,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:02:48,569 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-07 23:02:48,574 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-07 23:02:48,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:02:48,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 23:02:48,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:02:48,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:02:48,670 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:02:48,672 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:02:48,890 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-02-07 23:02:48,891 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:02:48,897 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:02:48,897 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:02:48,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:02:48 BoogieIcfgContainer [2025-02-07 23:02:48,898 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:02:48,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:02:48,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:02:48,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:02:48,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:02:48" (1/3) ... [2025-02-07 23:02:48,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1e0ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:02:48, skipping insertion in model container [2025-02-07 23:02:48,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:48" (2/3) ... [2025-02-07 23:02:48,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1e0ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:02:48, skipping insertion in model container [2025-02-07 23:02:48,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:02:48" (3/3) ... [2025-02-07 23:02:48,908 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v1.c [2025-02-07 23:02:48,920 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:02:48,921 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.eq_sdp_v1.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:02:48,953 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:02:48,965 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;@5639db16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:02:48,966 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:02:48,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:02:48,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 23:02:48,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:02:48,974 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 23:02:48,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:02:48,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:02:48,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-07 23:02:48,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:02:48,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1983558238] [2025-02-07 23:02:48,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:02:48,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:02:48,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:02:48,988 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-07 23:02:48,989 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-07 23:02:49,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 23:02:49,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 23:02:49,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:02:49,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:02:49,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-07 23:02:49,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:02:49,243 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-07 23:02:49,243 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:02:49,244 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:02:49,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983558238] [2025-02-07 23:02:49,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983558238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:02:49,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:02:49,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:02:49,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585938623] [2025-02-07 23:02:49,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:02:49,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:02:49,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:02:49,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:02:49,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:02:49,262 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:02:49,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:02:49,285 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2025-02-07 23:02:49,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:02:49,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-07 23:02:49,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:02:49,290 INFO L225 Difference]: With dead ends: 15 [2025-02-07 23:02:49,291 INFO L226 Difference]: Without dead ends: 8 [2025-02-07 23:02:49,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-07 23:02:49,296 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 23:02:49,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 23:02:49,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2025-02-07 23:02:49,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-02-07 23:02:49,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:02:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-07 23:02:49,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-07 23:02:49,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:02:49,315 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-07 23:02:49,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:02:49,315 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-07 23:02:49,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 23:02:49,315 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:02:49,315 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-07 23:02:49,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 23:02:49,516 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-07 23:02:49,516 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:02:49,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:02:49,517 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-07 23:02:49,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:02:49,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [986024209] [2025-02-07 23:02:49,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:02:49,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:02:49,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:02:49,521 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-07 23:02:49,522 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-07 23:02:49,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 23:02:49,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 23:02:49,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:02:49,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:02:49,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-07 23:02:49,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:02:49,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:02:49,875 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:02:52,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:02:52,843 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:02:52,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986024209] [2025-02-07 23:02:52,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986024209] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:02:52,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 23:02:52,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-07 23:02:52,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329446440] [2025-02-07 23:02:52,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 23:02:52,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:02:52,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:02:52,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:02:52,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:02:52,847 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:02:53,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:02:53,328 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-02-07 23:02:53,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:02:53,329 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-07 23:02:53,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:02:53,329 INFO L225 Difference]: With dead ends: 13 [2025-02-07 23:02:53,329 INFO L226 Difference]: Without dead ends: 11 [2025-02-07 23:02:53,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:02:53,330 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:02:53,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:02:53,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-02-07 23:02:53,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-02-07 23:02:53,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:02:53,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-02-07 23:02:53,332 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-02-07 23:02:53,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:02:53,332 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-02-07 23:02:53,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:02:53,333 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-02-07 23:02:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 23:02:53,333 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:02:53,333 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-02-07 23:02:53,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 23:02:53,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:02:53,534 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:02:53,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:02:53,534 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-02-07 23:02:53,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:02:53,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1038508248] [2025-02-07 23:02:53,535 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 23:02:53,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:02:53,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:02:53,537 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 23:02:53,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 23:02:53,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-07 23:02:53,625 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 23:02:53,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 23:02:53,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:02:53,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-07 23:02:53,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:02:55,368 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:02:55,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:03:05,348 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse23 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_5~0#1|))) (let ((.cse0 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_29~0#1|)) (.cse8 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_31~0#1|))) .cse23)))) (.cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_26~0#1|)))) (.cse2 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_15| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_15|)))) .cse23))))) (.cse11 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_15| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_15|)))) .cse23)))))) (let ((.cse1 (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_10~0#1|))))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) .cse19))) (.cse18 (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_28~0#1|))) .cse23)) (_ bv0 8)))) (and (or (not .cse18) .cse2 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse20 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse19 (bvneg .cse19)))))))) .cse20))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse20 .cse21))))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse22 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvmul .cse19 (_ bv2 32)))))))) .cse22))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse21)))))) .cse18 .cse2) .cse11)))) (.cse4 (bvneg .cse9)) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_40~0#1|)))))) (.cse7 (not .cse8)) (.cse12 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_24~0#1|)) (.cse13 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_22~0#1|)) (.cse14 (not .cse0))) (and (or .cse0 .cse1) (or (let ((.cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse12 .cse13))))))))) (and (or .cse2 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse5 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 .cse4))))))) .cse5))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 .cse5)))))) .cse7) (or .cse8 .cse2 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse10 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 .cse9))))))) .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 .cse10))))))) .cse11)) .cse0) (or .cse14 .cse1) (or (let ((.cse15 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg .cse12) .cse13))))))))) (and (or .cse8 .cse2 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse16 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse15 .cse9))))))) .cse16))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 .cse16))))))) .cse11 (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse17 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse15 .cse4))))))) .cse17))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 .cse17)))))) .cse2 .cse7))) .cse14))))) is different from false [2025-02-07 23:03:08,836 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-02-07 23:03:08,836 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:03:08,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038508248] [2025-02-07 23:03:08,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038508248] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:03:08,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 23:03:08,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-02-07 23:03:08,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675326858] [2025-02-07 23:03:08,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 23:03:08,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 23:03:08,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:03:08,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 23:03:08,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2025-02-07 23:03:08,837 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:03:12,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:03:12,477 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2025-02-07 23:03:12,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:03:12,478 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-07 23:03:12,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:03:12,478 INFO L225 Difference]: With dead ends: 16 [2025-02-07 23:03:12,478 INFO L226 Difference]: Without dead ends: 14 [2025-02-07 23:03:12,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=66, Invalid=177, Unknown=1, NotChecked=28, Total=272 [2025-02-07 23:03:12,479 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:03:12,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 9 Unchecked, 0.5s Time] [2025-02-07 23:03:12,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-02-07 23:03:12,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-02-07 23:03:12,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:03:12,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-02-07 23:03:12,481 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2025-02-07 23:03:12,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:03:12,481 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-02-07 23:03:12,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:03:12,481 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-02-07 23:03:12,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-07 23:03:12,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:03:12,481 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2025-02-07 23:03:12,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 23:03:12,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:03:12,687 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:03:12,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:03:12,688 INFO L85 PathProgramCache]: Analyzing trace with hash 852005001, now seen corresponding path program 3 times [2025-02-07 23:03:12,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:03:12,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1868820942] [2025-02-07 23:03:12,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 23:03:12,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:03:12,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:03:12,695 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 23:03:12,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 23:03:12,790 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 4 equivalence classes. [2025-02-07 23:03:13,074 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 23:03:13,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-07 23:03:13,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:03:13,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-07 23:03:13,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:03:36,581 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:03:36,581 INFO L312 TraceCheckSpWp]: Computing backward predicates...