./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_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_variablewrapping_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 09f9b90ef6a2b1ab3909a18c4c3a547168931d170a359c3773d165496438e210 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:03:46,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:03:46,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:03:46,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:03:46,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:03:46,764 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:03:46,765 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:03:46,765 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:03:46,765 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:03:46,765 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:03:46,766 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:03:46,766 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:03:46,766 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:03:46,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:03:46,767 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:03:46,767 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:03:46,767 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:03:46,767 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:03:46,767 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:03:46,767 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:03:46,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:03:46,768 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:03:46,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:03:46,768 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:03:46,768 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:03:46,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:03:46,768 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:03:46,768 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:03:46,768 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:03:46,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:03:46,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:03:46,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:03:46,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:03:46,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:03:46,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:03:46,769 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:03:46,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:03:46,769 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:03:46,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:03:46,769 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:03:46,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:03:46,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:03:46,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:03:46,770 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 -> 09f9b90ef6a2b1ab3909a18c4c3a547168931d170a359c3773d165496438e210 [2025-02-06 03:03:46,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:03:46,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:03:46,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:03:46,993 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:03:46,993 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:03:46,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i [2025-02-06 03:03:48,196 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21facc5b4/3f9ff492b16b4dc8b885685de3bfc8e1/FLAG6a5999b05 [2025-02-06 03:03:48,425 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:03:48,425 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i [2025-02-06 03:03:48,432 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21facc5b4/3f9ff492b16b4dc8b885685de3bfc8e1/FLAG6a5999b05 [2025-02-06 03:03:48,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21facc5b4/3f9ff492b16b4dc8b885685de3bfc8e1 [2025-02-06 03:03:48,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:03:48,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:03:48,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:03:48,454 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:03:48,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:03:48,458 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:03:48" (1/1) ... [2025-02-06 03:03:48,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@470647e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:48, skipping insertion in model container [2025-02-06 03:03:48,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:03:48" (1/1) ... [2025-02-06 03:03:48,473 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:03:48,573 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i[913,926] [2025-02-06 03:03:48,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:03:48,616 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:03:48,624 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i[913,926] [2025-02-06 03:03:48,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:03:48,657 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:03:48,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:48 WrapperNode [2025-02-06 03:03:48,657 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:03:48,658 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:03:48,658 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:03:48,658 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:03:48,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:48" (1/1) ... [2025-02-06 03:03:48,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:48" (1/1) ... [2025-02-06 03:03:48,698 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2025-02-06 03:03:48,701 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:03:48,702 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:03:48,702 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:03:48,702 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:03:48,708 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:48" (1/1) ... [2025-02-06 03:03:48,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:48" (1/1) ... [2025-02-06 03:03:48,714 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:48" (1/1) ... [2025-02-06 03:03:48,730 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 03:03:48,732 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:48" (1/1) ... [2025-02-06 03:03:48,732 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:48" (1/1) ... [2025-02-06 03:03:48,736 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:48" (1/1) ... [2025-02-06 03:03:48,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:48" (1/1) ... [2025-02-06 03:03:48,740 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:48" (1/1) ... [2025-02-06 03:03:48,741 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:48" (1/1) ... [2025-02-06 03:03:48,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:03:48,747 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:03:48,747 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:03:48,747 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:03:48,748 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:48" (1/1) ... [2025-02-06 03:03:48,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:03:48,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:03:48,783 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:03:48,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:03:48,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:03:48,803 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:03:48,803 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:03:48,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:03:48,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:03:48,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:03:48,849 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:03:48,851 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:03:49,013 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-06 03:03:49,013 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:03:49,022 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:03:49,022 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:03:49,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:03:49 BoogieIcfgContainer [2025-02-06 03:03:49,022 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:03:49,024 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:03:49,024 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:03:49,028 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:03:49,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:03:48" (1/3) ... [2025-02-06 03:03:49,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7599864b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:03:49, skipping insertion in model container [2025-02-06 03:03:49,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:48" (2/3) ... [2025-02-06 03:03:49,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7599864b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:03:49, skipping insertion in model container [2025-02-06 03:03:49,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:03:49" (3/3) ... [2025-02-06 03:03:49,030 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-42.i [2025-02-06 03:03:49,042 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:03:49,043 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-42.i that has 2 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:03:49,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:03:49,096 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;@ea05b31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:03:49,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:03:49,099 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:03:49,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 03:03:49,106 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:03:49,106 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:03:49,107 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:03:49,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:03:49,111 INFO L85 PathProgramCache]: Analyzing trace with hash 782877060, now seen corresponding path program 1 times [2025-02-06 03:03:49,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:03:49,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949451676] [2025-02-06 03:03:49,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:03:49,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:03:49,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 03:03:49,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 03:03:49,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:03:49,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:03:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-06 03:03:49,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:03:49,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949451676] [2025-02-06 03:03:49,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949451676] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:03:49,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321541030] [2025-02-06 03:03:49,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:03:49,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:03:49,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:03:49,283 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:03:49,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:03:49,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 03:03:49,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 03:03:49,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:03:49,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:03:49,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:03:49,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:03:49,394 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-06 03:03:49,396 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:03:49,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321541030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:03:49,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:03:49,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:03:49,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833232491] [2025-02-06 03:03:49,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:03:49,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:03:49,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:03:49,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:03:49,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:03:49,417 INFO L87 Difference]: Start difference. First operand has 40 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:03:49,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:03:49,433 INFO L93 Difference]: Finished difference Result 74 states and 120 transitions. [2025-02-06 03:03:49,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:03:49,435 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 74 [2025-02-06 03:03:49,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:03:49,439 INFO L225 Difference]: With dead ends: 74 [2025-02-06 03:03:49,439 INFO L226 Difference]: Without dead ends: 37 [2025-02-06 03:03:49,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:03:49,443 INFO L435 NwaCegarLoop]: 50 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, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:03:49,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:03:49,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-06 03:03:49,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-06 03:03:49,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:03:49,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2025-02-06 03:03:49,467 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 74 [2025-02-06 03:03:49,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:03:49,468 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2025-02-06 03:03:49,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:03:49,468 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2025-02-06 03:03:49,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 03:03:49,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:03:49,470 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:03:49,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 03:03:49,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:03:49,674 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:03:49,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:03:49,675 INFO L85 PathProgramCache]: Analyzing trace with hash 764048546, now seen corresponding path program 1 times [2025-02-06 03:03:49,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:03:49,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617379004] [2025-02-06 03:03:49,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:03:49,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:03:49,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 03:03:49,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 03:03:49,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:03:49,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:03:49,769 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:03:49,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 03:03:49,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 03:03:49,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:03:49,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:03:49,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:03:49,838 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:03:49,839 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:03:49,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:03:49,842 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 03:03:49,869 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:03:49,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:03:49 BoogieIcfgContainer [2025-02-06 03:03:49,874 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:03:49,875 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:03:49,875 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:03:49,875 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:03:49,875 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:03:49" (3/4) ... [2025-02-06 03:03:49,877 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:03:49,877 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:03:49,879 INFO L158 Benchmark]: Toolchain (without parser) took 1427.62ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 93.0MB in the end (delta: 12.3MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2025-02-06 03:03:49,880 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:03:49,880 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.78ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 92.4MB in the end (delta: 12.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:03:49,880 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.63ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 89.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:03:49,881 INFO L158 Benchmark]: Boogie Preprocessor took 44.54ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 87.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:03:49,881 INFO L158 Benchmark]: IcfgBuilder took 275.50ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 72.0MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:03:49,882 INFO L158 Benchmark]: TraceAbstraction took 849.95ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 93.8MB in the end (delta: -22.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:03:49,882 INFO L158 Benchmark]: Witness Printer took 2.43ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 93.0MB in the end (delta: 783.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:03:49,884 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.23ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.78ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 92.4MB in the end (delta: 12.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.63ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 89.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.54ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 87.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 275.50ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 72.0MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 849.95ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 93.8MB in the end (delta: -22.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.43ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 93.0MB in the end (delta: 783.8kB). 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 37, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 43, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 54. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -1; [L23] unsigned char var_1_8 = 5; [L24] unsigned char var_1_9 = 4; [L25] float var_1_10 = 16.5; [L26] float var_1_11 = 127.25; [L27] unsigned char var_1_12 = 1; [L28] unsigned char var_1_13 = 0; [L29] unsigned char var_1_15 = 0; [L30] unsigned char var_1_16 = 0; [L31] unsigned char var_1_17 = 0; [L32] unsigned char var_1_18 = 0; VAL [isInitial=0, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=4] [L86] isInitial = 1 [L87] FCALL initially() [L88] COND TRUE 1 [L89] FCALL updateLastVariables() [L90] CALL updateVariables() [L61] var_1_9 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5] [L62] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5] [L63] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L63] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L64] var_1_11 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L65] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L66] var_1_13 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L67] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L68] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L68] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L69] var_1_15 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L70] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L71] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L71] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L72] var_1_16 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L73] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L74] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L74] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L75] var_1_18 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L76] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L77] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-256, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-256, var_1_1=-1, var_1_8=5, var_1_9=127] [L77] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-256, var_1_1=-1, var_1_8=5, var_1_9=127] [L90] RET updateVariables() [L91] CALL step() [L36] var_1_8 = (var_1_9 + 100) [L37] var_1_10 = ((((var_1_11) < (64.15f)) ? (var_1_11) : (64.15f))) VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-256, var_1_1=-1, var_1_8=227, var_1_9=127] [L38] COND FALSE !(var_1_8 > var_1_8) [L41] var_1_1 = (((((var_1_8 - var_1_8)) > ((var_1_8 - var_1_8))) ? ((var_1_8 - var_1_8)) : ((var_1_8 - var_1_8)))) VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-256, var_1_1=0, var_1_8=227, var_1_9=127] [L43] COND TRUE var_1_11 <= var_1_10 VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-256, var_1_1=0, var_1_8=227, var_1_9=127] [L44] COND TRUE var_1_1 != var_1_8 [L45] var_1_17 = var_1_18 VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=-256, var_1_1=0, var_1_8=227, var_1_9=127] [L54] COND TRUE (- var_1_10) > var_1_11 [L55] var_1_12 = (var_1_13 || (var_1_17 && (var_1_15 || var_1_16))) VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=0, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=-256, var_1_1=0, var_1_8=227, var_1_9=127] [L91] RET step() [L92] CALL, EXPR property() [L82-L83] return (((((var_1_8 > var_1_8) ? (var_1_1 == ((signed long int) (((((var_1_8) < (var_1_8)) ? (var_1_8) : (var_1_8))) - 10))) : (var_1_1 == ((signed long int) (((((var_1_8 - var_1_8)) > ((var_1_8 - var_1_8))) ? ((var_1_8 - var_1_8)) : ((var_1_8 - var_1_8))))))) && (var_1_8 == ((unsigned char) (var_1_9 + 100)))) && (var_1_10 == ((float) ((((var_1_11) < (64.15f)) ? (var_1_11) : (64.15f)))))) && (((- var_1_10) > var_1_11) ? (var_1_12 == ((unsigned char) (var_1_13 || (var_1_17 && (var_1_15 || var_1_16))))) : (var_1_12 == ((unsigned char) ((var_1_1 <= var_1_9) && var_1_16))))) && ((var_1_11 <= var_1_10) ? ((var_1_1 != var_1_8) ? (var_1_17 == ((unsigned char) var_1_18)) : 1) : ((var_1_8 <= 1000000) ? (var_1_17 == ((unsigned char) 0)) : (var_1_17 == ((unsigned char) 0)))) ; VAL [\result=0, isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=0, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=-256, var_1_1=0, var_1_8=227, var_1_9=127] [L92] RET, EXPR property() [L92] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=0, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=-256, var_1_1=0, var_1_8=227, var_1_9=127] [L19] reach_error() VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=0, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=-256, var_1_1=0, var_1_8=227, var_1_9=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 50 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 179 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 420/440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 03:03:49,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-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 09f9b90ef6a2b1ab3909a18c4c3a547168931d170a359c3773d165496438e210 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:03:51,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:03:52,010 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:03:52,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:03:52,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:03:52,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:03:52,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:03:52,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:03:52,043 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:03:52,043 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:03:52,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:03:52,043 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:03:52,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:03:52,044 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:03:52,044 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:03:52,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:03:52,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:03:52,045 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:03:52,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:03:52,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:03:52,045 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:03:52,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:03:52,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:03:52,045 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:03:52,045 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:03:52,046 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:03:52,046 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:03:52,046 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:03:52,046 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:03:52,046 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:03:52,047 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:03:52,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:03:52,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:03:52,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:03:52,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:03:52,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:03:52,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:03:52,047 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:03:52,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:03:52,047 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:03:52,048 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:03:52,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:03:52,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:03:52,048 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:03:52,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:03:52,048 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 -> 09f9b90ef6a2b1ab3909a18c4c3a547168931d170a359c3773d165496438e210 [2025-02-06 03:03:52,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:03:52,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:03:52,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:03:52,317 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:03:52,317 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:03:52,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i [2025-02-06 03:03:53,607 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30b176ba8/13e17cc5e52b413794fd75c6420d8af3/FLAG1b118ae9b [2025-02-06 03:03:53,780 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:03:53,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i [2025-02-06 03:03:53,788 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30b176ba8/13e17cc5e52b413794fd75c6420d8af3/FLAG1b118ae9b [2025-02-06 03:03:53,801 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30b176ba8/13e17cc5e52b413794fd75c6420d8af3 [2025-02-06 03:03:53,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:03:53,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:03:53,805 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:03:53,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:03:53,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:03:53,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:03:53" (1/1) ... [2025-02-06 03:03:53,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@799fe5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:53, skipping insertion in model container [2025-02-06 03:03:53,810 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:03:53" (1/1) ... [2025-02-06 03:03:53,820 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:03:53,927 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i[913,926] [2025-02-06 03:03:53,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:03:53,987 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:03:53,997 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i[913,926] [2025-02-06 03:03:54,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:03:54,034 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:03:54,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:54 WrapperNode [2025-02-06 03:03:54,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:03:54,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:03:54,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:03:54,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:03:54,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:54" (1/1) ... [2025-02-06 03:03:54,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:54" (1/1) ... [2025-02-06 03:03:54,062 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2025-02-06 03:03:54,062 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:03:54,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:03:54,063 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:03:54,063 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:03:54,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:54" (1/1) ... [2025-02-06 03:03:54,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:54" (1/1) ... [2025-02-06 03:03:54,070 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:54" (1/1) ... [2025-02-06 03:03:54,079 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 03:03:54,079 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:54" (1/1) ... [2025-02-06 03:03:54,079 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:54" (1/1) ... [2025-02-06 03:03:54,083 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:54" (1/1) ... [2025-02-06 03:03:54,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:54" (1/1) ... [2025-02-06 03:03:54,084 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:54" (1/1) ... [2025-02-06 03:03:54,085 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:54" (1/1) ... [2025-02-06 03:03:54,087 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:03:54,087 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:03:54,087 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:03:54,087 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:03:54,088 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:54" (1/1) ... [2025-02-06 03:03:54,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:03:54,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:03:54,124 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:03:54,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:03:54,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:03:54,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:03:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:03:54,151 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:03:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:03:54,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:03:54,226 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:03:54,229 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:03:54,377 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-06 03:03:54,377 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:03:54,383 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:03:54,384 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:03:54,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:03:54 BoogieIcfgContainer [2025-02-06 03:03:54,384 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:03:54,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:03:54,386 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:03:54,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:03:54,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:03:53" (1/3) ... [2025-02-06 03:03:54,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46395065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:03:54, skipping insertion in model container [2025-02-06 03:03:54,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:03:54" (2/3) ... [2025-02-06 03:03:54,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46395065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:03:54, skipping insertion in model container [2025-02-06 03:03:54,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:03:54" (3/3) ... [2025-02-06 03:03:54,392 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-42.i [2025-02-06 03:03:54,402 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:03:54,404 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-42.i that has 2 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:03:54,437 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:03:54,445 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;@1167cda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:03:54,445 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:03:54,448 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:03:54,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 03:03:54,453 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:03:54,454 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:03:54,454 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:03:54,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:03:54,458 INFO L85 PathProgramCache]: Analyzing trace with hash 782877060, now seen corresponding path program 1 times [2025-02-06 03:03:54,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:03:54,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729076231] [2025-02-06 03:03:54,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:03:54,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:03:54,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:03:54,469 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:03:54,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 03:03:54,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 03:03:54,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 03:03:54,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:03:54,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:03:54,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:03:54,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:03:54,589 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-06 03:03:54,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:03:54,590 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:03:54,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729076231] [2025-02-06 03:03:54,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729076231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:03:54,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:03:54,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:03:54,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803860745] [2025-02-06 03:03:54,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:03:54,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:03:54,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:03:54,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:03:54,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:03:54,614 INFO L87 Difference]: Start difference. First operand has 40 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:03:54,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:03:54,632 INFO L93 Difference]: Finished difference Result 74 states and 120 transitions. [2025-02-06 03:03:54,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:03:54,633 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 74 [2025-02-06 03:03:54,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:03:54,638 INFO L225 Difference]: With dead ends: 74 [2025-02-06 03:03:54,639 INFO L226 Difference]: Without dead ends: 37 [2025-02-06 03:03:54,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:03:54,644 INFO L435 NwaCegarLoop]: 50 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, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:03:54,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:03:54,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-06 03:03:54,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-06 03:03:54,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:03:54,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2025-02-06 03:03:54,669 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 74 [2025-02-06 03:03:54,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:03:54,669 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2025-02-06 03:03:54,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:03:54,670 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2025-02-06 03:03:54,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 03:03:54,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:03:54,672 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:03:54,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 03:03:54,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:03:54,873 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:03:54,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:03:54,874 INFO L85 PathProgramCache]: Analyzing trace with hash 764048546, now seen corresponding path program 1 times [2025-02-06 03:03:54,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:03:54,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666690939] [2025-02-06 03:03:54,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:03:54,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:03:54,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:03:54,878 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:03:54,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 03:03:54,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 03:03:54,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 03:03:54,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:03:54,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:03:54,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 03:03:55,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:04:08,305 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 159 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-06 03:04:08,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:04:31,693 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-02-06 03:04:31,694 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:04:31,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666690939] [2025-02-06 03:04:31,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666690939] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:04:31,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:04:31,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2025-02-06 03:04:31,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995755907] [2025-02-06 03:04:31,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:04:31,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-06 03:04:31,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:04:31,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-06 03:04:31,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2025-02-06 03:04:31,698 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 32 states, 32 states have (on average 1.8125) internal successors, (58), 32 states have internal predecessors, (58), 5 states have call successors, (17), 4 states have call predecessors, (17), 10 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2025-02-06 03:04:33,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:04:33,449 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2025-02-06 03:04:33,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-06 03:04:33,450 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.8125) internal successors, (58), 32 states have internal predecessors, (58), 5 states have call successors, (17), 4 states have call predecessors, (17), 10 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 74 [2025-02-06 03:04:33,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:04:33,455 INFO L225 Difference]: With dead ends: 83 [2025-02-06 03:04:33,455 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 03:04:33,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=617, Invalid=1933, Unknown=0, NotChecked=0, Total=2550 [2025-02-06 03:04:33,457 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 185 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:04:33,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 202 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:04:33,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 03:04:33,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 53. [2025-02-06 03:04:33,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:04:33,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2025-02-06 03:04:33,470 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 74 [2025-02-06 03:04:33,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:04:33,470 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2025-02-06 03:04:33,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.8125) internal successors, (58), 32 states have internal predecessors, (58), 5 states have call successors, (17), 4 states have call predecessors, (17), 10 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2025-02-06 03:04:33,471 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2025-02-06 03:04:33,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 03:04:33,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:04:33,474 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:04:33,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-06 03:04:33,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:04:33,678 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:04:33,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:04:33,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1708810529, now seen corresponding path program 1 times [2025-02-06 03:04:33,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:04:33,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003918616] [2025-02-06 03:04:33,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:04:33,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:04:33,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:04:33,684 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:04:33,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 03:04:33,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 03:04:33,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 03:04:33,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:04:33,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:04:33,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 03:04:33,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:04:34,223 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 159 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-06 03:04:34,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:04:56,420 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:04:56,420 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:04:56,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003918616] [2025-02-06 03:04:56,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003918616] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:04:56,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:04:56,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 21 [2025-02-06 03:04:56,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883592492] [2025-02-06 03:04:56,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:04:56,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:04:56,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:04:56,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:04:56,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:04:56,423 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:04:57,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:04:57,905 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2025-02-06 03:04:57,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:04:57,906 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2025-02-06 03:04:57,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:04:57,907 INFO L225 Difference]: With dead ends: 71 [2025-02-06 03:04:57,907 INFO L226 Difference]: Without dead ends: 69 [2025-02-06 03:04:57,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:04:57,908 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 32 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:04:57,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 200 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:04:57,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-06 03:04:57,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 57. [2025-02-06 03:04:57,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:04:57,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2025-02-06 03:04:57,918 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 74 [2025-02-06 03:04:57,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:04:57,919 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2025-02-06 03:04:57,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:04:57,919 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2025-02-06 03:04:57,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 03:04:57,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:04:57,921 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:04:57,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-02-06 03:04:58,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:04:58,121 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:04:58,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:04:58,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1709734050, now seen corresponding path program 1 times [2025-02-06 03:04:58,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:04:58,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600860917] [2025-02-06 03:04:58,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:04:58,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:04:58,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:04:58,127 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:04:58,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-06 03:04:58,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 03:04:58,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 03:04:58,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:04:58,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:04:58,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 03:04:58,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:05:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-02-06 03:05:15,883 INFO L312 TraceCheckSpWp]: Computing backward predicates...