./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-63.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash e14c549015d0f5635e62f75071e62e4bb462bdcfc99319d92dbe4063b5fd473b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:06:12,252 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:06:12,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:06:12,311 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:06:12,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:06:12,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:06:12,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:06:12,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:06:12,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:06:12,338 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:06:12,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:06:12,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:06:12,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:06:12,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:06:12,339 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:06:12,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:06:12,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:06:12,340 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:06:12,340 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:06:12,340 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:06:12,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:06:12,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:06:12,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:06:12,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:06:12,341 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:06:12,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:06:12,341 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:06:12,341 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:06:12,341 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:06:12,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:06:12,341 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:06:12,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:06:12,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:06:12,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:06:12,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:06:12,342 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:06:12,342 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:06:12,342 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:06:12,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:06:12,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:06:12,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:06:12,342 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:06:12,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:06:12,342 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e14c549015d0f5635e62f75071e62e4bb462bdcfc99319d92dbe4063b5fd473b [2025-02-06 03:06:12,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:06:12,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:06:12,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:06:12,584 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:06:12,584 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:06:12,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-63.i [2025-02-06 03:06:13,767 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3c4c38f0/5f913bf25bc645e5b5bf44b89c9189fc/FLAGa41e2d504 [2025-02-06 03:06:14,055 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:06:14,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-63.i [2025-02-06 03:06:14,066 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3c4c38f0/5f913bf25bc645e5b5bf44b89c9189fc/FLAGa41e2d504 [2025-02-06 03:06:14,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3c4c38f0/5f913bf25bc645e5b5bf44b89c9189fc [2025-02-06 03:06:14,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:06:14,354 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:06:14,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:06:14,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:06:14,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:06:14,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:06:14" (1/1) ... [2025-02-06 03:06:14,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f4dce94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:14, skipping insertion in model container [2025-02-06 03:06:14,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:06:14" (1/1) ... [2025-02-06 03:06:14,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:06:14,480 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/hardness-nfm22/hardness_variablewrapping_normal_file-63.i[913,926] [2025-02-06 03:06:14,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:06:14,518 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:06:14,526 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/hardness-nfm22/hardness_variablewrapping_normal_file-63.i[913,926] [2025-02-06 03:06:14,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:06:14,549 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:06:14,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:14 WrapperNode [2025-02-06 03:06:14,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:06:14,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:06:14,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:06:14,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:06:14,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:14" (1/1) ... [2025-02-06 03:06:14,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:14" (1/1) ... [2025-02-06 03:06:14,585 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2025-02-06 03:06:14,585 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:06:14,586 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:06:14,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:06:14,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:06:14,595 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:14" (1/1) ... [2025-02-06 03:06:14,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:14" (1/1) ... [2025-02-06 03:06:14,597 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:14" (1/1) ... [2025-02-06 03:06:14,605 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 03:06:14,606 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:14" (1/1) ... [2025-02-06 03:06:14,606 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:14" (1/1) ... [2025-02-06 03:06:14,609 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:14" (1/1) ... [2025-02-06 03:06:14,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:14" (1/1) ... [2025-02-06 03:06:14,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:14" (1/1) ... [2025-02-06 03:06:14,611 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:14" (1/1) ... [2025-02-06 03:06:14,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:06:14,615 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:06:14,615 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:06:14,615 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:06:14,616 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:14" (1/1) ... [2025-02-06 03:06:14,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:06:14,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:06:14,642 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-06 03:06:14,644 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-06 03:06:14,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:06:14,659 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:06:14,660 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:06:14,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:06:14,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:06:14,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:06:14,708 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:06:14,709 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:06:14,885 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-02-06 03:06:14,886 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:06:14,896 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:06:14,897 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:06:14,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:06:14 BoogieIcfgContainer [2025-02-06 03:06:14,898 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:06:14,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:06:14,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:06:14,906 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:06:14,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:06:14" (1/3) ... [2025-02-06 03:06:14,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d21c0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:06:14, skipping insertion in model container [2025-02-06 03:06:14,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:14" (2/3) ... [2025-02-06 03:06:14,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d21c0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:06:14, skipping insertion in model container [2025-02-06 03:06:14,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:06:14" (3/3) ... [2025-02-06 03:06:14,910 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-63.i [2025-02-06 03:06:14,920 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:06:14,922 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-63.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:06:14,964 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:06:14,973 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;@787ac753, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:06:14,973 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:06:14,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:06:14,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 03:06:14,984 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:06:14,984 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:06:14,985 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:06:14,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:06:14,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1753202672, now seen corresponding path program 1 times [2025-02-06 03:06:14,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:06:14,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895405652] [2025-02-06 03:06:14,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:06:14,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:06:15,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 03:06:15,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 03:06:15,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:06:15,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:06:15,215 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 03:06:15,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:06:15,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895405652] [2025-02-06 03:06:15,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895405652] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:06:15,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177725706] [2025-02-06 03:06:15,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:06:15,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:06:15,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:06:15,220 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-06 03:06:15,223 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-06 03:06:15,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 03:06:15,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 03:06:15,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:06:15,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:06:15,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:06:15,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:06:15,378 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 03:06:15,379 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:06:15,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177725706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:06:15,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:06:15,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:06:15,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806652822] [2025-02-06 03:06:15,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:06:15,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:06:15,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:06:15,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:06:15,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:06:15,404 INFO L87 Difference]: Start difference. First operand has 51 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:06:15,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:06:15,429 INFO L93 Difference]: Finished difference Result 96 states and 159 transitions. [2025-02-06 03:06:15,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:06:15,431 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 114 [2025-02-06 03:06:15,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:06:15,436 INFO L225 Difference]: With dead ends: 96 [2025-02-06 03:06:15,437 INFO L226 Difference]: Without dead ends: 48 [2025-02-06 03:06:15,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:06:15,444 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:06:15,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:06:15,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-06 03:06:15,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-06 03:06:15,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:06:15,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2025-02-06 03:06:15,502 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 114 [2025-02-06 03:06:15,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:06:15,503 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2025-02-06 03:06:15,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:06:15,503 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2025-02-06 03:06:15,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 03:06:15,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:06:15,509 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:06:15,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:06:15,713 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,SelfDestructingSolverStorable0 [2025-02-06 03:06:15,713 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:06:15,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:06:15,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1283058830, now seen corresponding path program 1 times [2025-02-06 03:06:15,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:06:15,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757841536] [2025-02-06 03:06:15,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:06:15,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:06:15,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 03:06:15,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 03:06:15,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:06:15,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:06:16,279 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:06:16,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:06:16,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757841536] [2025-02-06 03:06:16,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757841536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:06:16,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:06:16,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:06:16,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993996298] [2025-02-06 03:06:16,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:06:16,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:06:16,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:06:16,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:06:16,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:06:16,281 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:06:16,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:06:16,464 INFO L93 Difference]: Finished difference Result 97 states and 136 transitions. [2025-02-06 03:06:16,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:06:16,465 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 114 [2025-02-06 03:06:16,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:06:16,466 INFO L225 Difference]: With dead ends: 97 [2025-02-06 03:06:16,466 INFO L226 Difference]: Without dead ends: 52 [2025-02-06 03:06:16,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:06:16,467 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 95 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:06:16,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 96 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:06:16,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-06 03:06:16,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-02-06 03:06:16,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:06:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2025-02-06 03:06:16,476 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 70 transitions. Word has length 114 [2025-02-06 03:06:16,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:06:16,477 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 70 transitions. [2025-02-06 03:06:16,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:06:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 70 transitions. [2025-02-06 03:06:16,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 03:06:16,478 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:06:16,478 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:06:16,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:06:16,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:06:16,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:06:16,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1254429679, now seen corresponding path program 1 times [2025-02-06 03:06:16,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:06:16,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806142237] [2025-02-06 03:06:16,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:06:16,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:06:16,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 03:06:16,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 03:06:16,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:06:16,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:06:16,561 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:06:16,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 03:06:16,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 03:06:16,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:06:16,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:06:16,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:06:16,661 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:06:16,662 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:06:16,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:06:16,666 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 03:06:16,731 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:06:16,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:06:16 BoogieIcfgContainer [2025-02-06 03:06:16,735 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:06:16,735 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:06:16,735 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:06:16,736 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:06:16,736 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:06:14" (3/4) ... [2025-02-06 03:06:16,738 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:06:16,739 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:06:16,739 INFO L158 Benchmark]: Toolchain (without parser) took 2385.52ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 65.4MB in the end (delta: 45.0MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. [2025-02-06 03:06:16,740 INFO L158 Benchmark]: CDTParser took 1.00ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:06:16,740 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.52ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 97.0MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:06:16,740 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.37ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 96.1MB in the end (delta: 943.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:06:16,740 INFO L158 Benchmark]: Boogie Preprocessor took 28.85ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 93.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:06:16,740 INFO L158 Benchmark]: IcfgBuilder took 283.01ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 77.4MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:06:16,740 INFO L158 Benchmark]: TraceAbstraction took 1831.77ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 65.4MB in the end (delta: 12.0MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2025-02-06 03:06:16,745 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 142.6MB. Free memory was 65.4MB in the beginning and 65.4MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:06:16,746 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.00ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.52ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 97.0MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.37ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 96.1MB in the end (delta: 943.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.85ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 93.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 283.01ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 77.4MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1831.77ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 65.4MB in the end (delta: 12.0MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 142.6MB. Free memory was 65.4MB in the beginning and 65.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: 19]: 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 someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 48, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 55, overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 65. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] float var_1_2 = 8.3; [L24] float var_1_3 = 2.25; [L25] float var_1_4 = 10.3; [L26] unsigned char var_1_6 = 0; [L27] signed long int var_1_7 = 128; [L28] float var_1_8 = 9.8; [L29] unsigned long int var_1_13 = 1; [L30] unsigned long int var_1_14 = 32; [L31] signed char var_1_15 = -10; [L32] signed char var_1_16 = 16; [L33] signed char var_1_17 = 25; [L34] signed char var_1_18 = 1; [L35] signed char var_1_19 = 0; [L36] signed char var_1_20 = 32; [L37] signed short int var_1_21 = 256; [L38] signed char var_1_22 = 16; [L39] unsigned char var_1_23 = 0; [L40] signed short int last_1_var_1_21 = 256; VAL [isInitial=0, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_2=83/10, var_1_3=9/4, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] CALL updateLastVariables() [L93] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_2=83/10, var_1_3=9/4, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L103] RET updateLastVariables() [L104] CALL updateVariables() [L62] var_1_2 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_3=9/4, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_3=9/4, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L63] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_3=9/4, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L64] var_1_3 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L65] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L66] var_1_4 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128, var_1_8=49/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128, var_1_8=49/5] [L67] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128, var_1_8=49/5] [L68] var_1_6 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_7=128, var_1_8=49/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_7=128, var_1_8=49/5] [L69] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_7=128, var_1_8=49/5] [L70] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128, var_1_8=49/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128, var_1_8=49/5] [L70] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128, var_1_8=49/5] [L71] var_1_8 = __VERIFIER_nondet_float() [L72] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L72] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L73] var_1_14 = __VERIFIER_nondet_ulong() [L74] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L74] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L75] CALL assume_abort_if_not(var_1_14 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L75] RET assume_abort_if_not(var_1_14 <= 4294967294) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L76] var_1_16 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L77] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L78] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L78] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L79] var_1_17 = __VERIFIER_nondet_char() [L80] CALL assume_abort_if_not(var_1_17 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L80] RET assume_abort_if_not(var_1_17 >= -1) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L81] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L81] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L82] var_1_18 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L83] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L84] CALL assume_abort_if_not(var_1_18 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L84] RET assume_abort_if_not(var_1_18 <= 31) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L85] var_1_19 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L86] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L87] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L87] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L88] var_1_20 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L89] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L90] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L90] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128] [L104] RET updateVariables() [L105] CALL step() [L44] var_1_13 = var_1_14 [L45] var_1_21 = last_1_var_1_21 [L46] var_1_22 = var_1_16 [L47] var_1_23 = var_1_6 VAL [isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=21, var_1_23=0, var_1_6=0, var_1_7=128] [L48] COND TRUE ((((1.1f) < (var_1_2)) ? (1.1f) : (var_1_2))) > (var_1_3 * var_1_4) [L49] var_1_1 = (var_1_23 && var_1_6) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=21, var_1_23=0, var_1_6=0, var_1_7=128] [L51] signed char stepLocal_0 = var_1_22; VAL [isInitial=1, last_1_var_1_21=256, stepLocal_0=21, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=21, var_1_23=0, var_1_6=0, var_1_7=128] [L52] COND FALSE !(stepLocal_0 != ((((var_1_22) < (var_1_21)) ? (var_1_22) : (var_1_21)))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=21, var_1_23=0, var_1_6=0, var_1_7=128] [L55] COND TRUE var_1_4 <= (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) * var_1_8) [L56] var_1_7 = (((((((((var_1_22 + var_1_15)) > (var_1_15)) ? ((var_1_22 + var_1_15)) : (var_1_15)))) > (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) ? ((((((var_1_22 + var_1_15)) > (var_1_15)) ? ((var_1_22 + var_1_15)) : (var_1_15)))) : (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=21, var_1_23=0, var_1_6=0, var_1_7=11] [L105] RET step() [L106] CALL, EXPR property() [L96-L97] return (((((((((((1.1f) < (var_1_2)) ? (1.1f) : (var_1_2))) > (var_1_3 * var_1_4)) ? (var_1_1 == ((unsigned char) (var_1_23 && var_1_6))) : 1) && ((var_1_4 <= (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) * var_1_8)) ? (var_1_7 == ((signed long int) (((((((((var_1_22 + var_1_15)) > (var_1_15)) ? ((var_1_22 + var_1_15)) : (var_1_15)))) > (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) ? ((((((var_1_22 + var_1_15)) > (var_1_15)) ? ((var_1_22 + var_1_15)) : (var_1_15)))) : (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))))))) : (var_1_7 == ((signed long int) var_1_22)))) && (var_1_13 == ((unsigned long int) var_1_14))) && ((var_1_22 != ((((var_1_22) < (var_1_21)) ? (var_1_22) : (var_1_21)))) ? (var_1_15 == ((signed char) ((((((10 + var_1_16)) < (var_1_17)) ? ((10 + var_1_16)) : (var_1_17))) - ((32 - var_1_18) + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20))))))) : 1)) && (var_1_21 == ((signed short int) last_1_var_1_21))) && (var_1_22 == ((signed char) var_1_16))) && (var_1_23 == ((unsigned char) var_1_6)) ; VAL [\result=0, isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=21, var_1_23=0, var_1_6=0, var_1_7=11] [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=21, var_1_23=0, var_1_6=0, var_1_7=11] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=21, var_1_23=0, var_1_6=0, var_1_7=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 95 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 164 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 69 IncrementalHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 129 mSDtfsCounter, 69 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 339 ConstructedInterpolants, 0 QuantifiedInterpolants, 451 SizeOfPredicates, 0 NumberOfNonLiveVariables, 276 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1802/1836 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-06 03:06:16,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-63.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash e14c549015d0f5635e62f75071e62e4bb462bdcfc99319d92dbe4063b5fd473b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:06:18,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:06:18,953 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:06:18,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:06:18,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:06:18,983 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:06:18,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:06:18,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:06:18,985 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:06:18,985 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:06:18,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:06:18,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:06:18,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:06:18,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:06:18,986 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:06:18,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:06:18,987 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:06:18,987 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:06:18,987 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:06:18,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:06:18,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:06:18,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:06:18,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:06:18,988 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:06:18,988 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:06:18,988 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:06:18,988 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:06:18,988 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:06:18,988 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:06:18,988 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:06:18,988 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:06:18,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:06:18,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:06:18,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:06:18,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:06:18,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:06:18,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:06:18,989 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:06:18,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:06:18,990 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:06:18,990 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:06:18,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:06:18,990 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:06:18,990 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:06:18,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:06:18,990 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e14c549015d0f5635e62f75071e62e4bb462bdcfc99319d92dbe4063b5fd473b [2025-02-06 03:06:19,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:06:19,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:06:19,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:06:19,277 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:06:19,279 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:06:19,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-63.i [2025-02-06 03:06:20,605 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0aa497ab2/6bc3a2184b3342b19423a56dda80654d/FLAGebfbdd750 [2025-02-06 03:06:20,836 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:06:20,837 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-63.i [2025-02-06 03:06:20,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0aa497ab2/6bc3a2184b3342b19423a56dda80654d/FLAGebfbdd750 [2025-02-06 03:06:20,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0aa497ab2/6bc3a2184b3342b19423a56dda80654d [2025-02-06 03:06:20,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:06:20,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:06:20,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:06:20,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:06:20,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:06:20,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:06:20" (1/1) ... [2025-02-06 03:06:20,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@671c484b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:20, skipping insertion in model container [2025-02-06 03:06:20,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:06:20" (1/1) ... [2025-02-06 03:06:20,880 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:06:20,974 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/hardness-nfm22/hardness_variablewrapping_normal_file-63.i[913,926] [2025-02-06 03:06:21,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:06:21,025 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:06:21,035 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/hardness-nfm22/hardness_variablewrapping_normal_file-63.i[913,926] [2025-02-06 03:06:21,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:06:21,082 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:06:21,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:21 WrapperNode [2025-02-06 03:06:21,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:06:21,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:06:21,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:06:21,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:06:21,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:21" (1/1) ... [2025-02-06 03:06:21,100 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:21" (1/1) ... [2025-02-06 03:06:21,122 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2025-02-06 03:06:21,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:06:21,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:06:21,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:06:21,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:06:21,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:21" (1/1) ... [2025-02-06 03:06:21,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:21" (1/1) ... [2025-02-06 03:06:21,137 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:21" (1/1) ... [2025-02-06 03:06:21,150 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 03:06:21,152 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:21" (1/1) ... [2025-02-06 03:06:21,152 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:21" (1/1) ... [2025-02-06 03:06:21,157 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:21" (1/1) ... [2025-02-06 03:06:21,158 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:21" (1/1) ... [2025-02-06 03:06:21,159 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:21" (1/1) ... [2025-02-06 03:06:21,159 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:21" (1/1) ... [2025-02-06 03:06:21,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:06:21,162 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:06:21,162 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:06:21,162 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:06:21,162 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:21" (1/1) ... [2025-02-06 03:06:21,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:06:21,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:06:21,189 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-06 03:06:21,194 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-06 03:06:21,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:06:21,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:06:21,207 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:06:21,207 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:06:21,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:06:21,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:06:21,265 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:06:21,266 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:06:22,824 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-02-06 03:06:22,824 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:06:22,830 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:06:22,830 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:06:22,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:06:22 BoogieIcfgContainer [2025-02-06 03:06:22,831 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:06:22,832 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:06:22,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:06:22,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:06:22,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:06:20" (1/3) ... [2025-02-06 03:06:22,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@542bee22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:06:22, skipping insertion in model container [2025-02-06 03:06:22,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:06:21" (2/3) ... [2025-02-06 03:06:22,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@542bee22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:06:22, skipping insertion in model container [2025-02-06 03:06:22,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:06:22" (3/3) ... [2025-02-06 03:06:22,837 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-63.i [2025-02-06 03:06:22,846 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:06:22,847 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-63.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:06:22,878 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:06:22,889 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;@61dc4462, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:06:22,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:06:22,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:06:22,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 03:06:22,898 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:06:22,898 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:06:22,898 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:06:22,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:06:22,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1753202672, now seen corresponding path program 1 times [2025-02-06 03:06:22,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:06:22,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532269679] [2025-02-06 03:06:22,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:06:22,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:06:22,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:06:22,911 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:06:22,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 03:06:22,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 03:06:23,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 03:06:23,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:06:23,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:06:23,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:06:23,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:06:23,206 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-02-06 03:06:23,206 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:06:23,206 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:06:23,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532269679] [2025-02-06 03:06:23,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532269679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:06:23,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:06:23,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:06:23,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874107215] [2025-02-06 03:06:23,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:06:23,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:06:23,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:06:23,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:06:23,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:06:23,252 INFO L87 Difference]: Start difference. First operand has 51 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:06:23,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:06:23,266 INFO L93 Difference]: Finished difference Result 96 states and 159 transitions. [2025-02-06 03:06:23,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:06:23,268 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 114 [2025-02-06 03:06:23,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:06:23,272 INFO L225 Difference]: With dead ends: 96 [2025-02-06 03:06:23,272 INFO L226 Difference]: Without dead ends: 48 [2025-02-06 03:06:23,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:06:23,275 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:06:23,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:06:23,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-06 03:06:23,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-06 03:06:23,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:06:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2025-02-06 03:06:23,302 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 114 [2025-02-06 03:06:23,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:06:23,302 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2025-02-06 03:06:23,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:06:23,302 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2025-02-06 03:06:23,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 03:06:23,304 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:06:23,304 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:06:23,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 03:06:23,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:06:23,510 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:06:23,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:06:23,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1283058830, now seen corresponding path program 1 times [2025-02-06 03:06:23,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:06:23,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276229215] [2025-02-06 03:06:23,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:06:23,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:06:23,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:06:23,515 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:06:23,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 03:06:23,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 03:06:23,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 03:06:23,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:06:23,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:06:23,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 03:06:23,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:06:24,248 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 321 proven. 27 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:06:24,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:06:24,510 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:06:24,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276229215] [2025-02-06 03:06:24,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276229215] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:06:24,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1940682108] [2025-02-06 03:06:24,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:06:24,511 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:06:24,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:06:24,513 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:06:24,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-02-06 03:06:24,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 03:06:25,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 03:06:25,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:06:25,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:06:25,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 03:06:25,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:06:57,982 WARN L286 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 03:07:03,632 WARN L286 SmtUtils]: Spent 5.65s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)