./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-37.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-37.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 705f1434cf57fe07ebfc06c0b1211b5e86887658700ddfe642f1846035ec4c01 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:02:50,640 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:02:50,700 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:02:50,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:02:50,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:02:50,720 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:02:50,722 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:02:50,722 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:02:50,723 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:02:50,723 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:02:50,723 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:02:50,724 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:02:50,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:02:50,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:02:50,724 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:02:50,724 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:02:50,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:02:50,724 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:02:50,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:02:50,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:02:50,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:02:50,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:02:50,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:02:50,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:02:50,725 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:02:50,725 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:02:50,725 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:02:50,725 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:02:50,725 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:02:50,725 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:02:50,726 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:02:50,726 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:02:50,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:02:50,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:02:50,726 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:02:50,726 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:02:50,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:02:50,727 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:02:50,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:02:50,727 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:02:50,727 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:02:50,727 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:02:50,727 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:02:50,727 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 -> 705f1434cf57fe07ebfc06c0b1211b5e86887658700ddfe642f1846035ec4c01 [2025-02-06 03:02:50,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:02:50,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:02:50,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:02:50,952 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:02:50,952 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:02:50,952 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-37.i [2025-02-06 03:02:52,050 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0dab3b5d5/a9ac82c65a864955972c04e89af43545/FLAG5444e72d2 [2025-02-06 03:02:52,290 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:02:52,291 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-37.i [2025-02-06 03:02:52,299 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0dab3b5d5/a9ac82c65a864955972c04e89af43545/FLAG5444e72d2 [2025-02-06 03:02:52,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0dab3b5d5/a9ac82c65a864955972c04e89af43545 [2025-02-06 03:02:52,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:02:52,613 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:02:52,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:02:52,614 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:02:52,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:02:52,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:02:52" (1/1) ... [2025-02-06 03:02:52,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b0df458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:52, skipping insertion in model container [2025-02-06 03:02:52,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:02:52" (1/1) ... [2025-02-06 03:02:52,628 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:02:52,738 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-37.i[913,926] [2025-02-06 03:02:52,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:02:52,769 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:02:52,776 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-37.i[913,926] [2025-02-06 03:02:52,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:02:52,796 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:02:52,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:52 WrapperNode [2025-02-06 03:02:52,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:02:52,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:02:52,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:02:52,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:02:52,802 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:02:52" (1/1) ... [2025-02-06 03:02:52,807 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:02:52" (1/1) ... [2025-02-06 03:02:52,825 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2025-02-06 03:02:52,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:02:52,826 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:02:52,826 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:02:52,826 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:02:52,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:52" (1/1) ... [2025-02-06 03:02:52,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:52" (1/1) ... [2025-02-06 03:02:52,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:52" (1/1) ... [2025-02-06 03:02:52,853 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:02:52,854 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:52" (1/1) ... [2025-02-06 03:02:52,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:52" (1/1) ... [2025-02-06 03:02:52,857 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:52" (1/1) ... [2025-02-06 03:02:52,858 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:52" (1/1) ... [2025-02-06 03:02:52,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:52" (1/1) ... [2025-02-06 03:02:52,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:52" (1/1) ... [2025-02-06 03:02:52,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:02:52,862 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:02:52,862 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:02:52,862 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:02:52,862 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:52" (1/1) ... [2025-02-06 03:02:52,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:02:52,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:02:52,891 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:02:52,894 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:02:52,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:02:52,909 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:02:52,909 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:02:52,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:02:52,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:02:52,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:02:52,955 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:02:52,956 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:02:53,160 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L90: havoc property_#t~bitwise13#1; [2025-02-06 03:02:53,194 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-06 03:02:53,194 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:02:53,226 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:02:53,227 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:02:53,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:02:53 BoogieIcfgContainer [2025-02-06 03:02:53,227 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:02:53,229 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:02:53,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:02:53,236 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:02:53,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:02:52" (1/3) ... [2025-02-06 03:02:53,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fed683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:02:53, skipping insertion in model container [2025-02-06 03:02:53,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:52" (2/3) ... [2025-02-06 03:02:53,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fed683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:02:53, skipping insertion in model container [2025-02-06 03:02:53,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:02:53" (3/3) ... [2025-02-06 03:02:53,240 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-37.i [2025-02-06 03:02:53,252 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:02:53,253 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-37.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:02:53,296 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:02:53,305 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;@4a95d835, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:02:53,306 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:02:53,310 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:02:53,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 03:02:53,318 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:02:53,318 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:53,318 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:02:53,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:02:53,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1557407416, now seen corresponding path program 1 times [2025-02-06 03:02:53,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:02:53,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329352230] [2025-02-06 03:02:53,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:02:53,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:02:53,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:02:53,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:02:53,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:02:53,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:02:53,533 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-02-06 03:02:53,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:02:53,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329352230] [2025-02-06 03:02:53,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329352230] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:02:53,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737886526] [2025-02-06 03:02:53,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:02:53,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:02:53,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:02:53,538 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:02:53,540 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:02:53,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:02:53,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:02:53,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:02:53,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:02:53,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:02:53,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:02:53,671 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-02-06 03:02:53,671 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:02:53,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737886526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:02:53,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:02:53,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:02:53,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634400093] [2025-02-06 03:02:53,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:02:53,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:02:53,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:02:53,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:02:53,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:02:53,688 INFO L87 Difference]: Start difference. First operand has 56 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:02:53,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:02:53,725 INFO L93 Difference]: Finished difference Result 106 states and 174 transitions. [2025-02-06 03:02:53,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:02:53,726 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2025-02-06 03:02:53,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:02:53,730 INFO L225 Difference]: With dead ends: 106 [2025-02-06 03:02:53,730 INFO L226 Difference]: Without dead ends: 53 [2025-02-06 03:02:53,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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:02:53,734 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:02:53,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:02:53,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-06 03:02:53,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-02-06 03:02:53,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:02:53,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 77 transitions. [2025-02-06 03:02:53,759 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 77 transitions. Word has length 100 [2025-02-06 03:02:53,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:02:53,759 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 77 transitions. [2025-02-06 03:02:53,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:02:53,760 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2025-02-06 03:02:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 03:02:53,762 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:02:53,762 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:53,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 03:02:53,967 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:02:53,967 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:02:53,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:02:53,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1619120489, now seen corresponding path program 1 times [2025-02-06 03:02:53,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:02:53,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918645550] [2025-02-06 03:02:53,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:02:53,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:02:53,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:02:54,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:02:54,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:02:54,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:02:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:02:54,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:02:54,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918645550] [2025-02-06 03:02:54,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918645550] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:02:54,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101429948] [2025-02-06 03:02:54,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:02:54,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:02:54,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:02:54,656 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:02:54,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:02:54,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:02:54,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:02:54,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:02:54,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:02:54,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 03:02:54,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:02:55,189 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 235 proven. 60 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2025-02-06 03:02:55,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:02:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-02-06 03:02:55,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101429948] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:02:55,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:02:55,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 20 [2025-02-06 03:02:55,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323033595] [2025-02-06 03:02:55,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:02:55,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 03:02:55,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:02:55,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 03:02:55,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:02:55,549 INFO L87 Difference]: Start difference. First operand 53 states and 77 transitions. Second operand has 20 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 20 states have internal predecessors, (65), 8 states have call successors, (43), 4 states have call predecessors, (43), 8 states have return successors, (44), 7 states have call predecessors, (44), 8 states have call successors, (44) [2025-02-06 03:02:55,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:02:55,916 INFO L93 Difference]: Finished difference Result 119 states and 164 transitions. [2025-02-06 03:02:55,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 03:02:55,917 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 20 states have internal predecessors, (65), 8 states have call successors, (43), 4 states have call predecessors, (43), 8 states have return successors, (44), 7 states have call predecessors, (44), 8 states have call successors, (44) Word has length 100 [2025-02-06 03:02:55,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:02:55,918 INFO L225 Difference]: With dead ends: 119 [2025-02-06 03:02:55,918 INFO L226 Difference]: Without dead ends: 69 [2025-02-06 03:02:55,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=274, Invalid=656, Unknown=0, NotChecked=0, Total=930 [2025-02-06 03:02:55,920 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 114 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:02:55,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 178 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:02:55,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-06 03:02:55,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2025-02-06 03:02:55,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 45 states have internal predecessors, (55), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:02:55,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 85 transitions. [2025-02-06 03:02:55,928 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 85 transitions. Word has length 100 [2025-02-06 03:02:55,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:02:55,928 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 85 transitions. [2025-02-06 03:02:55,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 20 states have internal predecessors, (65), 8 states have call successors, (43), 4 states have call predecessors, (43), 8 states have return successors, (44), 7 states have call predecessors, (44), 8 states have call successors, (44) [2025-02-06 03:02:55,929 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2025-02-06 03:02:55,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 03:02:55,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:02:55,930 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:55,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 03:02:56,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:02:56,134 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:02:56,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:02:56,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1748203208, now seen corresponding path program 1 times [2025-02-06 03:02:56,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:02:56,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702050484] [2025-02-06 03:02:56,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:02:56,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:02:56,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:02:56,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:02:56,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:02:56,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:02:56,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [89451930] [2025-02-06 03:02:56,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:02:56,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:02:56,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:02:56,195 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:02:56,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 03:02:56,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:02:56,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:02:56,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:02:56,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:02:56,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 03:02:56,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:02:56,641 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 228 proven. 42 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-02-06 03:02:56,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:02:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-02-06 03:02:56,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:02:56,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702050484] [2025-02-06 03:02:56,997 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:02:56,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89451930] [2025-02-06 03:02:56,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89451930] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:02:56,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:02:56,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2025-02-06 03:02:56,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361390106] [2025-02-06 03:02:56,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:02:56,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 03:02:56,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:02:56,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 03:02:56,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:02:56,999 INFO L87 Difference]: Start difference. First operand 65 states and 85 transitions. Second operand has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 5 states have call successors, (23), 3 states have call predecessors, (23), 6 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) [2025-02-06 03:02:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:02:57,735 INFO L93 Difference]: Finished difference Result 187 states and 237 transitions. [2025-02-06 03:02:57,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 03:02:57,735 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 5 states have call successors, (23), 3 states have call predecessors, (23), 6 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) Word has length 100 [2025-02-06 03:02:57,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:02:57,738 INFO L225 Difference]: With dead ends: 187 [2025-02-06 03:02:57,738 INFO L226 Difference]: Without dead ends: 125 [2025-02-06 03:02:57,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=372, Invalid=1034, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 03:02:57,741 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 215 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:02:57,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 326 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:02:57,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-06 03:02:57,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 70. [2025-02-06 03:02:57,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:02:57,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2025-02-06 03:02:57,764 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 100 [2025-02-06 03:02:57,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:02:57,764 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2025-02-06 03:02:57,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 5 states have call successors, (23), 3 states have call predecessors, (23), 6 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) [2025-02-06 03:02:57,765 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2025-02-06 03:02:57,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 03:02:57,767 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:02:57,767 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:57,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 03:02:57,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:02:57,968 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:02:57,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:02:57,969 INFO L85 PathProgramCache]: Analyzing trace with hash -59251255, now seen corresponding path program 1 times [2025-02-06 03:02:57,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:02:57,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368655126] [2025-02-06 03:02:57,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:02:57,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:02:57,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:02:58,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:02:58,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:02:58,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:02:58,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1810102698] [2025-02-06 03:02:58,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:02:58,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:02:58,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:02:58,072 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:02:58,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 03:02:58,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:02:58,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:02:58,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:02:58,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:02:58,195 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:02:58,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:02:58,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:02:58,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:02:58,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:02:58,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:02:58,254 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:02:58,254 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:02:58,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 03:02:58,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:02:58,459 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 03:02:58,507 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:02:58,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:02:58 BoogieIcfgContainer [2025-02-06 03:02:58,510 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:02:58,510 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:02:58,510 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:02:58,511 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:02:58,511 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:02:53" (3/4) ... [2025-02-06 03:02:58,512 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:02:58,513 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:02:58,514 INFO L158 Benchmark]: Toolchain (without parser) took 5901.12ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 106.2MB in the beginning and 92.2MB in the end (delta: 13.9MB). Peak memory consumption was 152.9MB. Max. memory is 16.1GB. [2025-02-06 03:02:58,514 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 113.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:02:58,514 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.95ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 93.8MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:02:58,514 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.98ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 90.9MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:02:58,514 INFO L158 Benchmark]: Boogie Preprocessor took 34.96ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 89.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:02:58,515 INFO L158 Benchmark]: IcfgBuilder took 365.61ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 67.7MB in the end (delta: 21.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:02:58,515 INFO L158 Benchmark]: TraceAbstraction took 5280.55ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 67.7MB in the beginning and 92.3MB in the end (delta: -24.5MB). Peak memory consumption was 119.3MB. Max. memory is 16.1GB. [2025-02-06 03:02:58,515 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 285.2MB. Free memory was 92.3MB in the beginning and 92.2MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:02:58,516 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 113.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.95ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 93.8MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.98ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 90.9MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.96ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 89.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 365.61ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 67.7MB in the end (delta: 21.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5280.55ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 67.7MB in the beginning and 92.3MB in the end (delta: -24.5MB). Peak memory consumption was 119.3MB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 285.2MB. Free memory was 92.3MB in the beginning and 92.2MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 54, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 8; [L23] unsigned short int var_1_2 = 59049; [L24] unsigned short int var_1_3 = 100; [L25] unsigned char var_1_6 = 16; [L26] signed char var_1_7 = -25; [L27] signed char var_1_8 = 16; [L28] signed char var_1_9 = 25; [L29] signed char var_1_10 = -10; [L30] signed char var_1_11 = 0; [L31] float var_1_12 = 25.1; [L32] unsigned long int var_1_13 = 2531521428; [L33] signed long int var_1_14 = -128; [L34] signed long int var_1_15 = 256; [L35] signed short int var_1_16 = -16; VAL [isInitial=0, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=59049, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L63] var_1_2 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L64] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L65] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L65] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L66] var_1_3 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L67] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L68] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L68] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_7=-25, var_1_8=16, var_1_9=25] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_7=-25, var_1_8=16, var_1_9=25] [L71] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=16, var_1_9=25] [L71] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=16, var_1_9=25] [L72] var_1_8 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=25] [L73] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=25] [L74] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=25] [L74] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=25] [L75] var_1_9 = __VERIFIER_nondet_char() [L76] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L76] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_9 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L77] RET assume_abort_if_not(var_1_9 <= 31) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L78] var_1_10 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_10 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L79] RET assume_abort_if_not(var_1_10 >= -63) VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L80] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L81] var_1_12 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L82] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L83] var_1_13 = __VERIFIER_nondet_ulong() [L84] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_13=2147483647, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_13=2147483647, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L84] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=2147483647, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_13 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_13=2147483647, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_13=2147483647, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L85] RET assume_abort_if_not(var_1_13 <= 4294967295) VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=2147483647, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L98] RET updateVariables() [L99] CALL step() [L39] var_1_14 = var_1_8 [L40] var_1_16 = var_1_14 [L41] signed long int stepLocal_0 = (((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)); VAL [isInitial=1, stepLocal_0=63, var_1_10=6, var_1_11=0, var_1_13=2147483647, var_1_14=63, var_1_15=256, var_1_16=63, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L42] COND FALSE !(var_1_2 <= stepLocal_0) [L45] var_1_7 = var_1_10 VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=2147483647, var_1_14=63, var_1_15=256, var_1_16=63, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L47] var_1_15 = var_1_16 VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=2147483647, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L48] EXPR (var_1_2 - var_1_3) ^ (var_1_15 * var_1_16) VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=2147483647, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=8, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L48] COND FALSE !(((var_1_2 - var_1_3) ^ (var_1_15 * var_1_16)) <= -64) [L51] var_1_1 = var_1_6 VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=2147483647, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=0, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L53] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, stepLocal_1=0, var_1_10=6, var_1_11=0, var_1_13=2147483647, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=0, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L54] COND TRUE 2.75f > var_1_12 [L55] var_1_11 = (var_1_10 + var_1_8) VAL [isInitial=1, stepLocal_1=0, var_1_10=6, var_1_11=69, var_1_13=2147483647, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=0, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR (var_1_2 - var_1_3) ^ (var_1_15 * var_1_16) VAL [isInitial=1, var_1_10=6, var_1_11=69, var_1_13=2147483647, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=0, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L90-L91] return ((((((((var_1_2 - var_1_3) ^ (var_1_15 * var_1_16)) <= -64) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_2 <= ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) ? (var_1_7 == ((signed char) ((var_1_8 - (1 + var_1_9)) + var_1_10))) : (var_1_7 == ((signed char) var_1_10)))) && ((2.75f > var_1_12) ? (var_1_11 == ((signed char) (var_1_10 + var_1_8))) : (((var_1_13 - ((((var_1_14) > (var_1_8)) ? (var_1_14) : (var_1_8)))) > var_1_1) ? (var_1_11 == ((signed char) ((((((((var_1_8) < ((1 + 5))) ? (var_1_8) : ((1 + 5))))) < (var_1_10)) ? (((((var_1_8) < ((1 + 5))) ? (var_1_8) : ((1 + 5))))) : (var_1_10))))) : 1))) && (var_1_14 == ((signed long int) var_1_8))) && (var_1_15 == ((signed long int) var_1_16))) && (var_1_16 == ((signed short int) var_1_14)) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=6, var_1_11=69, var_1_13=2147483647, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=0, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=6, var_1_11=69, var_1_13=2147483647, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=0, var_1_2=32767, var_1_3=-32769, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 4, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 337 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 329 mSDsluCounter, 579 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 389 mSDsCounter, 128 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 833 IncrementalHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 128 mSolverCounterUnsat, 190 mSDtfsCounter, 833 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 537 GetRequests, 471 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=3, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 59 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 800 NumberOfCodeBlocks, 800 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 693 ConstructedInterpolants, 1 QuantifiedInterpolants, 2476 SizeOfPredicates, 7 NumberOfNonLiveVariables, 726 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 2660/2940 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:02:58,538 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-37.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 705f1434cf57fe07ebfc06c0b1211b5e86887658700ddfe642f1846035ec4c01 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:03:00,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:03:00,641 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:03:00,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:03:00,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:03:00,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:03:00,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:03:00,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:03:00,672 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:03:00,672 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:03:00,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:03:00,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:03:00,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:03:00,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:03:00,673 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:03:00,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:03:00,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:03:00,674 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:03:00,674 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:03:00,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:03:00,674 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:03:00,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:03:00,674 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:03:00,674 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:03:00,675 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:03:00,675 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:03:00,675 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:03:00,675 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:03:00,675 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:03:00,675 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:03:00,675 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:03:00,676 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:03:00,676 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:03:00,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:03:00,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:03:00,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:03:00,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:03:00,676 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:03:00,676 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:03:00,676 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:03:00,676 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:03:00,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:03:00,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:03:00,677 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:03:00,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:03:00,677 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 -> 705f1434cf57fe07ebfc06c0b1211b5e86887658700ddfe642f1846035ec4c01 [2025-02-06 03:03:00,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:03:00,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:03:00,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:03:00,939 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:03:00,939 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:03:00,941 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-37.i [2025-02-06 03:03:02,125 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc466e5a2/61eeb16305144fd49c4a2b00e68d1ccf/FLAG4acb9a050 [2025-02-06 03:03:02,340 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:03:02,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-37.i [2025-02-06 03:03:02,346 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc466e5a2/61eeb16305144fd49c4a2b00e68d1ccf/FLAG4acb9a050 [2025-02-06 03:03:02,361 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc466e5a2/61eeb16305144fd49c4a2b00e68d1ccf [2025-02-06 03:03:02,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:03:02,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:03:02,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:03:02,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:03:02,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:03:02,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:03:02" (1/1) ... [2025-02-06 03:03:02,371 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e59717c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:02, skipping insertion in model container [2025-02-06 03:03:02,372 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:03:02" (1/1) ... [2025-02-06 03:03:02,384 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:03:02,487 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-37.i[913,926] [2025-02-06 03:03:02,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:03:02,539 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:03:02,547 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-37.i[913,926] [2025-02-06 03:03:02,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:03:02,592 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:03:02,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:02 WrapperNode [2025-02-06 03:03:02,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:03:02,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:03:02,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:03:02,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:03:02,599 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:03:02" (1/1) ... [2025-02-06 03:03:02,611 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:03:02" (1/1) ... [2025-02-06 03:03:02,626 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2025-02-06 03:03:02,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:03:02,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:03:02,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:03:02,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:03:02,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:02" (1/1) ... [2025-02-06 03:03:02,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:02" (1/1) ... [2025-02-06 03:03:02,637 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:02" (1/1) ... [2025-02-06 03:03:02,648 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:03:02,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:02" (1/1) ... [2025-02-06 03:03:02,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:02" (1/1) ... [2025-02-06 03:03:02,654 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:02" (1/1) ... [2025-02-06 03:03:02,659 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:02" (1/1) ... [2025-02-06 03:03:02,660 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:02" (1/1) ... [2025-02-06 03:03:02,660 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:02" (1/1) ... [2025-02-06 03:03:02,662 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:03:02,666 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:03:02,666 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:03:02,666 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:03:02,667 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:02" (1/1) ... [2025-02-06 03:03:02,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:03:02,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:03:02,693 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:03:02,700 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:03:02,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:03:02,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:03:02,718 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:03:02,718 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:03:02,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:03:02,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:03:02,777 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:03:02,779 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:03:02,946 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-06 03:03:02,946 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:03:02,952 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:03:02,952 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:03:02,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:03:02 BoogieIcfgContainer [2025-02-06 03:03:02,953 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:03:02,955 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:03:02,955 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:03:02,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:03:02,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:03:02" (1/3) ... [2025-02-06 03:03:02,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a2ff7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:03:02, skipping insertion in model container [2025-02-06 03:03:02,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:02" (2/3) ... [2025-02-06 03:03:02,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a2ff7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:03:02, skipping insertion in model container [2025-02-06 03:03:02,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:03:02" (3/3) ... [2025-02-06 03:03:02,959 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-37.i [2025-02-06 03:03:02,969 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:03:02,970 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-37.i that has 2 procedures, 47 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:03:03,017 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:03:03,028 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;@7bcf5554, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:03:03,028 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:03:03,031 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 30 states have internal predecessors, (37), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:03:03,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 03:03:03,052 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:03:03,052 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:03,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:03:03,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:03:03,056 INFO L85 PathProgramCache]: Analyzing trace with hash 292826576, now seen corresponding path program 1 times [2025-02-06 03:03:03,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:03:03,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887381515] [2025-02-06 03:03:03,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:03:03,064 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:03:03,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:03:03,068 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:03:03,069 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:03:03,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 03:03:03,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 03:03:03,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:03:03,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:03:03,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:03:03,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:03:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-02-06 03:03:03,265 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:03:03,266 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:03:03,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1887381515] [2025-02-06 03:03:03,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1887381515] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:03:03,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:03:03,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:03:03,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421656920] [2025-02-06 03:03:03,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:03:03,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:03:03,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:03:03,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:03:03,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:03:03,285 INFO L87 Difference]: Start difference. First operand has 47 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 30 states have internal predecessors, (37), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:03:03,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:03:03,303 INFO L93 Difference]: Finished difference Result 88 states and 144 transitions. [2025-02-06 03:03:03,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:03:03,304 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2025-02-06 03:03:03,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:03:03,308 INFO L225 Difference]: With dead ends: 88 [2025-02-06 03:03:03,308 INFO L226 Difference]: Without dead ends: 44 [2025-02-06 03:03:03,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 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:03:03,313 INFO L435 NwaCegarLoop]: 62 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, 62 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:03:03,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:03:03,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-06 03:03:03,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-02-06 03:03:03,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:03:03,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2025-02-06 03:03:03,349 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 97 [2025-02-06 03:03:03,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:03:03,349 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2025-02-06 03:03:03,350 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:03:03,350 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2025-02-06 03:03:03,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 03:03:03,353 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:03:03,353 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:03,361 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:03:03,554 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:03:03,554 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:03:03,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:03:03,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1661538639, now seen corresponding path program 1 times [2025-02-06 03:03:03,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:03:03,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830275532] [2025-02-06 03:03:03,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:03:03,556 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:03:03,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:03:03,562 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:03:03,563 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:03:03,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 03:03:03,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 03:03:03,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:03:03,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:03:03,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 03:03:03,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:03:04,073 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 63 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-02-06 03:03:04,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:03:04,265 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:03:04,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830275532] [2025-02-06 03:03:04,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830275532] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:03:04,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [737797749] [2025-02-06 03:03:04,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:03:04,266 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:03:04,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:03:04,273 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:03:04,277 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:03:04,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 03:03:04,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 03:03:04,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:03:04,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:03:04,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 03:03:04,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:03:04,708 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 63 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-02-06 03:03:04,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:03:04,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [737797749] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:03:04,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:03:04,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2025-02-06 03:03:04,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626146183] [2025-02-06 03:03:04,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:03:04,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:03:04,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:03:04,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:03:04,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:03:04,806 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-06 03:03:05,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:03:05,078 INFO L93 Difference]: Finished difference Result 97 states and 131 transitions. [2025-02-06 03:03:05,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:03:05,078 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 97 [2025-02-06 03:03:05,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:03:05,079 INFO L225 Difference]: With dead ends: 97 [2025-02-06 03:03:05,080 INFO L226 Difference]: Without dead ends: 56 [2025-02-06 03:03:05,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:03:05,081 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 38 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:03:05,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 130 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:03:05,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-06 03:03:05,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2025-02-06 03:03:05,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:03:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2025-02-06 03:03:05,088 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 97 [2025-02-06 03:03:05,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:03:05,090 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2025-02-06 03:03:05,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-06 03:03:05,091 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2025-02-06 03:03:05,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 03:03:05,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:03:05,095 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:05,100 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 (3)] Ended with exit code 0 [2025-02-06 03:03:05,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-02-06 03:03:05,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 03:03:05,497 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:03:05,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:03:05,497 INFO L85 PathProgramCache]: Analyzing trace with hash -145915824, now seen corresponding path program 1 times [2025-02-06 03:03:05,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:03:05,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226820403] [2025-02-06 03:03:05,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:03:05,498 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:03:05,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:03:05,501 INFO L229 MonitoredProcess]: Starting monitored process 5 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:03:05,502 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 (5)] Waiting until timeout for monitored process [2025-02-06 03:03:05,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 03:03:05,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 03:03:05,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:03:05,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:03:05,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 03:03:05,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:03:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 222 proven. 102 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-06 03:03:06,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:03:09,589 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:03:09,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226820403] [2025-02-06 03:03:09,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [226820403] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:03:09,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2093015643] [2025-02-06 03:03:09,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:03:09,591 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:03:09,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:03:09,594 INFO L229 MonitoredProcess]: Starting monitored process 6 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:03:09,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-02-06 03:03:09,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 03:03:09,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 03:03:09,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:03:09,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:03:09,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 03:03:09,874 INFO L279 TraceCheckSpWp]: Computing forward predicates...