./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-42.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_codestructure_normal_file-42.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 b9a474490b26b75e32bf600e29c6590e80c0b8d4fd291d4937993f7ea2b0bba8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:34:46,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:34:46,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 20:34:46,934 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:34:46,935 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:34:46,956 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:34:46,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:34:46,956 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:34:46,958 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:34:46,958 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:34:46,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:34:46,959 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:34:46,960 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:34:46,960 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:34:46,960 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:34:46,960 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:34:46,961 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:34:46,961 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:34:46,961 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:34:46,961 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:34:46,961 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:34:46,961 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:34:46,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:34:46,961 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:34:46,961 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:34:46,961 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:34:46,962 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:34:46,962 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:34:46,962 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:34:46,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:34:46,962 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:34:46,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:34:46,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:34:46,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:34:46,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:34:46,963 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:34:46,963 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:34:46,963 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:34:46,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:34:46,964 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:34:46,964 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:34:46,964 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:34:46,964 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:34:46,964 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 -> b9a474490b26b75e32bf600e29c6590e80c0b8d4fd291d4937993f7ea2b0bba8 [2025-02-05 20:34:47,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:34:47,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:34:47,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:34:47,257 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:34:47,258 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:34:47,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-42.i [2025-02-05 20:34:49,199 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da5f07f6d/f72859a11b5e46569a7db330681921eb/FLAG0aef02d60 [2025-02-05 20:34:49,515 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:34:49,515 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-42.i [2025-02-05 20:34:49,527 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da5f07f6d/f72859a11b5e46569a7db330681921eb/FLAG0aef02d60 [2025-02-05 20:34:49,547 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da5f07f6d/f72859a11b5e46569a7db330681921eb [2025-02-05 20:34:49,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:34:49,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:34:49,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:34:49,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:34:49,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:34:49,560 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:34:49" (1/1) ... [2025-02-05 20:34:49,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a3aa120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:34:49, skipping insertion in model container [2025-02-05 20:34:49,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:34:49" (1/1) ... [2025-02-05 20:34:49,586 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:34:49,716 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_codestructure_normal_file-42.i[913,926] [2025-02-05 20:34:49,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:34:49,796 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:34:49,806 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_codestructure_normal_file-42.i[913,926] [2025-02-05 20:34:49,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:34:49,870 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:34:49,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:34:49 WrapperNode [2025-02-05 20:34:49,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:34:49,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:34:49,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:34:49,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:34:49,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:34:49" (1/1) ... [2025-02-05 20:34:49,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:34:49" (1/1) ... [2025-02-05 20:34:49,916 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2025-02-05 20:34:49,916 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:34:49,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:34:49,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:34:49,917 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:34:49,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:34:49" (1/1) ... [2025-02-05 20:34:49,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:34:49" (1/1) ... [2025-02-05 20:34:49,926 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:34:49" (1/1) ... [2025-02-05 20:34:49,939 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-05 20:34:49,940 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:34:49" (1/1) ... [2025-02-05 20:34:49,940 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:34:49" (1/1) ... [2025-02-05 20:34:49,948 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:34:49" (1/1) ... [2025-02-05 20:34:49,953 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:34:49" (1/1) ... [2025-02-05 20:34:49,955 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:34:49" (1/1) ... [2025-02-05 20:34:49,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:34:49" (1/1) ... [2025-02-05 20:34:49,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:34:49,960 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:34:49,960 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:34:49,960 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:34:49,961 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:34:49" (1/1) ... [2025-02-05 20:34:49,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:34:49,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:34:49,997 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-05 20:34:50,005 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-05 20:34:50,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:34:50,024 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:34:50,024 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:34:50,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:34:50,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:34:50,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:34:50,094 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:34:50,096 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:34:50,398 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 20:34:50,399 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:34:50,411 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:34:50,412 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:34:50,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:34:50 BoogieIcfgContainer [2025-02-05 20:34:50,412 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:34:50,415 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:34:50,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:34:50,419 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:34:50,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:34:49" (1/3) ... [2025-02-05 20:34:50,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eeb229c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:34:50, skipping insertion in model container [2025-02-05 20:34:50,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:34:49" (2/3) ... [2025-02-05 20:34:50,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eeb229c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:34:50, skipping insertion in model container [2025-02-05 20:34:50,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:34:50" (3/3) ... [2025-02-05 20:34:50,423 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-42.i [2025-02-05 20:34:50,434 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:34:50,435 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-42.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:34:50,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:34:50,504 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;@72467c7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:34:50,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:34:50,510 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 20:34:50,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 20:34:50,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:34:50,525 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:34:50,526 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:34:50,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:34:50,532 INFO L85 PathProgramCache]: Analyzing trace with hash -78759324, now seen corresponding path program 1 times [2025-02-05 20:34:50,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:34:50,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550029258] [2025-02-05 20:34:50,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:34:50,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:34:50,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:34:50,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:34:50,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:34:50,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:34:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-02-05 20:34:50,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:34:50,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550029258] [2025-02-05 20:34:50,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550029258] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:34:50,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681232151] [2025-02-05 20:34:50,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:34:50,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:34:50,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:34:50,899 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-05 20:34:50,901 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-05 20:34:50,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:34:51,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:34:51,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:34:51,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:34:51,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:34:51,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:34:51,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-02-05 20:34:51,112 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:34:51,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681232151] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:34:51,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:34:51,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 20:34:51,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894943284] [2025-02-05 20:34:51,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:34:51,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:34:51,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:34:51,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:34:51,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:34:51,143 INFO L87 Difference]: Start difference. First operand has 65 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 20:34:51,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:34:51,172 INFO L93 Difference]: Finished difference Result 124 states and 218 transitions. [2025-02-05 20:34:51,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:34:51,176 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 144 [2025-02-05 20:34:51,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:34:51,182 INFO L225 Difference]: With dead ends: 124 [2025-02-05 20:34:51,182 INFO L226 Difference]: Without dead ends: 62 [2025-02-05 20:34:51,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 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-05 20:34:51,189 INFO L435 NwaCegarLoop]: 95 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, 95 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-05 20:34:51,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:34:51,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-05 20:34:51,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-02-05 20:34:51,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 20:34:51,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. [2025-02-05 20:34:51,235 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 144 [2025-02-05 20:34:51,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:34:51,235 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 95 transitions. [2025-02-05 20:34:51,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 20:34:51,236 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 95 transitions. [2025-02-05 20:34:51,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 20:34:51,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:34:51,243 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:34:51,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 20:34:51,444 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-05 20:34:51,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:34:51,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:34:51,445 INFO L85 PathProgramCache]: Analyzing trace with hash 610249413, now seen corresponding path program 1 times [2025-02-05 20:34:51,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:34:51,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193850228] [2025-02-05 20:34:51,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:34:51,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:34:51,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:34:51,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:34:51,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:34:51,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:34:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 20:34:51,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:34:51,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193850228] [2025-02-05 20:34:51,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193850228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:34:51,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:34:51,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:34:51,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427516805] [2025-02-05 20:34:51,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:34:51,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:34:51,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:34:51,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:34:51,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:34:51,722 INFO L87 Difference]: Start difference. First operand 62 states and 95 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 20:34:51,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:34:51,781 INFO L93 Difference]: Finished difference Result 137 states and 211 transitions. [2025-02-05 20:34:51,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:34:51,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 144 [2025-02-05 20:34:51,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:34:51,785 INFO L225 Difference]: With dead ends: 137 [2025-02-05 20:34:51,787 INFO L226 Difference]: Without dead ends: 78 [2025-02-05 20:34:51,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:34:51,789 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 21 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:34:51,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 185 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:34:51,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-05 20:34:51,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2025-02-05 20:34:51,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 20:34:51,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 104 transitions. [2025-02-05 20:34:51,810 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 104 transitions. Word has length 144 [2025-02-05 20:34:51,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:34:51,812 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 104 transitions. [2025-02-05 20:34:51,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 20:34:51,812 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 104 transitions. [2025-02-05 20:34:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 20:34:51,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:34:51,814 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:34:51,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:34:51,814 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:34:51,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:34:51,815 INFO L85 PathProgramCache]: Analyzing trace with hash -2106040094, now seen corresponding path program 1 times [2025-02-05 20:34:51,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:34:51,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848155096] [2025-02-05 20:34:51,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:34:51,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:34:51,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 20:34:52,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 20:34:52,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:34:52,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 20:34:52,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1332169571] [2025-02-05 20:34:52,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:34:52,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:34:52,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:34:52,062 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:34:52,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 20:34:52,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 20:34:52,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 20:34:52,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:34:52,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:34:52,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 20:34:52,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:34:52,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 486 proven. 42 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-02-05 20:34:52,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:34:53,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:34:53,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848155096] [2025-02-05 20:34:53,631 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 20:34:53,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332169571] [2025-02-05 20:34:53,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332169571] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:34:53,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:34:53,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-02-05 20:34:53,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982490488] [2025-02-05 20:34:53,632 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 20:34:53,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:34:53,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:34:53,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:34:53,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:34:53,636 INFO L87 Difference]: Start difference. First operand 67 states and 104 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 20:34:53,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:34:53,922 INFO L93 Difference]: Finished difference Result 199 states and 307 transitions. [2025-02-05 20:34:53,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:34:53,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 145 [2025-02-05 20:34:53,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:34:53,925 INFO L225 Difference]: With dead ends: 199 [2025-02-05 20:34:53,927 INFO L226 Difference]: Without dead ends: 135 [2025-02-05 20:34:53,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:34:53,930 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 36 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:34:53,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 354 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:34:53,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-05 20:34:53,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2025-02-05 20:34:53,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 81 states have internal predecessors, (108), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-05 20:34:53,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 200 transitions. [2025-02-05 20:34:53,964 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 200 transitions. Word has length 145 [2025-02-05 20:34:53,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:34:53,965 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 200 transitions. [2025-02-05 20:34:53,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 20:34:53,965 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 200 transitions. [2025-02-05 20:34:53,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 20:34:53,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:34:53,969 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:34:53,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 20:34:54,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:34:54,170 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:34:54,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:34:54,171 INFO L85 PathProgramCache]: Analyzing trace with hash -309088735, now seen corresponding path program 1 times [2025-02-05 20:34:54,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:34:54,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635913012] [2025-02-05 20:34:54,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:34:54,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:34:54,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 20:34:54,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 20:34:54,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:34:54,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 20:34:54,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1071808208] [2025-02-05 20:34:54,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:34:54,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:34:54,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:34:54,325 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:34:54,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 20:34:54,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 20:34:54,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 20:34:54,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:34:54,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:34:54,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 20:34:54,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:34:55,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 486 proven. 42 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-02-05 20:34:55,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:34:55,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:34:55,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635913012] [2025-02-05 20:34:55,759 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 20:34:55,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071808208] [2025-02-05 20:34:55,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071808208] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:34:55,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:34:55,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-02-05 20:34:55,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874538601] [2025-02-05 20:34:55,760 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 20:34:55,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:34:55,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:34:55,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:34:55,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:34:55,763 INFO L87 Difference]: Start difference. First operand 131 states and 200 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 20:35:00,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:35:00,054 INFO L93 Difference]: Finished difference Result 292 states and 428 transitions. [2025-02-05 20:35:00,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 20:35:00,055 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 145 [2025-02-05 20:35:00,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:35:00,058 INFO L225 Difference]: With dead ends: 292 [2025-02-05 20:35:00,058 INFO L226 Difference]: Without dead ends: 228 [2025-02-05 20:35:00,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=226, Invalid=530, Unknown=0, NotChecked=0, Total=756 [2025-02-05 20:35:00,059 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 170 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:35:00,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 303 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-05 20:35:00,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-02-05 20:35:00,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 189. [2025-02-05 20:35:00,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 129 states have internal predecessors, (174), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 20:35:00,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 282 transitions. [2025-02-05 20:35:00,088 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 282 transitions. Word has length 145 [2025-02-05 20:35:00,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:35:00,090 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 282 transitions. [2025-02-05 20:35:00,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 20:35:00,091 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 282 transitions. [2025-02-05 20:35:00,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 20:35:00,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:35:00,095 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:35:00,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 20:35:00,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:35:00,296 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:35:00,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:35:00,296 INFO L85 PathProgramCache]: Analyzing trace with hash -505602240, now seen corresponding path program 1 times [2025-02-05 20:35:00,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:35:00,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087151950] [2025-02-05 20:35:00,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:35:00,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:35:00,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 20:35:00,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 20:35:00,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:35:00,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 20:35:00,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [956467474] [2025-02-05 20:35:00,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:35:00,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:35:00,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:35:00,375 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:35:00,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 20:35:00,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 20:35:00,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 20:35:00,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:35:00,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:35:00,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 20:35:00,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:35:01,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 486 proven. 42 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-02-05 20:35:01,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:35:01,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:35:01,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087151950] [2025-02-05 20:35:01,292 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 20:35:01,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956467474] [2025-02-05 20:35:01,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956467474] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:35:01,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:35:01,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-02-05 20:35:01,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784885891] [2025-02-05 20:35:01,292 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 20:35:01,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:35:01,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:35:01,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:35:01,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:35:01,294 INFO L87 Difference]: Start difference. First operand 189 states and 282 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 20:35:01,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:35:01,682 INFO L93 Difference]: Finished difference Result 493 states and 731 transitions. [2025-02-05 20:35:01,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 20:35:01,683 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 145 [2025-02-05 20:35:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:35:01,687 INFO L225 Difference]: With dead ends: 493 [2025-02-05 20:35:01,688 INFO L226 Difference]: Without dead ends: 371 [2025-02-05 20:35:01,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2025-02-05 20:35:01,689 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 128 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:35:01,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 386 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:35:01,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-02-05 20:35:01,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 360. [2025-02-05 20:35:01,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 237 states have (on average 1.3417721518987342) internal successors, (318), 240 states have internal predecessors, (318), 108 states have call successors, (108), 14 states have call predecessors, (108), 14 states have return successors, (108), 105 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-05 20:35:01,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 534 transitions. [2025-02-05 20:35:01,746 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 534 transitions. Word has length 145 [2025-02-05 20:35:01,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:35:01,746 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 534 transitions. [2025-02-05 20:35:01,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 20:35:01,747 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 534 transitions. [2025-02-05 20:35:01,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 20:35:01,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:35:01,748 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:35:01,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 20:35:01,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:35:01,953 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:35:01,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:35:01,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1018956384, now seen corresponding path program 1 times [2025-02-05 20:35:01,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:35:01,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050134391] [2025-02-05 20:35:01,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:35:01,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:35:01,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 20:35:02,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 20:35:02,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:35:02,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 20:35:02,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [102081289] [2025-02-05 20:35:02,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:35:02,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:35:02,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:35:02,053 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:35:02,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 20:35:02,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 20:35:02,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 20:35:02,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:35:02,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:35:02,187 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:35:02,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 20:35:02,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 20:35:02,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:35:02,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:35:02,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:35:02,349 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:35:02,350 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:35:02,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 20:35:02,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:35:02,557 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-05 20:35:02,644 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:35:02,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:35:02 BoogieIcfgContainer [2025-02-05 20:35:02,647 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:35:02,648 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:35:02,648 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:35:02,648 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:35:02,649 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:34:50" (3/4) ... [2025-02-05 20:35:02,650 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:35:02,651 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:35:02,652 INFO L158 Benchmark]: Toolchain (without parser) took 13099.76ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 111.7MB in the beginning and 174.2MB in the end (delta: -62.5MB). Peak memory consumption was 180.3MB. Max. memory is 16.1GB. [2025-02-05 20:35:02,652 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:35:02,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.21ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 97.8MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:35:02,653 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.76ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 95.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:35:02,653 INFO L158 Benchmark]: Boogie Preprocessor took 42.79ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 91.4MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:35:02,654 INFO L158 Benchmark]: IcfgBuilder took 452.32ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 70.8MB in the end (delta: 20.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 20:35:02,654 INFO L158 Benchmark]: TraceAbstraction took 12231.84ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 70.5MB in the beginning and 174.3MB in the end (delta: -103.8MB). Peak memory consumption was 138.4MB. Max. memory is 16.1GB. [2025-02-05 20:35:02,655 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 385.9MB. Free memory was 174.3MB in the beginning and 174.2MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:35:02,656 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.26ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.21ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 97.8MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.76ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 95.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.79ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 91.4MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 452.32ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 70.8MB in the end (delta: 20.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12231.84ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 70.5MB in the beginning and 174.3MB in the end (delta: -103.8MB). Peak memory consumption was 138.4MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 385.9MB. Free memory was 174.3MB in the beginning and 174.2MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 55, overapproximation of someUnaryDOUBLEoperation at line 35, overapproximation of someBinaryArithmeticFLOAToperation at line 75. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] unsigned char var_1_2 = 0; [L24] signed short int var_1_3 = -200; [L25] signed short int var_1_4 = 2; [L26] signed char var_1_5 = -8; [L27] unsigned char var_1_6 = 10; [L28] unsigned char var_1_7 = 128; [L29] unsigned char var_1_8 = 1; [L30] float var_1_9 = 9999999999.5; [L31] unsigned char var_1_10 = 1; [L32] unsigned char var_1_11 = 0; [L33] unsigned char var_1_12 = 0; [L34] signed short int var_1_13 = 200; [L35] float var_1_14 = -0.8; [L36] float var_1_15 = 127.25; [L37] float var_1_16 = 3.5; [L38] unsigned short int var_1_17 = 16; [L39] unsigned short int var_1_18 = 100; [L40] unsigned char var_1_19 = 1; [L41] unsigned char var_1_20 = 0; VAL [isInitial=0, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=0, var_1_3=-200, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] FCALL updateLastVariables() [L138] CALL updateVariables() [L90] var_1_2 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_3=-200, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_3=-200, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L91] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_3=-200, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L92] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-200, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-200, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L92] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-200, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L93] var_1_3 = __VERIFIER_nondet_short() [L94] CALL assume_abort_if_not(var_1_3 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L94] RET assume_abort_if_not(var_1_3 >= -32767) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L95] CALL assume_abort_if_not(var_1_3 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L95] RET assume_abort_if_not(var_1_3 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L96] var_1_4 = __VERIFIER_nondet_short() [L97] CALL assume_abort_if_not(var_1_4 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L97] RET assume_abort_if_not(var_1_4 >= -32767) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L98] CALL assume_abort_if_not(var_1_4 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L98] RET assume_abort_if_not(var_1_4 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L99] var_1_5 = __VERIFIER_nondet_char() [L100] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L100] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L101] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L101] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L102] var_1_7 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1, var_1_9=19999999999/2] [L103] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1, var_1_9=19999999999/2] [L104] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1, var_1_9=19999999999/2] [L104] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1, var_1_9=19999999999/2] [L105] var_1_9 = __VERIFIER_nondet_float() [L106] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L106] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L107] var_1_10 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L108] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L109] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L109] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L110] var_1_11 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L111] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L112] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L112] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L113] var_1_12 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L114] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L115] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L115] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L116] var_1_15 = __VERIFIER_nondet_float() [L117] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L117] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L118] var_1_16 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L119] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L120] var_1_18 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L121] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L122] CALL assume_abort_if_not(var_1_18 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L122] RET assume_abort_if_not(var_1_18 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L123] var_1_20 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=16, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=16, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L124] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=16, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L125] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L125] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L138] RET updateVariables() [L139] CALL step() [L45] COND TRUE \read(var_1_2) [L46] var_1_1 = ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L52] COND TRUE var_1_5 >= -2 [L53] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=383, var_1_8=1] [L55] COND FALSE !((49.5f <= var_1_9) && (var_1_2 && var_1_10)) [L62] var_1_8 = var_1_12 VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=383, var_1_8=0] [L64] COND FALSE !(var_1_6 >= (var_1_1 / var_1_7)) [L71] var_1_13 = var_1_3 VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=383, var_1_8=0] [L73] COND TRUE (((((var_1_13) < (8)) ? (var_1_13) : (8))) <= var_1_5) || var_1_2 VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=383, var_1_8=0] [L74] COND TRUE var_1_13 <= var_1_3 [L75] var_1_14 = (var_1_15 + var_1_16) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=383, var_1_8=0] [L82] COND TRUE var_1_4 > var_1_3 [L83] var_1_17 = ((((25) > ((var_1_6 + var_1_18))) ? (25) : ((var_1_6 + var_1_18)))) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=27, var_1_18=0, var_1_19=1, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=383, var_1_8=0] [L85] COND TRUE var_1_9 <= var_1_15 [L86] var_1_19 = (var_1_12 || var_1_20) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=27, var_1_18=0, var_1_19=0, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=383, var_1_8=0] [L139] RET step() [L140] CALL, EXPR property() [L130-L131] return ((((((var_1_2 ? (var_1_1 == ((signed short int) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_3) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_9) && (var_1_2 && var_1_10)) ? ((var_1_1 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_2 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((var_1_6 >= (var_1_1 / var_1_7)) ? ((var_1_1 != ((((((((var_1_3) > (var_1_6)) ? (var_1_3) : (var_1_6)))) > (var_1_5)) ? (((((var_1_3) > (var_1_6)) ? (var_1_3) : (var_1_6)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) var_1_6))) : (var_1_13 == ((signed short int) var_1_3)))) && (((((((var_1_13) < (8)) ? (var_1_13) : (8))) <= var_1_5) || var_1_2) ? ((var_1_13 <= var_1_3) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_4 > var_1_3) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_6 + var_1_18))) ? (25) : ((var_1_6 + var_1_18)))))) : 1)) && ((var_1_9 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=27, var_1_18=0, var_1_19=0, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=383, var_1_8=0] [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=27, var_1_18=0, var_1_19=0, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=383, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=27, var_1_18=0, var_1_19=0, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=383, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.1s, OverallIterations: 6, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 385 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 355 mSDsluCounter, 1323 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 843 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 971 IncrementalHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 480 mSDtfsCounter, 971 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 730 GetRequests, 676 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=360occurred in iteration=5, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 65 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1592 NumberOfCodeBlocks, 1592 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 861 ConstructedInterpolants, 1 QuantifiedInterpolants, 2970 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1302 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 5902/6072 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-05 20:35:02,683 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_codestructure_normal_file-42.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 b9a474490b26b75e32bf600e29c6590e80c0b8d4fd291d4937993f7ea2b0bba8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:35:04,941 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:35:05,029 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 20:35:05,034 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:35:05,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:35:05,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:35:05,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:35:05,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:35:05,098 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:35:05,099 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:35:05,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:35:05,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:35:05,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:35:05,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:35:05,100 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:35:05,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:35:05,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:35:05,100 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:35:05,100 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:35:05,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:35:05,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:35:05,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:35:05,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:35:05,101 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:35:05,101 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:35:05,101 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:35:05,101 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:35:05,101 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:35:05,101 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:35:05,101 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:35:05,101 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:35:05,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:35:05,101 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:35:05,101 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:35:05,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:35:05,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:35:05,102 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:35:05,102 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:35:05,102 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:35:05,102 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:35:05,102 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:35:05,102 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:35:05,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:35:05,102 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:35:05,103 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:35:05,103 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 -> b9a474490b26b75e32bf600e29c6590e80c0b8d4fd291d4937993f7ea2b0bba8 [2025-02-05 20:35:05,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:35:05,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:35:05,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:35:05,419 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:35:05,420 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:35:05,423 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-42.i [2025-02-05 20:35:06,799 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b9497fad/9afbdd35594b4b6bb6df4e666abe0892/FLAGa5557382d [2025-02-05 20:35:07,083 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:35:07,087 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-42.i [2025-02-05 20:35:07,098 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b9497fad/9afbdd35594b4b6bb6df4e666abe0892/FLAGa5557382d [2025-02-05 20:35:07,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b9497fad/9afbdd35594b4b6bb6df4e666abe0892 [2025-02-05 20:35:07,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:35:07,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:35:07,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:35:07,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:35:07,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:35:07,383 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:35:07" (1/1) ... [2025-02-05 20:35:07,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31714e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:35:07, skipping insertion in model container [2025-02-05 20:35:07,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:35:07" (1/1) ... [2025-02-05 20:35:07,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:35:07,538 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_codestructure_normal_file-42.i[913,926] [2025-02-05 20:35:07,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:35:07,604 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:35:07,614 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_codestructure_normal_file-42.i[913,926] [2025-02-05 20:35:07,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:35:07,657 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:35:07,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:35:07 WrapperNode [2025-02-05 20:35:07,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:35:07,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:35:07,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:35:07,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:35:07,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:35:07" (1/1) ... [2025-02-05 20:35:07,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:35:07" (1/1) ... [2025-02-05 20:35:07,719 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2025-02-05 20:35:07,719 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:35:07,723 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:35:07,723 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:35:07,723 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:35:07,738 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:35:07" (1/1) ... [2025-02-05 20:35:07,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:35:07" (1/1) ... [2025-02-05 20:35:07,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:35:07" (1/1) ... [2025-02-05 20:35:07,764 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-05 20:35:07,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:35:07" (1/1) ... [2025-02-05 20:35:07,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:35:07" (1/1) ... [2025-02-05 20:35:07,780 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:35:07" (1/1) ... [2025-02-05 20:35:07,784 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:35:07" (1/1) ... [2025-02-05 20:35:07,786 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:35:07" (1/1) ... [2025-02-05 20:35:07,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:35:07" (1/1) ... [2025-02-05 20:35:07,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:35:07,797 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:35:07,797 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:35:07,797 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:35:07,799 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:35:07" (1/1) ... [2025-02-05 20:35:07,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:35:07,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:35:07,832 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-05 20:35:07,837 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-05 20:35:07,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:35:07,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:35:07,860 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:35:07,860 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:35:07,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:35:07,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:35:07,918 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:35:07,920 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:35:08,336 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 20:35:08,336 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:35:08,348 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:35:08,348 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:35:08,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:35:08 BoogieIcfgContainer [2025-02-05 20:35:08,349 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:35:08,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:35:08,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:35:08,357 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:35:08,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:35:07" (1/3) ... [2025-02-05 20:35:08,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16008c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:35:08, skipping insertion in model container [2025-02-05 20:35:08,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:35:07" (2/3) ... [2025-02-05 20:35:08,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16008c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:35:08, skipping insertion in model container [2025-02-05 20:35:08,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:35:08" (3/3) ... [2025-02-05 20:35:08,361 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-42.i [2025-02-05 20:35:08,374 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:35:08,376 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-42.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:35:08,434 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:35:08,442 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;@782e422, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:35:08,443 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:35:08,447 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 20:35:08,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 20:35:08,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:35:08,461 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:35:08,461 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:35:08,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:35:08,467 INFO L85 PathProgramCache]: Analyzing trace with hash -78759324, now seen corresponding path program 1 times [2025-02-05 20:35:08,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:35:08,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [427617566] [2025-02-05 20:35:08,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:35:08,479 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-05 20:35:08,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:35:08,481 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-05 20:35:08,482 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-05 20:35:08,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:35:08,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:35:08,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:35:08,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:35:08,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:35:08,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:35:08,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2025-02-05 20:35:08,761 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:35:08,762 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:35:08,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [427617566] [2025-02-05 20:35:08,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [427617566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:35:08,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:35:08,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 20:35:08,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664655600] [2025-02-05 20:35:08,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:35:08,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:35:08,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:35:08,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:35:08,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:35:08,793 INFO L87 Difference]: Start difference. First operand has 65 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 20:35:08,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:35:08,817 INFO L93 Difference]: Finished difference Result 124 states and 218 transitions. [2025-02-05 20:35:08,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:35:08,819 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 144 [2025-02-05 20:35:08,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:35:08,824 INFO L225 Difference]: With dead ends: 124 [2025-02-05 20:35:08,824 INFO L226 Difference]: Without dead ends: 62 [2025-02-05 20:35:08,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 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-05 20:35:08,829 INFO L435 NwaCegarLoop]: 95 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, 95 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-05 20:35:08,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:35:08,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-05 20:35:08,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-02-05 20:35:08,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 20:35:08,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. [2025-02-05 20:35:08,877 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 144 [2025-02-05 20:35:08,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:35:08,878 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 95 transitions. [2025-02-05 20:35:08,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 20:35:08,879 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 95 transitions. [2025-02-05 20:35:08,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 20:35:08,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:35:08,884 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:35:08,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-05 20:35:09,084 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-05 20:35:09,085 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:35:09,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:35:09,086 INFO L85 PathProgramCache]: Analyzing trace with hash 610249413, now seen corresponding path program 1 times [2025-02-05 20:35:09,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:35:09,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385329156] [2025-02-05 20:35:09,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:35:09,087 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-05 20:35:09,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:35:09,090 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-05 20:35:09,091 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-05 20:35:09,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:35:09,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:35:09,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:35:09,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:35:09,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 20:35:09,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:35:09,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 20:35:09,355 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:35:09,355 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:35:09,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385329156] [2025-02-05 20:35:09,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385329156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:35:09,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:35:09,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:35:09,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828220278] [2025-02-05 20:35:09,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:35:09,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:35:09,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:35:09,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:35:09,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:35:09,360 INFO L87 Difference]: Start difference. First operand 62 states and 95 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 20:35:09,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:35:09,573 INFO L93 Difference]: Finished difference Result 137 states and 211 transitions. [2025-02-05 20:35:09,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:35:09,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 144 [2025-02-05 20:35:09,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:35:09,576 INFO L225 Difference]: With dead ends: 137 [2025-02-05 20:35:09,576 INFO L226 Difference]: Without dead ends: 78 [2025-02-05 20:35:09,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:35:09,577 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 21 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:35:09,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 184 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:35:09,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-05 20:35:09,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2025-02-05 20:35:09,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 20:35:09,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 104 transitions. [2025-02-05 20:35:09,588 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 104 transitions. Word has length 144 [2025-02-05 20:35:09,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:35:09,590 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 104 transitions. [2025-02-05 20:35:09,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 20:35:09,590 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 104 transitions. [2025-02-05 20:35:09,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 20:35:09,592 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:35:09,592 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:35:09,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-05 20:35:09,792 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-05 20:35:09,793 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:35:09,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:35:09,794 INFO L85 PathProgramCache]: Analyzing trace with hash -2106040094, now seen corresponding path program 1 times [2025-02-05 20:35:09,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:35:09,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188590950] [2025-02-05 20:35:09,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:35:09,795 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-05 20:35:09,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:35:09,797 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-05 20:35:09,798 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-05 20:35:09,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 20:35:10,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 20:35:10,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:35:10,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:35:10,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 20:35:10,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:35:10,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 486 proven. 42 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-02-05 20:35:10,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:35:12,277 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:35:12,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188590950] [2025-02-05 20:35:12,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188590950] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:35:12,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [246752379] [2025-02-05 20:35:12,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:35:12,278 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 20:35:12,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 20:35:12,280 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 20:35:12,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-02-05 20:35:12,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 20:35:12,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 20:35:12,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:35:12,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:35:12,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 20:35:12,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:35:15,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 486 proven. 42 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-02-05 20:35:15,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:35:16,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [246752379] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:35:16,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:35:16,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2025-02-05 20:35:16,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893456486] [2025-02-05 20:35:16,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 20:35:16,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:35:16,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:35:16,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:35:16,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:35:16,473 INFO L87 Difference]: Start difference. First operand 67 states and 104 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 20:35:18,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:35:18,495 INFO L93 Difference]: Finished difference Result 236 states and 361 transitions. [2025-02-05 20:35:18,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 20:35:18,495 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 145 [2025-02-05 20:35:18,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:35:18,499 INFO L225 Difference]: With dead ends: 236 [2025-02-05 20:35:18,500 INFO L226 Difference]: Without dead ends: 172 [2025-02-05 20:35:18,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2025-02-05 20:35:18,501 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 73 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:35:18,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 428 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 20:35:18,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-02-05 20:35:18,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 163. [2025-02-05 20:35:18,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 104 states have (on average 1.3173076923076923) internal successors, (137), 105 states have internal predecessors, (137), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 20:35:18,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2025-02-05 20:35:18,535 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 145 [2025-02-05 20:35:18,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:35:18,536 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2025-02-05 20:35:18,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 20:35:18,536 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2025-02-05 20:35:18,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 20:35:18,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:35:18,538 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:35:18,545 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-05 20:35:18,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-02-05 20:35:18,941 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,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-05 20:35:18,942 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:35:18,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:35:18,942 INFO L85 PathProgramCache]: Analyzing trace with hash -309088735, now seen corresponding path program 1 times [2025-02-05 20:35:18,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:35:18,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212973670] [2025-02-05 20:35:18,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:35:18,943 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-05 20:35:18,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:35:18,945 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-05 20:35:18,946 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-05 20:35:18,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 20:35:19,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 20:35:19,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:35:19,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:35:19,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 20:35:19,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:35:19,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 486 proven. 42 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-02-05 20:35:19,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:35:20,509 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:35:20,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212973670] [2025-02-05 20:35:20,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212973670] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:35:20,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1151672877] [2025-02-05 20:35:20,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:35:20,509 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 20:35:20,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 20:35:20,511 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 20:35:20,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-02-05 20:35:20,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 20:35:21,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 20:35:21,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:35:21,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:35:21,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 20:35:21,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:35:21,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 486 proven. 42 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-02-05 20:35:21,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:35:22,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1151672877] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:35:22,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:35:22,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2025-02-05 20:35:22,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839742648] [2025-02-05 20:35:22,152 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 20:35:22,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:35:22,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:35:22,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:35:22,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:35:22,153 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 20:35:25,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:35:25,006 INFO L93 Difference]: Finished difference Result 332 states and 492 transitions. [2025-02-05 20:35:25,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 20:35:25,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 145 [2025-02-05 20:35:25,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:35:25,011 INFO L225 Difference]: With dead ends: 332 [2025-02-05 20:35:25,011 INFO L226 Difference]: Without dead ends: 268 [2025-02-05 20:35:25,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2025-02-05 20:35:25,013 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 140 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:35:25,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 300 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 20:35:25,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-02-05 20:35:25,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 204. [2025-02-05 20:35:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 135 states have (on average 1.348148148148148) internal successors, (182), 137 states have internal predecessors, (182), 62 states have call successors, (62), 6 states have call predecessors, (62), 6 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-05 20:35:25,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 306 transitions. [2025-02-05 20:35:25,043 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 306 transitions. Word has length 145 [2025-02-05 20:35:25,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:35:25,044 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 306 transitions. [2025-02-05 20:35:25,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 20:35:25,044 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 306 transitions. [2025-02-05 20:35:25,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 20:35:25,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:35:25,046 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:35:25,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2025-02-05 20:35:25,253 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-05 20:35:25,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-05 20:35:25,447 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:35:25,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:35:25,448 INFO L85 PathProgramCache]: Analyzing trace with hash -505602240, now seen corresponding path program 1 times [2025-02-05 20:35:25,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:35:25,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394599670] [2025-02-05 20:35:25,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:35:25,448 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-05 20:35:25,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:35:25,464 INFO L229 MonitoredProcess]: Starting monitored process 8 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-05 20:35:25,465 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 (8)] Waiting until timeout for monitored process [2025-02-05 20:35:25,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 20:35:25,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 20:35:25,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:35:25,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:35:25,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 20:35:25,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:35:27,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 486 proven. 42 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-02-05 20:35:27,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:35:28,635 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:35:28,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394599670] [2025-02-05 20:35:28,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [394599670] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:35:28,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1109062298] [2025-02-05 20:35:28,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:35:28,636 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 20:35:28,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 20:35:28,639 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 20:35:28,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-02-05 20:35:28,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 20:35:29,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 20:35:29,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:35:29,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:35:29,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 20:35:29,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:35:31,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 486 proven. 42 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-02-05 20:35:31,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:35:31,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1109062298] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:35:31,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:35:31,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2025-02-05 20:35:31,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979824940] [2025-02-05 20:35:31,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 20:35:31,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:35:31,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:35:31,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:35:31,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:35:31,286 INFO L87 Difference]: Start difference. First operand 204 states and 306 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 20:35:34,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:35:34,032 INFO L93 Difference]: Finished difference Result 508 states and 759 transitions. [2025-02-05 20:35:34,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 20:35:34,033 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 145 [2025-02-05 20:35:34,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:35:34,039 INFO L225 Difference]: With dead ends: 508 [2025-02-05 20:35:34,039 INFO L226 Difference]: Without dead ends: 403 [2025-02-05 20:35:34,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=148, Invalid=272, Unknown=0, NotChecked=0, Total=420 [2025-02-05 20:35:34,041 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 103 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 20:35:34,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 449 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 20:35:34,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-02-05 20:35:34,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 388. [2025-02-05 20:35:34,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 250 states have (on average 1.324) internal successors, (331), 254 states have internal predecessors, (331), 124 states have call successors, (124), 13 states have call predecessors, (124), 13 states have return successors, (124), 120 states have call predecessors, (124), 124 states have call successors, (124) [2025-02-05 20:35:34,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 579 transitions. [2025-02-05 20:35:34,116 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 579 transitions. Word has length 145 [2025-02-05 20:35:34,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:35:34,116 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 579 transitions. [2025-02-05 20:35:34,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 20:35:34,117 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 579 transitions. [2025-02-05 20:35:34,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 20:35:34,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:35:34,119 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:35:34,127 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 (8)] Ended with exit code 0 [2025-02-05 20:35:34,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2025-02-05 20:35:34,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-05 20:35:34,520 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:35:34,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:35:34,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1018956384, now seen corresponding path program 1 times [2025-02-05 20:35:34,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:35:34,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554735342] [2025-02-05 20:35:34,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:35:34,521 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-05 20:35:34,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:35:34,524 INFO L229 MonitoredProcess]: Starting monitored process 10 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-05 20:35:34,526 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 (10)] Waiting until timeout for monitored process [2025-02-05 20:35:34,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 20:35:34,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 20:35:34,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:35:34,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:35:34,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 20:35:34,673 INFO L279 TraceCheckSpWp]: Computing forward predicates...