./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.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.mul2.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 275f3564868260c0f8bba92723013207b6a72ca364aead8f492ecb284c649797 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:31:59,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:32:00,021 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:32:00,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:32:00,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:32:00,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:32:00,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:32:00,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:32:00,039 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:32:00,039 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:32:00,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:32:00,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:32:00,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:32:00,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:32:00,039 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:32:00,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:32:00,040 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:32:00,040 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 23:32:00,040 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:32:00,040 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:32:00,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:32:00,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:32:00,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:32:00,040 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:32:00,040 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:32:00,041 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:32:00,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:32:00,041 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:32:00,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:32:00,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:32:00,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:32:00,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:32:00,041 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:32:00,041 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:32:00,041 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 23:32:00,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 23:32:00,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:32:00,042 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:32:00,042 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:32:00,042 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:32:00,042 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 -> 275f3564868260c0f8bba92723013207b6a72ca364aead8f492ecb284c649797 [2025-02-07 23:32:00,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:32:00,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:32:00,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:32:00,239 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:32:00,239 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:32:00,240 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.mul2.c [2025-02-07 23:32:01,317 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/06d75f78d/3543200a67b343ab8a9fedbc4cad129b/FLAGef8169d94 [2025-02-07 23:32:01,614 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:32:01,615 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.c [2025-02-07 23:32:01,627 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/06d75f78d/3543200a67b343ab8a9fedbc4cad129b/FLAGef8169d94 [2025-02-07 23:32:01,910 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/06d75f78d/3543200a67b343ab8a9fedbc4cad129b [2025-02-07 23:32:01,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:32:01,913 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:32:01,914 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:32:01,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:32:01,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:32:01,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:32:01" (1/1) ... [2025-02-07 23:32:01,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3633c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:01, skipping insertion in model container [2025-02-07 23:32:01,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:32:01" (1/1) ... [2025-02-07 23:32:01,935 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:32:02,044 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.mul2.c[1298,1311] [2025-02-07 23:32:02,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:32:02,098 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:32:02,108 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.mul2.c[1298,1311] [2025-02-07 23:32:02,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:32:02,142 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:32:02,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:02 WrapperNode [2025-02-07 23:32:02,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:32:02,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:32:02,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:32:02,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:32:02,148 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:32:02" (1/1) ... [2025-02-07 23:32:02,160 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:32:02" (1/1) ... [2025-02-07 23:32:02,198 INFO L138 Inliner]: procedures = 18, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 372 [2025-02-07 23:32:02,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:32:02,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:32:02,199 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:32:02,199 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:32:02,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:02" (1/1) ... [2025-02-07 23:32:02,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:02" (1/1) ... [2025-02-07 23:32:02,211 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:02" (1/1) ... [2025-02-07 23:32:02,238 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-02-07 23:32:02,238 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:02" (1/1) ... [2025-02-07 23:32:02,238 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:02" (1/1) ... [2025-02-07 23:32:02,248 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:02" (1/1) ... [2025-02-07 23:32:02,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:02" (1/1) ... [2025-02-07 23:32:02,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:02" (1/1) ... [2025-02-07 23:32:02,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:02" (1/1) ... [2025-02-07 23:32:02,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:32:02,271 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:32:02,271 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:32:02,271 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:32:02,272 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:02" (1/1) ... [2025-02-07 23:32:02,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:32:02,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:32:02,303 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:32:02,312 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:32:02,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:32:02,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 23:32:02,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 23:32:02,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:32:02,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:32:02,420 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:32:02,422 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:32:02,863 INFO L? ?]: Removed 135 outVars from TransFormulas that were not future-live. [2025-02-07 23:32:02,863 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:32:02,898 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:32:02,898 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:32:02,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:32:02 BoogieIcfgContainer [2025-02-07 23:32:02,899 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:32:02,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:32:02,901 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:32:02,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:32:02,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:32:01" (1/3) ... [2025-02-07 23:32:02,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab3a837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:32:02, skipping insertion in model container [2025-02-07 23:32:02,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:02" (2/3) ... [2025-02-07 23:32:02,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab3a837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:32:02, skipping insertion in model container [2025-02-07 23:32:02,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:32:02" (3/3) ... [2025-02-07 23:32:02,906 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul2.c [2025-02-07 23:32:02,917 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:32:02,919 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.mul2.c that has 1 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:32:02,963 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:32:02,974 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;@7d93a23e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:32:02,975 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:32:02,979 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:32:02,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-07 23:32:02,983 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:02,984 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] [2025-02-07 23:32:02,985 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:02,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:02,989 INFO L85 PathProgramCache]: Analyzing trace with hash -120527702, now seen corresponding path program 1 times [2025-02-07 23:32:02,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:32:02,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997596671] [2025-02-07 23:32:02,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:02,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:32:03,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-07 23:32:03,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-07 23:32:03,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:03,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:32:03,504 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:32:03,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:32:03,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997596671] [2025-02-07 23:32:03,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997596671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:32:03,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:32:03,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:32:03,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912323803] [2025-02-07 23:32:03,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:32:03,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:32:03,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:32:03,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:32:03,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:32:03,527 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 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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:32:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:32:03,620 INFO L93 Difference]: Finished difference Result 151 states and 223 transitions. [2025-02-07 23:32:03,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:32:03,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 30 [2025-02-07 23:32:03,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:32:03,627 INFO L225 Difference]: With dead ends: 151 [2025-02-07 23:32:03,627 INFO L226 Difference]: Without dead ends: 92 [2025-02-07 23:32:03,629 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:32:03,630 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:32:03,631 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:32:03,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-07 23:32:03,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-07 23:32:03,648 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:32:03,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2025-02-07 23:32:03,651 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 30 [2025-02-07 23:32:03,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:32:03,652 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2025-02-07 23:32:03,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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:32:03,652 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2025-02-07 23:32:03,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-07 23:32:03,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:03,653 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:32:03,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 23:32:03,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:03,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:03,654 INFO L85 PathProgramCache]: Analyzing trace with hash 563287733, now seen corresponding path program 1 times [2025-02-07 23:32:03,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:32:03,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223738217] [2025-02-07 23:32:03,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:03,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:32:03,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-07 23:32:03,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-07 23:32:03,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:03,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:32:03,775 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:32:03,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:32:03,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223738217] [2025-02-07 23:32:03,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223738217] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:32:03,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:32:03,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:32:03,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668711470] [2025-02-07 23:32:03,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:32:03,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:32:03,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:32:03,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:32:03,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:32:03,778 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:32:03,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:32:03,850 INFO L93 Difference]: Finished difference Result 153 states and 222 transitions. [2025-02-07 23:32:03,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:32:03,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-07 23:32:03,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:32:03,852 INFO L225 Difference]: With dead ends: 153 [2025-02-07 23:32:03,852 INFO L226 Difference]: Without dead ends: 94 [2025-02-07 23:32:03,852 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:32:03,853 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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:32:03,853 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:32:03,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-07 23:32:03,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-07 23:32:03,857 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:32:03,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2025-02-07 23:32:03,857 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 31 [2025-02-07 23:32:03,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:32:03,858 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2025-02-07 23:32:03,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:32:03,858 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2025-02-07 23:32:03,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-07 23:32:03,858 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:03,859 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:32:03,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 23:32:03,859 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:03,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:03,859 INFO L85 PathProgramCache]: Analyzing trace with hash -2081407483, now seen corresponding path program 1 times [2025-02-07 23:32:03,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:32:03,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487604930] [2025-02-07 23:32:03,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:03,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:32:03,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-07 23:32:03,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-07 23:32:03,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:03,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:32:04,067 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:32:04,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:32:04,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487604930] [2025-02-07 23:32:04,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487604930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:32:04,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:32:04,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:32:04,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88310584] [2025-02-07 23:32:04,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:32:04,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:32:04,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:32:04,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:32:04,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:32:04,069 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:32:04,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:32:04,132 INFO L93 Difference]: Finished difference Result 153 states and 221 transitions. [2025-02-07 23:32:04,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:32:04,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-02-07 23:32:04,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:32:04,134 INFO L225 Difference]: With dead ends: 153 [2025-02-07 23:32:04,134 INFO L226 Difference]: Without dead ends: 92 [2025-02-07 23:32:04,134 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:32:04,135 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 108 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 23:32:04,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 207 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 23:32:04,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-07 23:32:04,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-07 23:32:04,141 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:32:04,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2025-02-07 23:32:04,141 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 32 [2025-02-07 23:32:04,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:32:04,142 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2025-02-07 23:32:04,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:32:04,142 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2025-02-07 23:32:04,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-07 23:32:04,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:04,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:32:04,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 23:32:04,145 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:04,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:04,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2085291932, now seen corresponding path program 1 times [2025-02-07 23:32:04,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:32:04,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726862713] [2025-02-07 23:32:04,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:04,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:32:04,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 23:32:04,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 23:32:04,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:04,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:32:04,193 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 23:32:04,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 23:32:04,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 23:32:04,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:04,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:32:04,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 23:32:04,239 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 23:32:04,240 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 23:32:04,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 23:32:04,247 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-07 23:32:04,276 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:32:04,284 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 23:32:04,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 11:32:04 BoogieIcfgContainer [2025-02-07 23:32:04,290 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 23:32:04,290 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 23:32:04,291 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 23:32:04,291 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 23:32:04,291 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:32:02" (3/4) ... [2025-02-07 23:32:04,293 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 23:32:04,293 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 23:32:04,294 INFO L158 Benchmark]: Toolchain (without parser) took 2380.58ms. Allocated memory is still 142.6MB. Free memory was 114.6MB in the beginning and 83.4MB in the end (delta: 31.3MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2025-02-07 23:32:04,294 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:32:04,294 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.36ms. Allocated memory is still 142.6MB. Free memory was 114.6MB in the beginning and 100.1MB in the end (delta: 14.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:32:04,294 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.80ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 94.8MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:32:04,294 INFO L158 Benchmark]: Boogie Preprocessor took 71.58ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 91.7MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:32:04,298 INFO L158 Benchmark]: IcfgBuilder took 628.46ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 50.5MB in the end (delta: 41.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-07 23:32:04,298 INFO L158 Benchmark]: TraceAbstraction took 1389.45ms. Allocated memory is still 142.6MB. Free memory was 49.8MB in the beginning and 83.4MB in the end (delta: -33.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:32:04,298 INFO L158 Benchmark]: Witness Printer took 2.63ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 83.4MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:32:04,299 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.13ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.36ms. Allocated memory is still 142.6MB. Free memory was 114.6MB in the beginning and 100.1MB in the end (delta: 14.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.80ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 94.8MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 71.58ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 91.7MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 628.46ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 50.5MB in the end (delta: 41.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1389.45ms. Allocated memory is still 142.6MB. Free memory was 49.8MB in the beginning and 83.4MB in the end (delta: -33.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.63ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 83.4MB in the end (delta: 37.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: 22]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 92. Possible FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 64); [L31] const SORT_5 msb_SORT_5 = (SORT_5)1 << (64 - 1); [L33] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 128); [L34] const SORT_9 msb_SORT_9 = (SORT_9)1 << (128 - 1); [L36] const SORT_9 var_10 = 0; [L37] const SORT_1 var_18 = 1; [L38] const SORT_5 var_22 = 0; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L42] SORT_1 input_4; [L43] SORT_5 input_6; [L44] SORT_5 input_7; [L45] SORT_1 input_8; [L47] EXPR __VERIFIER_nondet_uint128() & mask_SORT_9 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L47] SORT_9 state_11 = __VERIFIER_nondet_uint128() & mask_SORT_9; [L48] EXPR __VERIFIER_nondet_uint128() & mask_SORT_9 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L48] SORT_9 state_13 = __VERIFIER_nondet_uint128() & mask_SORT_9; [L49] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L49] SORT_5 state_23 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L50] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L50] SORT_5 state_25 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L51] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L52] SORT_1 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L53] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L53] SORT_5 state_31 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L54] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L54] SORT_5 state_33 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L56] SORT_9 init_12_arg_1 = var_10; [L57] state_11 = init_12_arg_1 [L58] SORT_9 init_14_arg_1 = var_10; [L59] state_13 = init_14_arg_1 [L60] SORT_5 init_24_arg_1 = var_22; [L61] state_23 = init_24_arg_1 [L62] SORT_5 init_26_arg_1 = var_22; [L63] state_25 = init_26_arg_1 [L64] SORT_1 init_28_arg_1 = var_18; [L65] state_27 = init_28_arg_1 [L66] SORT_1 init_30_arg_1 = var_18; [L67] state_29 = init_30_arg_1 [L68] SORT_5 init_32_arg_1 = var_22; [L69] state_31 = init_32_arg_1 [L70] SORT_5 init_34_arg_1 = var_22; [L71] state_33 = init_34_arg_1 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_11=0, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_3 = __VERIFIER_nondet_uchar() [L76] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_11=0, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L76] input_3 = input_3 & mask_SORT_1 [L77] input_4 = __VERIFIER_nondet_uchar() [L78] EXPR input_4 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_11=0, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L78] input_4 = input_4 & mask_SORT_1 [L79] input_6 = __VERIFIER_nondet_ulong() [L80] input_7 = __VERIFIER_nondet_ulong() [L81] input_8 = __VERIFIER_nondet_uchar() [L82] EXPR input_8 & mask_SORT_1 VAL [input_3=0, input_4=0, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_11=0, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L82] input_8 = input_8 & mask_SORT_1 [L85] SORT_9 var_15_arg_0 = state_11; [L86] SORT_9 var_15_arg_1 = state_13; [L87] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L88] SORT_1 var_19_arg_0 = var_15; [L89] SORT_1 var_19 = ~var_19_arg_0; [L90] SORT_1 var_20_arg_0 = var_18; [L91] SORT_1 var_20_arg_1 = var_19; VAL [input_3=0, input_4=0, input_8=0, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_20_arg_0=1, var_20_arg_1=-2, var_22=0] [L92] EXPR var_20_arg_0 & var_20_arg_1 VAL [input_3=0, input_4=0, input_8=0, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L92] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L93] EXPR var_20 & mask_SORT_1 VAL [input_3=0, input_4=0, input_8=0, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L93] var_20 = var_20 & mask_SORT_1 [L94] SORT_1 bad_21_arg_0 = var_20; [L95] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L22] COND TRUE !(cond) [L22] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 108 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 848 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 526 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 199 IncrementalHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 322 mSDtfsCounter, 199 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.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 161 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:32:04,315 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.mul2.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 275f3564868260c0f8bba92723013207b6a72ca364aead8f492ecb284c649797 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:32:06,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:32:06,429 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:32:06,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:32:06,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:32:06,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:32:06,451 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:32:06,451 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:32:06,451 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:32:06,451 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:32:06,451 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:32:06,451 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:32:06,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:32:06,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:32:06,452 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:32:06,452 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:32:06,452 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:32:06,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:32:06,452 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:32:06,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:32:06,452 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:32:06,452 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 23:32:06,452 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 23:32:06,452 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 23:32:06,452 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:32:06,452 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:32:06,452 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:32:06,452 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:32:06,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:32:06,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:32:06,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:32:06,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:32:06,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:32:06,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:32:06,453 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:32:06,453 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:32:06,453 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 23:32:06,453 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 23:32:06,453 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:32:06,453 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:32:06,453 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:32:06,453 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:32:06,453 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 -> 275f3564868260c0f8bba92723013207b6a72ca364aead8f492ecb284c649797 [2025-02-07 23:32:06,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:32:06,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:32:06,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:32:06,806 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:32:06,806 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:32:06,807 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.mul2.c [2025-02-07 23:32:08,025 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e059848d7/c62af2f531494967baf81bfc3e6ff020/FLAGe44c9a616 [2025-02-07 23:32:08,247 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:32:08,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.c [2025-02-07 23:32:08,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e059848d7/c62af2f531494967baf81bfc3e6ff020/FLAGe44c9a616 [2025-02-07 23:32:08,613 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e059848d7/c62af2f531494967baf81bfc3e6ff020 [2025-02-07 23:32:08,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:32:08,616 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:32:08,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:32:08,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:32:08,631 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:32:08,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:32:08" (1/1) ... [2025-02-07 23:32:08,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@254f6a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:08, skipping insertion in model container [2025-02-07 23:32:08,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:32:08" (1/1) ... [2025-02-07 23:32:08,663 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:32:08,890 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.mul2.c[1298,1311] [2025-02-07 23:32:08,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:32:08,966 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:32:08,976 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.mul2.c[1298,1311] [2025-02-07 23:32:09,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:32:09,031 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:32:09,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:09 WrapperNode [2025-02-07 23:32:09,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:32:09,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:32:09,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:32:09,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:32:09,040 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:32:09" (1/1) ... [2025-02-07 23:32:09,050 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:32:09" (1/1) ... [2025-02-07 23:32:09,076 INFO L138 Inliner]: procedures = 18, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 204 [2025-02-07 23:32:09,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:32:09,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:32:09,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:32:09,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:32:09,088 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:09" (1/1) ... [2025-02-07 23:32:09,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:09" (1/1) ... [2025-02-07 23:32:09,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:09" (1/1) ... [2025-02-07 23:32:09,112 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-02-07 23:32:09,113 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:09" (1/1) ... [2025-02-07 23:32:09,113 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:09" (1/1) ... [2025-02-07 23:32:09,117 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:09" (1/1) ... [2025-02-07 23:32:09,118 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:09" (1/1) ... [2025-02-07 23:32:09,119 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:09" (1/1) ... [2025-02-07 23:32:09,120 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:09" (1/1) ... [2025-02-07 23:32:09,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:32:09,123 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:32:09,123 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:32:09,123 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:32:09,124 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:09" (1/1) ... [2025-02-07 23:32:09,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:32:09,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:32:09,157 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:32:09,160 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:32:09,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:32:09,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 23:32:09,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-07 23:32:09,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:32:09,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:32:09,266 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:32:09,268 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:32:10,967 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-02-07 23:32:10,968 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:32:10,973 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:32:10,974 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:32:10,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:32:10 BoogieIcfgContainer [2025-02-07 23:32:10,974 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:32:10,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:32:10,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:32:10,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:32:10,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:32:08" (1/3) ... [2025-02-07 23:32:10,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a14c08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:32:10, skipping insertion in model container [2025-02-07 23:32:10,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:32:09" (2/3) ... [2025-02-07 23:32:10,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a14c08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:32:10, skipping insertion in model container [2025-02-07 23:32:10,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:32:10" (3/3) ... [2025-02-07 23:32:10,981 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul2.c [2025-02-07 23:32:10,990 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:32:10,991 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.mul2.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:32:11,025 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:32:11,038 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;@405c4a84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:32:11,038 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:32:11,041 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:32:11,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 23:32:11,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:11,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 23:32:11,048 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:11,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:11,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-07 23:32:11,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:32:11,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [654766737] [2025-02-07 23:32:11,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:11,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:32:11,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:32:11,069 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:32:11,070 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:32:11,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 23:32:11,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 23:32:11,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:11,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:32:11,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-07 23:32:11,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:32:11,421 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:32:11,421 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:32:11,421 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:32:11,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654766737] [2025-02-07 23:32:11,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654766737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:32:11,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:32:11,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:32:11,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744126447] [2025-02-07 23:32:11,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:32:11,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:32:11,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:32:11,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:32:11,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:32:11,443 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:32:12,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:32:12,349 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2025-02-07 23:32:12,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:32:12,351 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:32:12,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:32:12,356 INFO L225 Difference]: With dead ends: 15 [2025-02-07 23:32:12,356 INFO L226 Difference]: Without dead ends: 8 [2025-02-07 23:32:12,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:32:12,364 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2025-02-07 23:32:12,364 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.9s Time] [2025-02-07 23:32:12,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2025-02-07 23:32:12,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-02-07 23:32:12,386 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:32:12,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-07 23:32:12,389 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-07 23:32:12,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:32:12,389 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-07 23:32:12,389 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:32:12,389 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-07 23:32:12,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 23:32:12,390 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:12,390 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-07 23:32:12,399 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:32:12,590 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:32:12,591 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:12,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:12,593 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-07 23:32:12,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:32:12,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [955581481] [2025-02-07 23:32:12,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:32:12,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:32:12,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:32:12,596 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:32:12,597 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:32:12,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 23:32:12,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 23:32:12,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:32:12,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:32:12,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-07 23:32:12,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:32:13,891 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:32:13,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:32:39,821 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse1 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_29~0#1|)) (.cse3 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_10|))))))))) (.cse2 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_10|)))))))))) (and (or (forall ((|ULTIMATE.start_main_~state_27~0#1| (_ BitVec 8))) (not (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |ULTIMATE.start_main_~state_27~0#1|) .cse1))))) (_ bv0 8)))) (and (or .cse2 (forall ((|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 64))) (= (bvand |c_ULTIMATE.start_main_~state_13~0#1| |ULTIMATE.start_main_~mask_SORT_9~0#1|) (bvand (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_25~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|)))) .cse3)) (or (forall ((|ULTIMATE.start_main_~state_27~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) |ULTIMATE.start_main_~state_27~0#1|) .cse1))))) (_ bv0 8))) (and .cse3 (or .cse2 (forall ((|ULTIMATE.start_main_~mask_SORT_9~0#1| (_ BitVec 128)) (|ULTIMATE.start_main_~mask_SORT_5~0#1| (_ BitVec 64))) (= (bvand |ULTIMATE.start_main_~mask_SORT_9~0#1| (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_31~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_33~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)))) (bvand (bvmul ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_23~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|)) ((_ zero_extend 64) (bvand |c_ULTIMATE.start_main_~state_25~0#1| |ULTIMATE.start_main_~mask_SORT_5~0#1|))) |ULTIMATE.start_main_~mask_SORT_9~0#1|))))))))) is different from true [2025-02-07 23:32:56,140 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-07 23:32:59,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-02-07 23:32:59,543 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:32:59,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955581481] [2025-02-07 23:32:59,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955581481] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:32:59,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 23:32:59,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2025-02-07 23:32:59,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995903891] [2025-02-07 23:32:59,543 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 23:32:59,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 23:32:59,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:32:59,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 23:32:59,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=65, Unknown=1, NotChecked=16, Total=110 [2025-02-07 23:32:59,544 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 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:33:07,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-02-07 23:33:10,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-02-07 23:33:13,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-02-07 23:33:13,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:33:13,056 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-02-07 23:33:13,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:33:13,106 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 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:33:13,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:33:13,107 INFO L225 Difference]: With dead ends: 13 [2025-02-07 23:33:13,107 INFO L226 Difference]: Without dead ends: 11 [2025-02-07 23:33:13,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=35, Invalid=78, Unknown=1, NotChecked=18, Total=132 [2025-02-07 23:33:13,109 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:33:13,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 9 Unchecked, 8.6s Time] [2025-02-07 23:33:13,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-02-07 23:33:13,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-02-07 23:33:13,115 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:33:13,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-02-07 23:33:13,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-02-07 23:33:13,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:33:13,116 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-02-07 23:33:13,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 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:33:13,116 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-02-07 23:33:13,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 23:33:13,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:33:13,116 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-02-07 23:33:13,135 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:33:13,316 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:33:13,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:33:13,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:33:13,318 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-02-07 23:33:13,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:33:13,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1687361212] [2025-02-07 23:33:13,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 23:33:13,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:33:13,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:33:13,322 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:33:13,324 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:33:13,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes.