./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-52.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_operatoramount_amount25_file-52.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 2b49dec271465b2754e36573ebd59f8c437d77cb6b6af58205c53363f2448e6a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:30:09,749 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:30:09,783 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:30:09,787 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:30:09,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:30:09,803 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:30:09,803 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:30:09,803 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:30:09,804 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:30:09,804 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:30:09,804 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:30:09,804 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:30:09,804 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:30:09,804 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:30:09,804 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:30:09,805 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:30:09,805 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:30:09,805 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:30:09,805 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:30:09,805 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:30:09,805 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:30:09,805 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:30:09,805 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:30:09,805 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:30:09,805 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:30:09,805 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:30:09,805 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:30:09,806 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:30:09,806 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:30:09,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:30:09,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:30:09,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:30:09,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:30:09,806 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:30:09,806 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:30:09,806 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:30:09,806 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:30:09,806 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:30:09,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:30:09,807 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:30:09,807 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:30:09,807 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:30:09,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:30:09,807 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 -> 2b49dec271465b2754e36573ebd59f8c437d77cb6b6af58205c53363f2448e6a [2025-02-06 02:30:09,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:30:10,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:30:10,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:30:10,010 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:30:10,010 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:30:10,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-52.i [2025-02-06 02:30:11,133 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f114d9201/0577c8ffd7574a16b43fb318cbef8c02/FLAG48c4c5704 [2025-02-06 02:30:11,350 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:30:11,351 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-52.i [2025-02-06 02:30:11,360 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f114d9201/0577c8ffd7574a16b43fb318cbef8c02/FLAG48c4c5704 [2025-02-06 02:30:11,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f114d9201/0577c8ffd7574a16b43fb318cbef8c02 [2025-02-06 02:30:11,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:30:11,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:30:11,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:30:11,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:30:11,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:30:11,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:30:11" (1/1) ... [2025-02-06 02:30:11,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3989e791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:11, skipping insertion in model container [2025-02-06 02:30:11,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:30:11" (1/1) ... [2025-02-06 02:30:11,731 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:30:11,809 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_operatoramount_amount25_file-52.i[915,928] [2025-02-06 02:30:11,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:30:11,841 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:30:11,848 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_operatoramount_amount25_file-52.i[915,928] [2025-02-06 02:30:11,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:30:11,871 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:30:11,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:11 WrapperNode [2025-02-06 02:30:11,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:30:11,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:30:11,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:30:11,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:30:11,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:11" (1/1) ... [2025-02-06 02:30:11,881 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:11" (1/1) ... [2025-02-06 02:30:11,901 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2025-02-06 02:30:11,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:30:11,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:30:11,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:30:11,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:30:11,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:11" (1/1) ... [2025-02-06 02:30:11,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:11" (1/1) ... [2025-02-06 02:30:11,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:11" (1/1) ... [2025-02-06 02:30:11,922 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 02:30:11,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:11" (1/1) ... [2025-02-06 02:30:11,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:11" (1/1) ... [2025-02-06 02:30:11,930 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:11" (1/1) ... [2025-02-06 02:30:11,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:11" (1/1) ... [2025-02-06 02:30:11,932 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:11" (1/1) ... [2025-02-06 02:30:11,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:11" (1/1) ... [2025-02-06 02:30:11,938 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:30:11,938 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:30:11,938 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:30:11,938 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:30:11,939 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:11" (1/1) ... [2025-02-06 02:30:11,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:30:11,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:30:11,967 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 02:30:11,973 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 02:30:11,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:30:11,989 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:30:11,990 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:30:11,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:30:11,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:30:11,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:30:12,049 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:30:12,050 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:30:12,277 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-02-06 02:30:12,278 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:30:12,285 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:30:12,286 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:30:12,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:30:12 BoogieIcfgContainer [2025-02-06 02:30:12,286 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:30:12,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:30:12,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:30:12,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:30:12,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:30:11" (1/3) ... [2025-02-06 02:30:12,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1247fb6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:30:12, skipping insertion in model container [2025-02-06 02:30:12,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:11" (2/3) ... [2025-02-06 02:30:12,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1247fb6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:30:12, skipping insertion in model container [2025-02-06 02:30:12,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:30:12" (3/3) ... [2025-02-06 02:30:12,295 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-52.i [2025-02-06 02:30:12,307 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:30:12,309 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-52.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:30:12,359 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:30:12,371 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;@2ddb464, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:30:12,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:30:12,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 02:30:12,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 02:30:12,386 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:30:12,387 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:30:12,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:30:12,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:30:12,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1213276140, now seen corresponding path program 1 times [2025-02-06 02:30:12,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:30:12,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967276207] [2025-02-06 02:30:12,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:30:12,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:30:12,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 02:30:12,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 02:30:12,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:30:12,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:30:12,580 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 02:30:12,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:30:12,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967276207] [2025-02-06 02:30:12,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967276207] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:30:12,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022584027] [2025-02-06 02:30:12,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:30:12,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:30:12,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:30:12,588 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 02:30:12,593 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 02:30:12,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 02:30:12,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 02:30:12,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:30:12,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:30:12,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:30:12,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:30:12,722 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 02:30:12,723 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:30:12,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022584027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:30:12,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:30:12,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:30:12,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874605012] [2025-02-06 02:30:12,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:30:12,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:30:12,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:30:12,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:30:12,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:30:12,755 INFO L87 Difference]: Start difference. First operand has 51 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 02:30:12,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:30:12,792 INFO L93 Difference]: Finished difference Result 96 states and 161 transitions. [2025-02-06 02:30:12,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:30:12,793 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2025-02-06 02:30:12,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:30:12,797 INFO L225 Difference]: With dead ends: 96 [2025-02-06 02:30:12,797 INFO L226 Difference]: Without dead ends: 48 [2025-02-06 02:30:12,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 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 02:30:12,801 INFO L435 NwaCegarLoop]: 69 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, 69 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 02:30:12,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:30:12,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-06 02:30:12,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-06 02:30:12,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 02:30:12,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2025-02-06 02:30:12,827 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 113 [2025-02-06 02:30:12,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:30:12,827 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2025-02-06 02:30:12,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 02:30:12,828 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2025-02-06 02:30:12,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 02:30:12,830 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:30:12,830 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:30:12,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 02:30:13,031 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 02:30:13,031 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:30:13,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:30:13,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1692135628, now seen corresponding path program 1 times [2025-02-06 02:30:13,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:30:13,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181828020] [2025-02-06 02:30:13,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:30:13,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:30:13,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 02:30:13,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 02:30:13,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:30:13,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:30:13,184 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 02:30:13,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 02:30:13,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 02:30:13,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:30:13,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:30:13,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 02:30:13,303 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 02:30:13,304 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 02:30:13,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:30:13,307 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 02:30:13,360 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 02:30:13,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:30:13 BoogieIcfgContainer [2025-02-06 02:30:13,362 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 02:30:13,366 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 02:30:13,366 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 02:30:13,366 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 02:30:13,367 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:30:12" (3/4) ... [2025-02-06 02:30:13,368 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 02:30:13,369 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 02:30:13,369 INFO L158 Benchmark]: Toolchain (without parser) took 1653.92ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 71.1MB in the end (delta: 33.7MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2025-02-06 02:30:13,369 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 226.5MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:30:13,370 INFO L158 Benchmark]: CACSL2BoogieTranslator took 155.15ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 92.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:30:13,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.70ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 89.0MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:30:13,370 INFO L158 Benchmark]: Boogie Preprocessor took 35.94ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 85.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:30:13,370 INFO L158 Benchmark]: IcfgBuilder took 347.60ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 67.2MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 02:30:13,370 INFO L158 Benchmark]: TraceAbstraction took 1074.33ms. Allocated memory is still 142.6MB. Free memory was 67.2MB in the beginning and 71.2MB in the end (delta: -4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:30:13,370 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 71.1MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:30:13,374 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.18ms. Allocated memory is still 226.5MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 155.15ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 92.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.70ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 89.0MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.94ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 85.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 347.60ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 67.2MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1074.33ms. Allocated memory is still 142.6MB. Free memory was 67.2MB in the beginning and 71.2MB in the end (delta: -4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 71.1MB 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 someBinaryDOUBLEComparisonOperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 43, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of someBinaryDOUBLEComparisonOperation at line 72. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -4; [L23] double var_1_2 = 255.6; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 0; [L27] unsigned char var_1_8 = 0; [L28] unsigned char var_1_9 = 8; [L29] double var_1_10 = 255.2; [L30] unsigned char var_1_11 = 64; [L31] unsigned char var_1_12 = 100; [L32] unsigned char var_1_13 = 32; [L33] unsigned char var_1_14 = 64; [L34] unsigned char var_1_15 = 0; VAL [isInitial=0, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_2=1278/5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=8] [L96] isInitial = 1 [L97] FCALL initially() [L98] COND TRUE 1 [L99] FCALL updateLastVariables() [L100] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=8] [L61] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=8] [L62] var_1_6 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_7=0, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_7=0, var_1_8=0, var_1_9=8] [L63] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_7=0, var_1_8=0, var_1_9=8] [L64] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=8] [L64] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=8] [L65] var_1_7 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L66] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L67] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L67] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L68] var_1_8 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_9=8] [L69] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_9=8] [L70] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L70] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L71] var_1_10 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L72] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L73] var_1_11 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L74] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L75] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L75] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L76] var_1_12 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_12 >= 64) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L77] RET assume_abort_if_not(var_1_12 >= 64) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L78] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L78] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L79] var_1_13 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L80] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L81] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=122, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=122, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L81] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=122, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L82] var_1_14 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=122, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=122, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L83] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=122, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L84] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=122, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=122, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L84] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=122, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L85] var_1_15 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=122, var_1_14=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=122, var_1_14=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L86] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=122, var_1_14=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L87] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=122, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=122, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L87] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=122, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=8] [L100] RET updateVariables() [L101] CALL step() [L38] COND TRUE (- var_1_2) <= var_1_10 [L39] var_1_9 = ((((((var_1_11 + var_1_12) - var_1_13)) < ((var_1_14 + var_1_15))) ? (((var_1_11 + var_1_12) - var_1_13)) : ((var_1_14 + var_1_15)))) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=122, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=0] [L43] COND TRUE var_1_2 < 63.75 [L44] var_1_1 = (10 - var_1_9) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=122, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=0] [L48] signed long int stepLocal_0 = (var_1_9 / -256) * 32; VAL [isInitial=1, stepLocal_0=0, var_1_11=63, var_1_12=64, var_1_13=122, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=1, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=0] [L49] COND FALSE !(var_1_9 > stepLocal_0) [L56] var_1_5 = var_1_7 VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=122, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=-255, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=0] [L101] RET step() [L102] CALL, EXPR property() [L92-L93] return (((var_1_2 < 63.75) ? (var_1_1 == ((signed short int) (10 - var_1_9))) : (var_1_1 == ((signed short int) (4 + var_1_9)))) && ((var_1_9 > ((var_1_9 / -256) * 32)) ? (var_1_6 ? (var_1_5 == ((unsigned char) (! (var_1_7 && (! var_1_8))))) : (var_1_5 == ((unsigned char) var_1_7))) : (var_1_5 == ((unsigned char) var_1_7)))) && (((- var_1_2) <= var_1_10) ? (var_1_9 == ((unsigned char) ((((((var_1_11 + var_1_12) - var_1_13)) < ((var_1_14 + var_1_15))) ? (((var_1_11 + var_1_12) - var_1_13)) : ((var_1_14 + var_1_15)))))) : (var_1_9 == ((unsigned char) var_1_12))) ; VAL [\result=0, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=122, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=-255, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=0] [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=122, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=-255, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=122, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=-255, var_1_6=1, var_1_7=-255, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 69 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 339 NumberOfCodeBlocks, 339 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 224 ConstructedInterpolants, 0 QuantifiedInterpolants, 224 SizeOfPredicates, 0 NumberOfNonLiveVariables, 250 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1190/1224 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 02:30:13,391 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_operatoramount_amount25_file-52.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 2b49dec271465b2754e36573ebd59f8c437d77cb6b6af58205c53363f2448e6a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:30:15,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:30:15,450 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 02:30:15,456 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:30:15,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:30:15,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:30:15,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:30:15,484 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:30:15,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:30:15,485 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:30:15,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:30:15,486 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:30:15,486 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:30:15,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:30:15,487 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:30:15,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:30:15,487 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:30:15,487 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:30:15,487 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:30:15,487 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:30:15,487 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:30:15,487 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:30:15,487 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:30:15,488 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 02:30:15,488 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 02:30:15,488 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 02:30:15,488 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:30:15,488 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:30:15,488 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:30:15,488 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:30:15,488 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:30:15,488 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:30:15,489 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:30:15,489 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:30:15,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:30:15,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:30:15,489 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:30:15,489 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:30:15,489 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:30:15,489 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 02:30:15,489 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 02:30:15,490 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:30:15,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:30:15,490 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:30:15,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:30:15,490 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 -> 2b49dec271465b2754e36573ebd59f8c437d77cb6b6af58205c53363f2448e6a [2025-02-06 02:30:15,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:30:15,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:30:15,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:30:15,709 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:30:15,709 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:30:15,710 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-52.i [2025-02-06 02:30:16,988 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d567bcb59/9192fdf6ca274151bc65f4e4f30143c8/FLAG831f1934e [2025-02-06 02:30:17,230 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:30:17,231 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-52.i [2025-02-06 02:30:17,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d567bcb59/9192fdf6ca274151bc65f4e4f30143c8/FLAG831f1934e [2025-02-06 02:30:17,252 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d567bcb59/9192fdf6ca274151bc65f4e4f30143c8 [2025-02-06 02:30:17,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:30:17,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:30:17,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:30:17,257 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:30:17,260 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:30:17,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:30:17" (1/1) ... [2025-02-06 02:30:17,261 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@198bf93f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:17, skipping insertion in model container [2025-02-06 02:30:17,262 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:30:17" (1/1) ... [2025-02-06 02:30:17,275 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:30:17,378 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_operatoramount_amount25_file-52.i[915,928] [2025-02-06 02:30:17,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:30:17,464 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:30:17,477 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_operatoramount_amount25_file-52.i[915,928] [2025-02-06 02:30:17,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:30:17,513 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:30:17,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:17 WrapperNode [2025-02-06 02:30:17,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:30:17,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:30:17,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:30:17,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:30:17,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:17" (1/1) ... [2025-02-06 02:30:17,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:17" (1/1) ... [2025-02-06 02:30:17,549 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2025-02-06 02:30:17,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:30:17,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:30:17,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:30:17,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:30:17,558 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:17" (1/1) ... [2025-02-06 02:30:17,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:17" (1/1) ... [2025-02-06 02:30:17,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:17" (1/1) ... [2025-02-06 02:30:17,572 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 02:30:17,572 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:17" (1/1) ... [2025-02-06 02:30:17,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:17" (1/1) ... [2025-02-06 02:30:17,580 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:17" (1/1) ... [2025-02-06 02:30:17,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:17" (1/1) ... [2025-02-06 02:30:17,586 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:17" (1/1) ... [2025-02-06 02:30:17,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:17" (1/1) ... [2025-02-06 02:30:17,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:30:17,592 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:30:17,592 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:30:17,592 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:30:17,593 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:17" (1/1) ... [2025-02-06 02:30:17,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:30:17,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:30:17,622 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 02:30:17,624 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 02:30:17,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:30:17,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 02:30:17,642 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:30:17,642 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:30:17,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:30:17,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:30:17,702 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:30:17,704 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:30:17,898 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-02-06 02:30:17,899 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:30:17,905 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:30:17,905 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:30:17,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:30:17 BoogieIcfgContainer [2025-02-06 02:30:17,905 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:30:17,907 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:30:17,907 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:30:17,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:30:17,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:30:17" (1/3) ... [2025-02-06 02:30:17,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da5e672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:30:17, skipping insertion in model container [2025-02-06 02:30:17,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:17" (2/3) ... [2025-02-06 02:30:17,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da5e672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:30:17, skipping insertion in model container [2025-02-06 02:30:17,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:30:17" (3/3) ... [2025-02-06 02:30:17,912 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-52.i [2025-02-06 02:30:17,922 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:30:17,923 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-52.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:30:17,961 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:30:17,968 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;@75ca476e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:30:17,969 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:30:17,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 02:30:17,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 02:30:17,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:30:17,978 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:30:17,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:30:17,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:30:17,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1213276140, now seen corresponding path program 1 times [2025-02-06 02:30:17,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:30:17,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856898205] [2025-02-06 02:30:17,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:30:17,989 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 02:30:17,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:30:17,991 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 02:30:17,994 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 02:30:18,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 02:30:18,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 02:30:18,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:30:18,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:30:18,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:30:18,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:30:18,170 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-02-06 02:30:18,170 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:30:18,170 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:30:18,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856898205] [2025-02-06 02:30:18,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856898205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:30:18,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:30:18,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 02:30:18,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974330823] [2025-02-06 02:30:18,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:30:18,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:30:18,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:30:18,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:30:18,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:30:18,189 INFO L87 Difference]: Start difference. First operand has 51 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 02:30:18,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:30:18,206 INFO L93 Difference]: Finished difference Result 96 states and 161 transitions. [2025-02-06 02:30:18,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:30:18,208 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2025-02-06 02:30:18,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:30:18,212 INFO L225 Difference]: With dead ends: 96 [2025-02-06 02:30:18,212 INFO L226 Difference]: Without dead ends: 48 [2025-02-06 02:30:18,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 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 02:30:18,216 INFO L435 NwaCegarLoop]: 69 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, 69 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 02:30:18,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:30:18,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-06 02:30:18,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-06 02:30:18,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 02:30:18,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2025-02-06 02:30:18,267 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 113 [2025-02-06 02:30:18,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:30:18,267 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2025-02-06 02:30:18,267 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 02:30:18,267 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2025-02-06 02:30:18,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 02:30:18,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:30:18,271 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:30:18,281 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-02-06 02:30:18,472 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 02:30:18,472 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:30:18,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:30:18,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1692135628, now seen corresponding path program 1 times [2025-02-06 02:30:18,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:30:18,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23185342] [2025-02-06 02:30:18,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:30:18,473 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 02:30:18,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:30:18,476 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 02:30:18,477 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 02:30:18,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 02:30:18,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 02:30:18,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:30:18,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:30:18,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 02:30:18,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:30:28,156 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 444 proven. 45 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-02-06 02:30:28,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:30:39,109 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 02:30:39,110 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:30:39,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23185342] [2025-02-06 02:30:39,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23185342] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 02:30:39,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:30:39,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [29] total 35 [2025-02-06 02:30:39,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870224098] [2025-02-06 02:30:39,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:30:39,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:30:39,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:30:39,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:30:39,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=969, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 02:30:39,113 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 02:30:40,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:30:40,082 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2025-02-06 02:30:40,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:30:40,083 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2025-02-06 02:30:40,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:30:40,085 INFO L225 Difference]: With dead ends: 67 [2025-02-06 02:30:40,085 INFO L226 Difference]: Without dead ends: 65 [2025-02-06 02:30:40,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=245, Invalid=1161, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 02:30:40,088 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 31 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:30:40,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 348 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:30:40,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-06 02:30:40,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2025-02-06 02:30:40,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 02:30:40,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2025-02-06 02:30:40,095 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 113 [2025-02-06 02:30:40,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:30:40,096 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2025-02-06 02:30:40,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 02:30:40,097 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2025-02-06 02:30:40,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 02:30:40,098 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:30:40,098 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:30:40,102 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-02-06 02:30:40,299 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 [2025-02-06 02:30:40,300 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:30:40,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:30:40,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1715327987, now seen corresponding path program 1 times [2025-02-06 02:30:40,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:30:40,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674170700] [2025-02-06 02:30:40,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:30:40,301 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 02:30:40,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:30:40,305 INFO L229 MonitoredProcess]: Starting monitored process 4 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 02:30:40,308 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 (4)] Waiting until timeout for monitored process [2025-02-06 02:30:40,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 02:30:40,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 02:30:40,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:30:40,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:30:40,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 02:30:40,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:30:48,372 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 444 proven. 45 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-02-06 02:30:48,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:30:59,676 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 02:30:59,677 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:30:59,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674170700] [2025-02-06 02:30:59,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674170700] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 02:30:59,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:30:59,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [29] total 35 [2025-02-06 02:30:59,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385374332] [2025-02-06 02:30:59,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:30:59,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:30:59,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:30:59,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:30:59,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=969, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 02:30:59,682 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 02:31:00,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:31:00,539 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2025-02-06 02:31:00,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:31:00,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2025-02-06 02:31:00,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:31:00,544 INFO L225 Difference]: With dead ends: 70 [2025-02-06 02:31:00,544 INFO L226 Difference]: Without dead ends: 68 [2025-02-06 02:31:00,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=245, Invalid=1161, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 02:31:00,549 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 35 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:31:00,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 328 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:31:00,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-06 02:31:00,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 51. [2025-02-06 02:31:00,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 02:31:00,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2025-02-06 02:31:00,562 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 113 [2025-02-06 02:31:00,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:31:00,562 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2025-02-06 02:31:00,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 02:31:00,563 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2025-02-06 02:31:00,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 02:31:00,563 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:31:00,568 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:31:00,573 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 (4)] Ended with exit code 0 [2025-02-06 02:31:00,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 02:31:00,769 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:31:00,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:31:00,772 INFO L85 PathProgramCache]: Analyzing trace with hash 946211129, now seen corresponding path program 1 times [2025-02-06 02:31:00,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:31:00,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1719868910] [2025-02-06 02:31:00,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:31:00,773 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 02:31:00,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:31:00,776 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 02:31:00,777 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 02:31:00,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 02:31:01,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 02:31:01,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:31:01,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:31:01,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 02:31:01,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:31:06,747 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 444 proven. 45 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-02-06 02:31:06,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:31:23,842 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 02:31:23,842 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:31:23,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1719868910] [2025-02-06 02:31:23,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1719868910] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 02:31:23,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:31:23,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [30] total 37 [2025-02-06 02:31:23,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150101811] [2025-02-06 02:31:23,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:31:23,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:31:23,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:31:23,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:31:23,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1090, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 02:31:23,844 INFO L87 Difference]: Start difference. First operand 51 states and 72 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 02:31:24,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:31:24,878 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2025-02-06 02:31:24,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:31:24,879 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2025-02-06 02:31:24,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:31:24,880 INFO L225 Difference]: With dead ends: 68 [2025-02-06 02:31:24,882 INFO L226 Difference]: Without dead ends: 66 [2025-02-06 02:31:24,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=280, Invalid=1360, Unknown=0, NotChecked=0, Total=1640 [2025-02-06 02:31:24,883 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 48 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:31:24,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 284 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:31:24,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-06 02:31:24,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2025-02-06 02:31:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 02:31:24,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions. [2025-02-06 02:31:24,891 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 114 [2025-02-06 02:31:24,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:31:24,892 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 77 transitions. [2025-02-06 02:31:24,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 02:31:24,892 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 77 transitions. [2025-02-06 02:31:24,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 02:31:24,895 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:31:24,895 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:31:24,900 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-02-06 02:31:25,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 02:31:25,099 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:31:25,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:31:25,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1605945832, now seen corresponding path program 1 times [2025-02-06 02:31:25,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:31:25,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965033793] [2025-02-06 02:31:25,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:31:25,100 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 02:31:25,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:31:25,102 INFO L229 MonitoredProcess]: Starting monitored process 6 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 02:31:25,103 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 (6)] Waiting until timeout for monitored process [2025-02-06 02:31:25,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 02:31:25,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 02:31:25,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:31:25,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:31:25,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 02:31:25,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:31:31,034 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 444 proven. 45 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-02-06 02:31:31,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:31:48,743 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 02:31:48,743 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:31:48,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1965033793] [2025-02-06 02:31:48,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1965033793] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 02:31:48,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:31:48,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [30] total 37 [2025-02-06 02:31:48,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756702246] [2025-02-06 02:31:48,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:31:48,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:31:48,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:31:48,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:31:48,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1090, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 02:31:48,748 INFO L87 Difference]: Start difference. First operand 54 states and 77 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 02:31:50,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:31:50,014 INFO L93 Difference]: Finished difference Result 65 states and 88 transitions. [2025-02-06 02:31:50,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:31:50,016 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2025-02-06 02:31:50,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:31:50,017 INFO L225 Difference]: With dead ends: 65 [2025-02-06 02:31:50,017 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 02:31:50,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=280, Invalid=1360, Unknown=0, NotChecked=0, Total=1640 [2025-02-06 02:31:50,020 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 37 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:31:50,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 331 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:31:50,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 02:31:50,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 02:31:50,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 02:31:50,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 02:31:50,026 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 114 [2025-02-06 02:31:50,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:31:50,026 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 02:31:50,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 02:31:50,026 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 02:31:50,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 02:31:50,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 02:31:50,041 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 (6)] Ended with exit code 0 [2025-02-06 02:31:50,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 02:31:50,232 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 02:31:50,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 02:31:51,470 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 02:31:51,479 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-02-06 02:31:51,481 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.neg~64 [2025-02-06 02:31:51,481 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.neg~64 [2025-02-06 02:31:51,482 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2025-02-06 02:31:51,482 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2025-02-06 02:31:51,482 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.neg~64 [2025-02-06 02:31:51,482 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.neg~64 [2025-02-06 02:31:51,482 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.neg~64 [2025-02-06 02:31:51,482 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.neg~64 [2025-02-06 02:31:51,483 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2025-02-06 02:31:51,483 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2025-02-06 02:31:51,483 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.neg~64 [2025-02-06 02:31:51,483 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.neg~64 [2025-02-06 02:31:51,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:31:51 BoogieIcfgContainer [2025-02-06 02:31:51,483 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 02:31:51,484 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 02:31:51,484 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 02:31:51,484 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 02:31:51,484 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:30:17" (3/4) ... [2025-02-06 02:31:51,486 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 02:31:51,489 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-06 02:31:51,492 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-02-06 02:31:51,492 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 02:31:51,492 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 02:31:51,492 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 02:31:51,544 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 02:31:51,544 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 02:31:51,544 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 02:31:51,545 INFO L158 Benchmark]: Toolchain (without parser) took 94289.75ms. Allocated memory was 117.4MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 92.1MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 308.9MB. Max. memory is 16.1GB. [2025-02-06 02:31:51,545 INFO L158 Benchmark]: CDTParser took 1.45ms. Allocated memory is still 83.9MB. Free memory was 62.5MB in the beginning and 62.5MB in the end (delta: 35.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:31:51,545 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.58ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 79.1MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:31:51,545 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.79ms. Allocated memory is still 117.4MB. Free memory was 78.9MB in the beginning and 77.4MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:31:51,546 INFO L158 Benchmark]: Boogie Preprocessor took 39.22ms. Allocated memory is still 117.4MB. Free memory was 77.4MB in the beginning and 75.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:31:51,546 INFO L158 Benchmark]: IcfgBuilder took 313.57ms. Allocated memory is still 117.4MB. Free memory was 75.3MB in the beginning and 60.3MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 02:31:51,546 INFO L158 Benchmark]: TraceAbstraction took 93576.29ms. Allocated memory was 117.4MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 59.9MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-02-06 02:31:51,546 INFO L158 Benchmark]: Witness Printer took 60.36ms. Allocated memory is still 2.0GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:31:51,547 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.45ms. Allocated memory is still 83.9MB. Free memory was 62.5MB in the beginning and 62.5MB in the end (delta: 35.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.58ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 79.1MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.79ms. Allocated memory is still 117.4MB. Free memory was 78.9MB in the beginning and 77.4MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.22ms. Allocated memory is still 117.4MB. Free memory was 77.4MB in the beginning and 75.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 313.57ms. Allocated memory is still 117.4MB. Free memory was 75.3MB in the beginning and 60.3MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 93576.29ms. Allocated memory was 117.4MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 59.9MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 60.36ms. Allocated memory is still 2.0GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.neg~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.neg~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.neg~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.neg~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.neg~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.neg~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.neg~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.neg~64 * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 92.3s, OverallIterations: 5, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 151 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 151 mSDsluCounter, 1360 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1015 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 507 IncrementalHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 345 mSDtfsCounter, 507 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1028 GetRequests, 878 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1684 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=4, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 41 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 85.9s InterpolantComputationTime, 567 NumberOfCodeBlocks, 567 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 1012 ConstructedInterpolants, 4 QuantifiedInterpolants, 10045 SizeOfPredicates, 78 NumberOfNonLiveVariables, 902 ConjunctsInSsa, 135 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 5328/5508 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 02:31:51,639 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 Writing output log to file Ultimate.log Result: TRUE