./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-29.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 5ee0f2b669f52dc2ec9ba8ed67fd3d51fd0faec67e2228451bf3cfc69d5760a0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:08:03,823 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:08:03,896 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:08:03,904 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:08:03,904 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:08:03,931 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:08:03,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:08:03,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:08:03,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:08:03,933 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:08:03,934 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:08:03,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:08:03,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:08:03,935 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:08:03,935 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:08:03,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:08:03,936 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:08:03,936 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:08:03,936 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:08:03,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:08:03,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:08:03,936 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:08:03,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:08:03,937 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:08:03,937 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:08:03,937 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:08:03,937 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:08:03,937 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:08:03,937 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:08:03,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:08:03,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:08:03,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:08:03,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:08:03,938 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:08:03,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:08:03,938 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:08:03,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:08:03,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:08:03,939 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:08:03,939 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:08:03,939 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:08:03,939 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:08:03,939 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:08:03,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:08:03,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:08:03,939 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:08:03,939 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:08:03,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:08:03,940 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 -> 5ee0f2b669f52dc2ec9ba8ed67fd3d51fd0faec67e2228451bf3cfc69d5760a0 [2025-01-09 15:08:04,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:08:04,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:08:04,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:08:04,242 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:08:04,243 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:08:04,244 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-29.i [2025-01-09 15:08:05,547 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3003441ce/199bdfab3f234c9b8a3a1a7af2256d65/FLAG6ee1fe05a [2025-01-09 15:08:05,808 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:08:05,808 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-29.i [2025-01-09 15:08:05,814 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3003441ce/199bdfab3f234c9b8a3a1a7af2256d65/FLAG6ee1fe05a [2025-01-09 15:08:05,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3003441ce/199bdfab3f234c9b8a3a1a7af2256d65 [2025-01-09 15:08:05,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:08:05,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:08:05,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:08:05,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:08:05,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:08:05,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:08:05" (1/1) ... [2025-01-09 15:08:05,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7796b211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:05, skipping insertion in model container [2025-01-09 15:08:05,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:08:05" (1/1) ... [2025-01-09 15:08:05,854 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:08:05,990 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-29.i[913,926] [2025-01-09 15:08:06,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:08:06,051 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:08:06,061 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-29.i[913,926] [2025-01-09 15:08:06,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:08:06,098 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:08:06,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:06 WrapperNode [2025-01-09 15:08:06,099 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:08:06,100 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:08:06,100 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:08:06,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:08:06,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:06" (1/1) ... [2025-01-09 15:08:06,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:06" (1/1) ... [2025-01-09 15:08:06,147 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 75 [2025-01-09 15:08:06,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:08:06,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:08:06,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:08:06,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:08:06,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:06" (1/1) ... [2025-01-09 15:08:06,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:06" (1/1) ... [2025-01-09 15:08:06,161 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:06" (1/1) ... [2025-01-09 15:08:06,186 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-01-09 15:08:06,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:06" (1/1) ... [2025-01-09 15:08:06,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:06" (1/1) ... [2025-01-09 15:08:06,191 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:06" (1/1) ... [2025-01-09 15:08:06,197 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:06" (1/1) ... [2025-01-09 15:08:06,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:06" (1/1) ... [2025-01-09 15:08:06,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:06" (1/1) ... [2025-01-09 15:08:06,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:06" (1/1) ... [2025-01-09 15:08:06,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:08:06,211 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:08:06,211 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:08:06,214 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:08:06,215 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:06" (1/1) ... [2025-01-09 15:08:06,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:08:06,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:08:06,243 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-01-09 15:08:06,250 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-01-09 15:08:06,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:08:06,267 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:08:06,267 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:08:06,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:08:06,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:08:06,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:08:06,316 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:08:06,318 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:08:06,486 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 15:08:06,486 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:08:06,497 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:08:06,498 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:08:06,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:08:06 BoogieIcfgContainer [2025-01-09 15:08:06,498 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:08:06,500 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:08:06,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:08:06,503 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:08:06,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:08:05" (1/3) ... [2025-01-09 15:08:06,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2192ea38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:08:06, skipping insertion in model container [2025-01-09 15:08:06,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:06" (2/3) ... [2025-01-09 15:08:06,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2192ea38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:08:06, skipping insertion in model container [2025-01-09 15:08:06,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:08:06" (3/3) ... [2025-01-09 15:08:06,505 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-29.i [2025-01-09 15:08:06,518 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:08:06,521 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-29.i that has 2 procedures, 36 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:08:06,577 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:08:06,588 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;@56c30ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:08:06,589 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:08:06,593 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 15:08:06,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 15:08:06,601 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:08:06,601 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 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-01-09 15:08:06,602 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:08:06,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:08:06,605 INFO L85 PathProgramCache]: Analyzing trace with hash 752146727, now seen corresponding path program 1 times [2025-01-09 15:08:06,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:08:06,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330117763] [2025-01-09 15:08:06,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:08:06,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:08:06,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 15:08:06,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 15:08:06,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:08:06,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:08:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 15:08:06,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:08:06,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330117763] [2025-01-09 15:08:06,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330117763] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:08:06,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068762543] [2025-01-09 15:08:06,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:08:06,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:08:06,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:08:06,810 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-01-09 15:08:06,812 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-01-09 15:08:06,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 15:08:06,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 15:08:06,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:08:06,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:08:06,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:08:06,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:08:06,951 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 15:08:06,951 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:08:06,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068762543] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:08:06,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:08:06,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:08:06,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318920143] [2025-01-09 15:08:06,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:08:06,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:08:06,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:08:06,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:08:06,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:08:06,972 INFO L87 Difference]: Start difference. First operand has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 15:08:06,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:08:06,985 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2025-01-09 15:08:06,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:08:06,987 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2025-01-09 15:08:06,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:08:06,992 INFO L225 Difference]: With dead ends: 66 [2025-01-09 15:08:06,992 INFO L226 Difference]: Without dead ends: 33 [2025-01-09 15:08:06,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 49 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-01-09 15:08:06,996 INFO L435 NwaCegarLoop]: 45 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, 45 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-01-09 15:08:06,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:08:07,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-09 15:08:07,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-01-09 15:08:07,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 15:08:07,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2025-01-09 15:08:07,026 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 48 [2025-01-09 15:08:07,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:08:07,026 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2025-01-09 15:08:07,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 15:08:07,027 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2025-01-09 15:08:07,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 15:08:07,028 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:08:07,028 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 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-01-09 15:08:07,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:08:07,229 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-01-09 15:08:07,229 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:08:07,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:08:07,230 INFO L85 PathProgramCache]: Analyzing trace with hash -996972885, now seen corresponding path program 1 times [2025-01-09 15:08:07,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:08:07,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345422922] [2025-01-09 15:08:07,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:08:07,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:08:07,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 15:08:07,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 15:08:07,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:08:07,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:08:07,333 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:08:07,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 15:08:07,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 15:08:07,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:08:07,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:08:07,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:08:07,415 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:08:07,417 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:08:07,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:08:07,421 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 15:08:07,462 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:08:07,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:08:07 BoogieIcfgContainer [2025-01-09 15:08:07,465 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:08:07,465 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:08:07,465 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:08:07,466 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:08:07,466 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:08:06" (3/4) ... [2025-01-09 15:08:07,468 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:08:07,469 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:08:07,470 INFO L158 Benchmark]: Toolchain (without parser) took 1639.78ms. Allocated memory is still 167.8MB. Free memory was 133.1MB in the beginning and 60.4MB in the end (delta: 72.7MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-01-09 15:08:07,470 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:08:07,470 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.93ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 120.6MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:08:07,470 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.18ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 118.7MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:08:07,471 INFO L158 Benchmark]: Boogie Preprocessor took 62.71ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 115.5MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:08:07,472 INFO L158 Benchmark]: RCFGBuilder took 287.48ms. Allocated memory is still 167.8MB. Free memory was 115.5MB in the beginning and 101.9MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:08:07,472 INFO L158 Benchmark]: TraceAbstraction took 964.76ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 60.9MB in the end (delta: 40.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 15:08:07,472 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 167.8MB. Free memory is still 60.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:08:07,473 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.47ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.93ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 120.6MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.18ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 118.7MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.71ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 115.5MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 287.48ms. Allocated memory is still 167.8MB. Free memory was 115.5MB in the beginning and 101.9MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 964.76ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 60.9MB in the end (delta: 40.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 167.8MB. Free memory is still 60.4MB. 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 65, overapproximation of someBinaryFLOATComparisonOperation at line 57, overapproximation of someBinaryFLOATComparisonOperation at line 50, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 44. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 2.5; [L23] float var_1_3 = 9.3; [L24] float var_1_4 = 3.4; [L25] unsigned short int var_1_5 = 32; [L26] unsigned short int var_1_9 = 1; [L27] unsigned char var_1_10 = 8; [L28] unsigned char var_1_11 = 5; [L29] unsigned char var_1_12 = 1; [L30] unsigned char var_1_13 = 1; [L31] unsigned char var_1_14 = 8; VAL [isInitial=0, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_3=93/10, var_1_4=17/5, var_1_5=32, var_1_9=1] [L80] isInitial = 1 [L81] FCALL initially() [L83] FCALL updateLastVariables() [L84] CALL updateVariables() [L62] var_1_3 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_4=17/5, var_1_5=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_4=17/5, var_1_5=32, var_1_9=1] [L63] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_4=17/5, var_1_5=32, var_1_9=1] [L64] var_1_4 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L65] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L66] var_1_11 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L67] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=8, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L68] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L68] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L69] var_1_13 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=-255, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=-255, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L70] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=-255, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L71] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=-255, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=-255, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L71] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=-255, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L84] RET updateVariables() [L85] CALL step() [L35] var_1_12 = var_1_13 [L36] var_1_14 = var_1_11 VAL [isInitial=1, var_1_10=8, var_1_11=254, var_1_12=-255, var_1_13=-255, var_1_14=254, var_1_1=5/2, var_1_5=32, var_1_9=1] [L37] COND TRUE \read(var_1_12) [L38] var_1_1 = var_1_3 VAL [isInitial=1, var_1_10=8, var_1_11=254, var_1_12=-255, var_1_13=-255, var_1_14=254, var_1_1=1275, var_1_3=1275, var_1_5=32, var_1_9=1] [L44] COND TRUE (var_1_1 + 8.125) > (var_1_1 * var_1_3) [L45] var_1_5 = (((((var_1_14 + var_1_14)) > (var_1_14)) ? ((var_1_14 + var_1_14)) : (var_1_14))) VAL [isInitial=1, var_1_10=8, var_1_11=254, var_1_12=-255, var_1_13=-255, var_1_14=254, var_1_1=1275, var_1_3=1275, var_1_5=508, var_1_9=1] [L49] signed long int stepLocal_0 = 5 * var_1_14; VAL [isInitial=1, stepLocal_0=1270, var_1_10=8, var_1_11=254, var_1_12=-255, var_1_13=-255, var_1_14=254, var_1_1=1275, var_1_3=1275, var_1_5=508, var_1_9=1] [L50] COND FALSE !(((((var_1_3) < (var_1_1)) ? (var_1_3) : (var_1_1))) == var_1_1) VAL [isInitial=1, stepLocal_0=1270, var_1_10=8, var_1_11=254, var_1_12=-255, var_1_13=-255, var_1_14=254, var_1_1=1275, var_1_3=1275, var_1_5=508, var_1_9=1] [L57] COND TRUE var_1_1 < var_1_3 [L58] var_1_10 = var_1_11 VAL [isInitial=1, stepLocal_0=1270, var_1_10=254, var_1_11=254, var_1_12=-255, var_1_13=-255, var_1_14=254, var_1_1=1275, var_1_3=1275, var_1_5=508, var_1_9=1] [L85] RET step() [L86] CALL, EXPR property() [L76-L77] return (((((var_1_12 ? (var_1_1 == ((float) var_1_3)) : ((! (var_1_3 < var_1_4)) ? (var_1_1 == ((float) ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) : 1)) && (((var_1_1 + 8.125) > (var_1_1 * var_1_3)) ? (var_1_5 == ((unsigned short int) (((((var_1_14 + var_1_14)) > (var_1_14)) ? ((var_1_14 + var_1_14)) : (var_1_14))))) : (var_1_5 == ((unsigned short int) var_1_14)))) && ((((((var_1_3) < (var_1_1)) ? (var_1_3) : (var_1_1))) == var_1_1) ? ((var_1_14 > (5 * var_1_14)) ? ((var_1_1 < (var_1_1 * 256.5f)) ? (var_1_9 == ((unsigned short int) var_1_14)) : 1) : 1) : 1)) && ((var_1_1 < var_1_3) ? (var_1_10 == ((unsigned char) var_1_11)) : 1)) && (var_1_12 == ((unsigned char) var_1_13))) && (var_1_14 == ((unsigned char) var_1_11)) ; VAL [\result=0, isInitial=1, var_1_10=254, var_1_11=254, var_1_12=-255, var_1_13=-255, var_1_14=254, var_1_1=1275, var_1_3=1275, var_1_5=508, var_1_9=1] [L86] RET, EXPR property() [L86] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=254, var_1_11=254, var_1_12=-255, var_1_13=-255, var_1_14=254, var_1_1=1275, var_1_3=1275, var_1_5=508, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=254, var_1_11=254, var_1_12=-255, var_1_13=-255, var_1_14=254, var_1_1=1275, var_1_3=1275, var_1_5=508, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 6, 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, 45 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, 45 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 94 SizeOfPredicates, 0 NumberOfNonLiveVariables, 134 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 110/120 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-01-09 15:08:07,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-29.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 5ee0f2b669f52dc2ec9ba8ed67fd3d51fd0faec67e2228451bf3cfc69d5760a0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:08:09,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:08:09,810 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:08:09,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:08:09,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:08:09,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:08:09,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:08:09,845 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:08:09,845 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:08:09,845 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:08:09,845 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:08:09,845 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:08:09,845 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:08:09,846 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:08:09,846 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:08:09,846 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:08:09,846 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:08:09,846 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:08:09,846 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:08:09,846 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:08:09,846 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:08:09,846 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:08:09,846 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:08:09,846 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:08:09,846 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:08:09,846 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:08:09,847 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:08:09,847 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:08:09,847 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:08:09,847 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:08:09,847 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:08:09,847 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:08:09,848 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:08:09,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:08:09,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:08:09,848 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:08:09,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:08:09,848 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:08:09,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:08:09,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:08:09,849 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:08:09,849 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:08:09,849 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:08:09,849 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:08:09,849 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:08:09,849 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:08:09,849 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:08:09,849 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:08:09,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:08:09,850 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:08:09,850 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 -> 5ee0f2b669f52dc2ec9ba8ed67fd3d51fd0faec67e2228451bf3cfc69d5760a0 [2025-01-09 15:08:10,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:08:10,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:08:10,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:08:10,174 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:08:10,174 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:08:10,175 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-29.i [2025-01-09 15:08:11,505 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7b180bea/12c98f9462b54c179ced3d010fe98dea/FLAGde7c7e941 [2025-01-09 15:08:11,741 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:08:11,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-29.i [2025-01-09 15:08:11,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7b180bea/12c98f9462b54c179ced3d010fe98dea/FLAGde7c7e941 [2025-01-09 15:08:11,773 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7b180bea/12c98f9462b54c179ced3d010fe98dea [2025-01-09 15:08:11,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:08:11,777 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:08:11,778 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:08:11,778 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:08:11,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:08:11,783 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:08:11" (1/1) ... [2025-01-09 15:08:11,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d844d9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:11, skipping insertion in model container [2025-01-09 15:08:11,784 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:08:11" (1/1) ... [2025-01-09 15:08:11,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:08:11,930 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-29.i[913,926] [2025-01-09 15:08:11,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:08:11,994 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:08:12,007 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-29.i[913,926] [2025-01-09 15:08:12,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:08:12,052 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:08:12,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:12 WrapperNode [2025-01-09 15:08:12,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:08:12,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:08:12,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:08:12,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:08:12,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:12" (1/1) ... [2025-01-09 15:08:12,076 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:12" (1/1) ... [2025-01-09 15:08:12,100 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 75 [2025-01-09 15:08:12,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:08:12,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:08:12,102 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:08:12,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:08:12,110 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:12" (1/1) ... [2025-01-09 15:08:12,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:12" (1/1) ... [2025-01-09 15:08:12,113 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:12" (1/1) ... [2025-01-09 15:08:12,129 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-01-09 15:08:12,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:12" (1/1) ... [2025-01-09 15:08:12,130 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:12" (1/1) ... [2025-01-09 15:08:12,141 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:12" (1/1) ... [2025-01-09 15:08:12,143 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:12" (1/1) ... [2025-01-09 15:08:12,148 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:12" (1/1) ... [2025-01-09 15:08:12,150 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:12" (1/1) ... [2025-01-09 15:08:12,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:12" (1/1) ... [2025-01-09 15:08:12,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:08:12,157 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:08:12,157 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:08:12,157 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:08:12,162 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:12" (1/1) ... [2025-01-09 15:08:12,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:08:12,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:08:12,196 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-01-09 15:08:12,203 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-01-09 15:08:12,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:08:12,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:08:12,224 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:08:12,224 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:08:12,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:08:12,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:08:12,296 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:08:12,298 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:08:20,701 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 15:08:20,701 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:08:20,709 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:08:20,710 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:08:20,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:08:20 BoogieIcfgContainer [2025-01-09 15:08:20,710 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:08:20,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:08:20,714 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:08:20,719 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:08:20,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:08:11" (1/3) ... [2025-01-09 15:08:20,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea701cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:08:20, skipping insertion in model container [2025-01-09 15:08:20,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:08:12" (2/3) ... [2025-01-09 15:08:20,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea701cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:08:20, skipping insertion in model container [2025-01-09 15:08:20,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:08:20" (3/3) ... [2025-01-09 15:08:20,722 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-29.i [2025-01-09 15:08:20,732 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:08:20,733 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-29.i that has 2 procedures, 36 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:08:20,775 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:08:20,784 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;@4d5d29d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:08:20,784 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:08:20,788 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 15:08:20,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 15:08:20,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:08:20,794 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 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-01-09 15:08:20,794 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:08:20,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:08:20,799 INFO L85 PathProgramCache]: Analyzing trace with hash 752146727, now seen corresponding path program 1 times [2025-01-09 15:08:20,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:08:20,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840221028] [2025-01-09 15:08:20,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:08:20,812 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-01-09 15:08:20,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:08:20,815 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-01-09 15:08:20,817 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-01-09 15:08:20,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 15:08:21,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 15:08:21,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:08:21,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:08:21,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:08:21,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:08:21,090 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 15:08:21,091 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:08:21,091 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:08:21,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840221028] [2025-01-09 15:08:21,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840221028] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:08:21,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:08:21,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:08:21,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382540034] [2025-01-09 15:08:21,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:08:21,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:08:21,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:08:21,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:08:21,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:08:21,120 INFO L87 Difference]: Start difference. First operand has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 15:08:21,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:08:21,133 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2025-01-09 15:08:21,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:08:21,135 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2025-01-09 15:08:21,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:08:21,139 INFO L225 Difference]: With dead ends: 66 [2025-01-09 15:08:21,140 INFO L226 Difference]: Without dead ends: 33 [2025-01-09 15:08:21,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-01-09 15:08:21,144 INFO L435 NwaCegarLoop]: 45 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, 45 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-01-09 15:08:21,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:08:21,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-09 15:08:21,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-01-09 15:08:21,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 15:08:21,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2025-01-09 15:08:21,173 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 48 [2025-01-09 15:08:21,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:08:21,174 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2025-01-09 15:08:21,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 15:08:21,174 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2025-01-09 15:08:21,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 15:08:21,176 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:08:21,176 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 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-01-09 15:08:21,183 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-01-09 15:08:21,376 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-01-09 15:08:21,377 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:08:21,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:08:21,378 INFO L85 PathProgramCache]: Analyzing trace with hash -996972885, now seen corresponding path program 1 times [2025-01-09 15:08:21,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:08:21,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [12825793] [2025-01-09 15:08:21,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:08:21,379 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-01-09 15:08:21,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:08:21,381 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-01-09 15:08:21,382 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-01-09 15:08:21,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 15:08:21,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 15:08:21,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:08:21,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:08:21,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 15:08:21,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:08:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 15:08:21,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:08:21,678 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:08:21,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [12825793] [2025-01-09 15:08:21,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [12825793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:08:21,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:08:21,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:08:21,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906682642] [2025-01-09 15:08:21,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:08:21,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:08:21,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:08:21,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:08:21,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:08:21,683 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 15:08:23,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:08:25,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:08:29,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:08:30,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:08:33,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:08:36,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:08:36,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:08:36,155 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2025-01-09 15:08:36,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:08:36,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 48 [2025-01-09 15:08:36,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:08:36,157 INFO L225 Difference]: With dead ends: 77 [2025-01-09 15:08:36,157 INFO L226 Difference]: Without dead ends: 47 [2025-01-09 15:08:36,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:08:36,158 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:08:36,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 69 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 14.5s Time] [2025-01-09 15:08:36,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-01-09 15:08:36,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2025-01-09 15:08:36,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 15:08:36,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2025-01-09 15:08:36,164 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 48 [2025-01-09 15:08:36,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:08:36,165 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2025-01-09 15:08:36,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 15:08:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2025-01-09 15:08:36,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 15:08:36,166 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:08:36,167 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 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-01-09 15:08:36,178 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-01-09 15:08:36,367 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-01-09 15:08:36,367 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:08:36,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:08:36,368 INFO L85 PathProgramCache]: Analyzing trace with hash -995125843, now seen corresponding path program 1 times [2025-01-09 15:08:36,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:08:36,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048709030] [2025-01-09 15:08:36,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:08:36,369 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-01-09 15:08:36,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:08:36,371 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-01-09 15:08:36,372 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-01-09 15:08:36,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 15:08:36,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 15:08:36,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:08:36,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:08:36,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 15:08:36,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:08:38,178 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 15:08:38,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:08:38,695 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 15:08:38,695 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:08:38,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048709030] [2025-01-09 15:08:38,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048709030] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:08:38,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:08:38,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-01-09 15:08:38,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243885245] [2025-01-09 15:08:38,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:08:38,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:08:38,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:08:38,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:08:38,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:08:38,697 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 15:08:41,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:08:42,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:08:44,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:08:47,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:08:49,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:08:51,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:08:52,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:08:52,417 INFO L93 Difference]: Finished difference Result 98 states and 130 transitions. [2025-01-09 15:08:52,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:08:52,419 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 48 [2025-01-09 15:08:52,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:08:52,419 INFO L225 Difference]: With dead ends: 98 [2025-01-09 15:08:52,420 INFO L226 Difference]: Without dead ends: 62 [2025-01-09 15:08:52,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:08:52,421 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 131 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:08:52,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 100 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 13.2s Time] [2025-01-09 15:08:52,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-09 15:08:52,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2025-01-09 15:08:52,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 15:08:52,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2025-01-09 15:08:52,429 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 48 [2025-01-09 15:08:52,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:08:52,430 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2025-01-09 15:08:52,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 15:08:52,430 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2025-01-09 15:08:52,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 15:08:52,431 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:08:52,431 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:08:52,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 15:08:52,632 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-01-09 15:08:52,632 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:08:52,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:08:52,633 INFO L85 PathProgramCache]: Analyzing trace with hash -583851564, now seen corresponding path program 1 times [2025-01-09 15:08:52,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:08:52,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617039990] [2025-01-09 15:08:52,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:08:52,633 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-01-09 15:08:52,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:08:52,637 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-01-09 15:08:52,638 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-01-09 15:08:52,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 15:08:52,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 15:08:52,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:08:52,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:08:52,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 15:08:52,852 INFO L279 TraceCheckSpWp]: Computing forward predicates...