./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-47.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_loopvsstraightlinecode_25-1loop_file-47.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 44eacf12db4e9e03ae896c491542075bfb298656743b3655ef171492d8e9e317 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:18:13,704 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:18:13,764 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:18:13,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:18:13,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:18:13,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:18:13,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:18:13,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:18:13,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:18:13,796 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:18:13,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:18:13,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:18:13,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:18:13,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:18:13,797 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:18:13,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:18:13,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:18:13,798 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:18:13,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:18:13,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:18:13,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:18:13,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:18:13,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:18:13,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:18:13,798 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:18:13,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:18:13,798 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:18:13,798 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:18:13,799 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:18:13,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:18:13,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:18:13,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:18:13,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:18:13,799 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:18:13,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:18:13,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:18:13,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:18:13,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:18:13,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:18:13,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:18:13,800 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:18:13,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:18:13,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:18:13,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:18:13,800 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:18:13,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:18:13,800 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:18:13,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:18:13,801 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 -> 44eacf12db4e9e03ae896c491542075bfb298656743b3655ef171492d8e9e317 [2025-01-09 13:18:14,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:18:14,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:18:14,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:18:14,054 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:18:14,054 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:18:14,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-47.i [2025-01-09 13:18:15,224 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82eee4a87/7e3489b3ddd84e769bb53ae157336f29/FLAG260114dae [2025-01-09 13:18:15,501 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:18:15,502 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-47.i [2025-01-09 13:18:15,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82eee4a87/7e3489b3ddd84e769bb53ae157336f29/FLAG260114dae [2025-01-09 13:18:15,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82eee4a87/7e3489b3ddd84e769bb53ae157336f29 [2025-01-09 13:18:15,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:18:15,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:18:15,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:18:15,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:18:15,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:18:15,804 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:18:15" (1/1) ... [2025-01-09 13:18:15,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4af380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:15, skipping insertion in model container [2025-01-09 13:18:15,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:18:15" (1/1) ... [2025-01-09 13:18:15,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:18:15,911 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_loopvsstraightlinecode_25-1loop_file-47.i[915,928] [2025-01-09 13:18:15,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:18:15,957 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:18:15,964 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_loopvsstraightlinecode_25-1loop_file-47.i[915,928] [2025-01-09 13:18:15,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:18:15,989 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:18:15,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:15 WrapperNode [2025-01-09 13:18:15,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:18:15,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:18:15,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:18:15,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:18:15,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:15" (1/1) ... [2025-01-09 13:18:15,998 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:15" (1/1) ... [2025-01-09 13:18:16,009 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 92 [2025-01-09 13:18:16,009 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:18:16,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:18:16,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:18:16,010 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:18:16,015 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:15" (1/1) ... [2025-01-09 13:18:16,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:15" (1/1) ... [2025-01-09 13:18:16,016 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:15" (1/1) ... [2025-01-09 13:18:16,025 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 13:18:16,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:15" (1/1) ... [2025-01-09 13:18:16,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:15" (1/1) ... [2025-01-09 13:18:16,028 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:15" (1/1) ... [2025-01-09 13:18:16,029 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:15" (1/1) ... [2025-01-09 13:18:16,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:15" (1/1) ... [2025-01-09 13:18:16,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:15" (1/1) ... [2025-01-09 13:18:16,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:15" (1/1) ... [2025-01-09 13:18:16,033 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:18:16,034 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:18:16,034 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:18:16,034 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:18:16,035 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:15" (1/1) ... [2025-01-09 13:18:16,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:18:16,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:18:16,055 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 13:18:16,059 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 13:18:16,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:18:16,071 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:18:16,071 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:18:16,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:18:16,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:18:16,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:18:16,111 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:18:16,112 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:18:16,231 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-01-09 13:18:16,231 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:18:16,240 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:18:16,240 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:18:16,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:18:16 BoogieIcfgContainer [2025-01-09 13:18:16,241 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:18:16,243 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:18:16,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:18:16,248 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:18:16,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:18:15" (1/3) ... [2025-01-09 13:18:16,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71553fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:18:16, skipping insertion in model container [2025-01-09 13:18:16,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:15" (2/3) ... [2025-01-09 13:18:16,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71553fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:18:16, skipping insertion in model container [2025-01-09 13:18:16,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:18:16" (3/3) ... [2025-01-09 13:18:16,251 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-47.i [2025-01-09 13:18:16,264 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:18:16,265 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-47.i that has 2 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:18:16,303 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:18:16,310 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;@716dec5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:18:16,311 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:18:16,313 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 13:18:16,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 13:18:16,319 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:18:16,319 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:18:16,320 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:18:16,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:18:16,324 INFO L85 PathProgramCache]: Analyzing trace with hash -834033987, now seen corresponding path program 1 times [2025-01-09 13:18:16,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:18:16,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539704473] [2025-01-09 13:18:16,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:18:16,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:18:16,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 13:18:16,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 13:18:16,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:18:16,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:18:16,452 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-01-09 13:18:16,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:18:16,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539704473] [2025-01-09 13:18:16,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539704473] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:18:16,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857707525] [2025-01-09 13:18:16,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:18:16,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:18:16,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:18:16,455 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 13:18:16,457 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 13:18:16,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 13:18:16,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 13:18:16,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:18:16,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:18:16,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:18:16,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:18:16,547 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-01-09 13:18:16,547 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:18:16,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857707525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:18:16,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:18:16,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:18:16,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380292942] [2025-01-09 13:18:16,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:18:16,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:18:16,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:18:16,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:18:16,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:18:16,564 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 13:18:16,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:18:16,576 INFO L93 Difference]: Finished difference Result 77 states and 119 transitions. [2025-01-09 13:18:16,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:18:16,577 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2025-01-09 13:18:16,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:18:16,580 INFO L225 Difference]: With dead ends: 77 [2025-01-09 13:18:16,580 INFO L226 Difference]: Without dead ends: 37 [2025-01-09 13:18:16,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 70 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 13:18:16,584 INFO L435 NwaCegarLoop]: 54 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, 54 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 13:18:16,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:18:16,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-09 13:18:16,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-01-09 13:18:16,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 13:18:16,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2025-01-09 13:18:16,605 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 69 [2025-01-09 13:18:16,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:18:16,605 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2025-01-09 13:18:16,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 13:18:16,606 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2025-01-09 13:18:16,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 13:18:16,607 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:18:16,607 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:18:16,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 13:18:16,811 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 13:18:16,811 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:18:16,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:18:16,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1153809337, now seen corresponding path program 1 times [2025-01-09 13:18:16,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:18:16,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840787520] [2025-01-09 13:18:16,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:18:16,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:18:16,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 13:18:16,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 13:18:16,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:18:16,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:18:16,952 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:18:16,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 13:18:17,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 13:18:17,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:18:17,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:18:17,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:18:17,065 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:18:17,066 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:18:17,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:18:17,069 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 13:18:17,116 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:18:17,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:18:17 BoogieIcfgContainer [2025-01-09 13:18:17,120 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:18:17,120 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:18:17,121 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:18:17,121 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:18:17,121 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:18:16" (3/4) ... [2025-01-09 13:18:17,123 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:18:17,123 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:18:17,124 INFO L158 Benchmark]: Toolchain (without parser) took 1325.28ms. Allocated memory is still 142.6MB. Free memory was 108.5MB in the beginning and 91.5MB in the end (delta: 17.0MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2025-01-09 13:18:17,124 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 209.7MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:18:17,125 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.73ms. Allocated memory is still 142.6MB. Free memory was 108.5MB in the beginning and 96.0MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:18:17,125 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.91ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 94.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:18:17,125 INFO L158 Benchmark]: Boogie Preprocessor took 24.16ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:18:17,126 INFO L158 Benchmark]: RCFGBuilder took 206.70ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 78.3MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:18:17,126 INFO L158 Benchmark]: TraceAbstraction took 876.24ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 91.5MB in the end (delta: -13.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:18:17,126 INFO L158 Benchmark]: Witness Printer took 3.15ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 91.5MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:18:17,128 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.41ms. Allocated memory is still 209.7MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.73ms. Allocated memory is still 142.6MB. Free memory was 108.5MB in the beginning and 96.0MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.91ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 94.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.16ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 206.70ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 78.3MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 876.24ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 91.5MB in the end (delta: -13.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.15ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 91.5MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of someBinaryFLOATComparisonOperation at line 49, overapproximation of someBinaryFLOATComparisonOperation at line 50, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someUnaryDOUBLEoperation at line 24, overapproximation of someBinaryDOUBLEComparisonOperation at line 37, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of someUnaryFLOAToperation at line 49, overapproximation of someBinaryArithmeticFLOAToperation at line 49. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 24.575; [L23] double var_1_8 = 128.5; [L24] float var_1_9 = -0.5; [L25] float var_1_10 = 200.4; [L26] unsigned long int var_1_11 = 4; [L27] unsigned char var_1_12 = 1; [L28] unsigned long int var_1_13 = 3607105345; [L29] signed char var_1_14 = 0; [L30] signed char var_1_15 = 0; [L31] signed char var_1_16 = 16; [L32] double last_1_var_1_1 = 24.575; [L33] float last_1_var_1_9 = -0.5; VAL [isInitial=0, last_1_var_1_1=983/40, var_1_10=1002/5, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_8=257/2] [L85] isInitial = 1 [L86] FCALL initially() [L87] int k_loop; [L88] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_1=983/40, var_1_10=1002/5, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_8=257/2] [L88] COND TRUE k_loop < 1 [L89] CALL updateLastVariables() [L77] last_1_var_1_1 = var_1_1 [L78] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_10=1002/5, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_8=257/2, var_1_9=3607105352] [L89] RET updateLastVariables() [L90] CALL updateVariables() [L59] var_1_8 = __VERIFIER_nondet_double() [L60] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_10=1002/5, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_10=1002/5, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L60] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_10=1002/5, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L61] var_1_10 = __VERIFIER_nondet_float() [L62] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L62] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L63] var_1_12 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L64] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L65] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L65] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L66] var_1_13 = __VERIFIER_nondet_ulong() [L67] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=-2, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=-2, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L67] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=-2, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L68] CALL assume_abort_if_not(var_1_13 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=-2, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=-2, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L68] RET assume_abort_if_not(var_1_13 <= 4294967294) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=-2, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L69] var_1_15 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_15 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=-2, var_1_14=0, var_1_15=-1, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=-2, var_1_14=0, var_1_15=-1, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L70] RET assume_abort_if_not(var_1_15 >= -1) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=-2, var_1_14=0, var_1_15=-1, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L71] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=-2, var_1_14=0, var_1_15=-1, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=-2, var_1_14=0, var_1_15=-1, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L71] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=-2, var_1_14=0, var_1_15=-1, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L72] var_1_16 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=-2, var_1_14=0, var_1_15=-1, var_1_16=126, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=-2, var_1_14=0, var_1_15=-1, var_1_16=126, var_1_1=983/40, var_1_9=3607105352] [L73] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=-2, var_1_14=0, var_1_15=-1, var_1_16=126, var_1_1=983/40, var_1_9=3607105352] [L74] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=-2, var_1_14=0, var_1_15=-1, var_1_16=126, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=-2, var_1_14=0, var_1_15=-1, var_1_16=126, var_1_1=983/40, var_1_9=3607105352] [L74] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=-2, var_1_14=0, var_1_15=-1, var_1_16=126, var_1_1=983/40, var_1_9=3607105352] [L90] RET updateVariables() [L91] CALL step() [L37] COND FALSE !(((((last_1_var_1_9) > (last_1_var_1_9)) ? (last_1_var_1_9) : (last_1_var_1_9))) >= last_1_var_1_1) [L42] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=-2, var_1_14=-1, var_1_15=-1, var_1_16=126, var_1_1=983/40, var_1_9=3607105352] [L44] COND TRUE \read(var_1_12) [L45] var_1_11 = ((((var_1_14) < (var_1_14)) ? (var_1_14) : (var_1_14))) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=-1, var_1_12=1, var_1_13=-2, var_1_14=-1, var_1_15=-1, var_1_16=126, var_1_1=983/40, var_1_9=3607105352] [L49] var_1_9 = ((((var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f)))) < 0 ) ? -(var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f)))) : (var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f)))))) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=-1, var_1_12=1, var_1_13=-2, var_1_14=-1, var_1_15=-1, var_1_16=126, var_1_1=983/40, var_1_9=3607105350] [L50] COND FALSE !(var_1_9 <= var_1_9) [L55] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=-1, var_1_12=1, var_1_13=-2, var_1_14=-1, var_1_15=-1, var_1_16=126, var_1_1=3607105351, var_1_8=3607105351, var_1_9=3607105350] [L91] RET step() [L92] CALL, EXPR property() [L81-L82] return ((((var_1_9 <= var_1_9) ? (((var_1_11 + var_1_11) >= (var_1_14 + var_1_14)) ? (var_1_1 == ((double) var_1_8)) : 1) : (var_1_1 == ((double) var_1_8))) && (var_1_9 == ((float) ((((var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f)))) < 0 ) ? -(var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f)))) : (var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f))))))))) && (var_1_12 ? (var_1_11 == ((unsigned long int) ((((var_1_14) < (var_1_14)) ? (var_1_14) : (var_1_14))))) : (var_1_11 == ((unsigned long int) ((((var_1_14) > ((var_1_13 - (var_1_14 + 32u)))) ? (var_1_14) : ((var_1_13 - (var_1_14 + 32u))))))))) && ((((((last_1_var_1_9) > (last_1_var_1_9)) ? (last_1_var_1_9) : (last_1_var_1_9))) >= last_1_var_1_1) ? (var_1_12 ? (var_1_14 == ((signed char) (var_1_15 - var_1_16))) : 1) : (var_1_14 == ((signed char) var_1_15))) ; VAL [\result=0, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=-1, var_1_12=1, var_1_13=-2, var_1_14=-1, var_1_15=-1, var_1_16=126, var_1_1=3607105351, var_1_8=3607105351, var_1_9=3607105350] [L92] RET, EXPR property() [L92] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=-1, var_1_12=1, var_1_13=-2, var_1_14=-1, var_1_15=-1, var_1_16=126, var_1_1=3607105351, var_1_8=3607105351, var_1_9=3607105350] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=-1, var_1_12=1, var_1_13=-2, var_1_14=-1, var_1_15=-1, var_1_16=126, var_1_1=3607105351, var_1_8=3607105351, var_1_9=3607105350] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 10, 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, 54 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, 54 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 136 SizeOfPredicates, 0 NumberOfNonLiveVariables, 175 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 342/360 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 13:18:17,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-47.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 44eacf12db4e9e03ae896c491542075bfb298656743b3655ef171492d8e9e317 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:18:18,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:18:19,048 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 13:18:19,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:18:19,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:18:19,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:18:19,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:18:19,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:18:19,084 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:18:19,085 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:18:19,085 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:18:19,085 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:18:19,085 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:18:19,086 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:18:19,086 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:18:19,086 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:18:19,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:18:19,086 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:18:19,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:18:19,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:18:19,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:18:19,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:18:19,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:18:19,088 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:18:19,088 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:18:19,088 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:18:19,088 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:18:19,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:18:19,088 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:18:19,088 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:18:19,088 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:18:19,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:18:19,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:18:19,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:18:19,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:18:19,089 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:18:19,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:18:19,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:18:19,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:18:19,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:18:19,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:18:19,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:18:19,089 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:18:19,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:18:19,089 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:18:19,089 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:18:19,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:18:19,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:18:19,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:18:19,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:18:19,089 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 -> 44eacf12db4e9e03ae896c491542075bfb298656743b3655ef171492d8e9e317 [2025-01-09 13:18:19,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:18:19,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:18:19,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:18:19,366 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:18:19,366 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:18:19,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-47.i [2025-01-09 13:18:20,522 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e39c3ba87/663f8d5975024908919fd087a4c6931d/FLAGd0d59fc8b [2025-01-09 13:18:20,710 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:18:20,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-47.i [2025-01-09 13:18:20,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e39c3ba87/663f8d5975024908919fd087a4c6931d/FLAGd0d59fc8b [2025-01-09 13:18:20,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e39c3ba87/663f8d5975024908919fd087a4c6931d [2025-01-09 13:18:20,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:18:20,733 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:18:20,734 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:18:20,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:18:20,737 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:18:20,737 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:18:20" (1/1) ... [2025-01-09 13:18:20,738 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3bee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:20, skipping insertion in model container [2025-01-09 13:18:20,738 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:18:20" (1/1) ... [2025-01-09 13:18:20,750 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:18:20,856 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_loopvsstraightlinecode_25-1loop_file-47.i[915,928] [2025-01-09 13:18:20,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:18:20,910 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:18:20,917 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_loopvsstraightlinecode_25-1loop_file-47.i[915,928] [2025-01-09 13:18:20,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:18:20,952 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:18:20,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:20 WrapperNode [2025-01-09 13:18:20,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:18:20,956 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:18:20,956 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:18:20,956 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:18:20,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:20" (1/1) ... [2025-01-09 13:18:20,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:20" (1/1) ... [2025-01-09 13:18:20,986 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2025-01-09 13:18:20,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:18:20,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:18:20,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:18:20,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:18:20,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:20" (1/1) ... [2025-01-09 13:18:20,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:20" (1/1) ... [2025-01-09 13:18:21,003 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:20" (1/1) ... [2025-01-09 13:18:21,012 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 13:18:21,012 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:20" (1/1) ... [2025-01-09 13:18:21,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:20" (1/1) ... [2025-01-09 13:18:21,017 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:20" (1/1) ... [2025-01-09 13:18:21,018 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:20" (1/1) ... [2025-01-09 13:18:21,025 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:20" (1/1) ... [2025-01-09 13:18:21,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:20" (1/1) ... [2025-01-09 13:18:21,030 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:20" (1/1) ... [2025-01-09 13:18:21,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:18:21,036 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:18:21,036 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:18:21,036 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:18:21,037 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:20" (1/1) ... [2025-01-09 13:18:21,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:18:21,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:18:21,063 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 13:18:21,066 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 13:18:21,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:18:21,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:18:21,085 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:18:21,086 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:18:21,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:18:21,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:18:21,146 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:18:21,148 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:18:21,654 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-01-09 13:18:21,654 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:18:21,664 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:18:21,664 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:18:21,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:18:21 BoogieIcfgContainer [2025-01-09 13:18:21,665 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:18:21,667 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:18:21,670 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:18:21,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:18:21,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:18:20" (1/3) ... [2025-01-09 13:18:21,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ee611d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:18:21, skipping insertion in model container [2025-01-09 13:18:21,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:18:20" (2/3) ... [2025-01-09 13:18:21,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ee611d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:18:21, skipping insertion in model container [2025-01-09 13:18:21,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:18:21" (3/3) ... [2025-01-09 13:18:21,679 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-47.i [2025-01-09 13:18:21,690 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:18:21,691 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-47.i that has 2 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:18:21,736 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:18:21,745 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;@8f66ceb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:18:21,746 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:18:21,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 13:18:21,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 13:18:21,754 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:18:21,755 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:18:21,755 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:18:21,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:18:21,759 INFO L85 PathProgramCache]: Analyzing trace with hash -834033987, now seen corresponding path program 1 times [2025-01-09 13:18:21,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:18:21,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447439903] [2025-01-09 13:18:21,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:18:21,770 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 13:18:21,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:18:21,774 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 13:18:21,776 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 13:18:21,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 13:18:21,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 13:18:21,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:18:21,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:18:21,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:18:21,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:18:21,955 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-01-09 13:18:21,955 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:18:21,956 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:18:21,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447439903] [2025-01-09 13:18:21,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [447439903] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:18:21,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:18:21,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:18:21,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633403538] [2025-01-09 13:18:21,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:18:21,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:18:21,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:18:21,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:18:21,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:18:21,977 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 13:18:21,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:18:21,994 INFO L93 Difference]: Finished difference Result 77 states and 119 transitions. [2025-01-09 13:18:21,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:18:21,995 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2025-01-09 13:18:21,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:18:22,000 INFO L225 Difference]: With dead ends: 77 [2025-01-09 13:18:22,000 INFO L226 Difference]: Without dead ends: 37 [2025-01-09 13:18:22,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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 13:18:22,004 INFO L435 NwaCegarLoop]: 54 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, 54 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 13:18:22,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:18:22,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-09 13:18:22,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-01-09 13:18:22,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 13:18:22,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2025-01-09 13:18:22,036 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 69 [2025-01-09 13:18:22,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:18:22,036 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2025-01-09 13:18:22,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 13:18:22,036 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2025-01-09 13:18:22,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 13:18:22,038 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:18:22,038 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:18:22,045 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 13:18:22,243 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 13:18:22,244 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:18:22,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:18:22,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1153809337, now seen corresponding path program 1 times [2025-01-09 13:18:22,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:18:22,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087920098] [2025-01-09 13:18:22,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:18:22,249 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 13:18:22,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:18:22,251 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 13:18:22,253 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 13:18:22,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 13:18:22,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 13:18:22,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:18:22,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:18:22,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 13:18:22,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:18:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 43 proven. 24 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-01-09 13:18:25,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:18:35,423 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-01-09 13:18:35,423 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:18:35,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087920098] [2025-01-09 13:18:35,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2087920098] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 13:18:35,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 13:18:35,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-01-09 13:18:35,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738082674] [2025-01-09 13:18:35,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 13:18:35,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 13:18:35,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:18:35,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 13:18:35,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:18:35,432 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 4 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 13:18:56,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 13:19:03,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 13:19:04,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 13:19:06,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 13:19:09,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 13:19:11,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 13:19:12,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 13:19:13,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 13:19:15,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 13:19:16,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:19:16,623 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2025-01-09 13:19:16,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 13:19:16,632 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 4 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 69 [2025-01-09 13:19:16,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:19:16,633 INFO L225 Difference]: With dead ends: 109 [2025-01-09 13:19:16,633 INFO L226 Difference]: Without dead ends: 75 [2025-01-09 13:19:16,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=197, Invalid=403, Unknown=0, NotChecked=0, Total=600 [2025-01-09 13:19:16,634 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 115 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:19:16,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 137 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 25.6s Time] [2025-01-09 13:19:16,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-09 13:19:16,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 41. [2025-01-09 13:19:16,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 13:19:16,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2025-01-09 13:19:16,654 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 69 [2025-01-09 13:19:16,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:19:16,655 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2025-01-09 13:19:16,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 4 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 13:19:16,656 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2025-01-09 13:19:16,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 13:19:16,657 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:19:16,657 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:19:16,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-01-09 13:19:16,858 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 13:19:16,858 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:19:16,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:19:16,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1172790763, now seen corresponding path program 1 times [2025-01-09 13:19:16,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:19:16,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824631600] [2025-01-09 13:19:16,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:16,860 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 13:19:16,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:19:16,862 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 13:19:16,863 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 13:19:16,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 13:19:16,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 13:19:16,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:16,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:16,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 13:19:16,989 INFO L279 TraceCheckSpWp]: Computing forward predicates...