./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-67.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-while_file-67.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 fd38e103082400978e963855c45ad16aea167d5793b2ed8eb8338e9d66135232 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:32:59,466 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:32:59,533 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:32:59,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:32:59,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:32:59,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:32:59,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:32:59,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:32:59,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:32:59,576 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:32:59,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:32:59,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:32:59,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:32:59,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:32:59,578 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:32:59,578 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:32:59,578 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:32:59,578 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:32:59,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:32:59,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:32:59,579 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:32:59,579 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:32:59,579 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:32:59,579 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:32:59,579 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:32:59,579 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:32:59,579 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:32:59,579 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:32:59,579 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:32:59,580 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:32:59,580 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:32:59,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:32:59,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:32:59,581 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:32:59,581 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:32:59,581 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:32:59,581 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:32:59,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:32:59,581 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:32:59,581 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:32:59,581 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:32:59,581 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:32:59,582 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:32:59,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:32:59,582 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:32:59,582 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:32:59,582 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:32:59,582 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:32:59,582 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 -> fd38e103082400978e963855c45ad16aea167d5793b2ed8eb8338e9d66135232 [2025-01-09 13:32:59,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:32:59,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:32:59,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:32:59,897 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:32:59,897 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:32:59,898 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-while_file-67.i [2025-01-09 13:33:01,183 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b6ace060/ce6f727937fa4742b56abe2223c44b28/FLAG993ddd2b7 [2025-01-09 13:33:01,421 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:33:01,422 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-67.i [2025-01-09 13:33:01,429 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b6ace060/ce6f727937fa4742b56abe2223c44b28/FLAG993ddd2b7 [2025-01-09 13:33:01,446 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b6ace060/ce6f727937fa4742b56abe2223c44b28 [2025-01-09 13:33:01,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:33:01,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:33:01,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:33:01,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:33:01,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:33:01,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:33:01" (1/1) ... [2025-01-09 13:33:01,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4366b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:01, skipping insertion in model container [2025-01-09 13:33:01,455 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:33:01" (1/1) ... [2025-01-09 13:33:01,468 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:33:01,608 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-while_file-67.i[915,928] [2025-01-09 13:33:01,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:33:01,681 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:33:01,689 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-while_file-67.i[915,928] [2025-01-09 13:33:01,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:33:01,734 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:33:01,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:01 WrapperNode [2025-01-09 13:33:01,736 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:33:01,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:33:01,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:33:01,737 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:33:01,744 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:33:01" (1/1) ... [2025-01-09 13:33:01,754 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:33:01" (1/1) ... [2025-01-09 13:33:01,786 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2025-01-09 13:33:01,786 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:33:01,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:33:01,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:33:01,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:33:01,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:01" (1/1) ... [2025-01-09 13:33:01,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:01" (1/1) ... [2025-01-09 13:33:01,801 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:01" (1/1) ... [2025-01-09 13:33:01,821 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:33:01,822 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:01" (1/1) ... [2025-01-09 13:33:01,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:01" (1/1) ... [2025-01-09 13:33:01,828 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:01" (1/1) ... [2025-01-09 13:33:01,832 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:01" (1/1) ... [2025-01-09 13:33:01,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:01" (1/1) ... [2025-01-09 13:33:01,841 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:01" (1/1) ... [2025-01-09 13:33:01,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:01" (1/1) ... [2025-01-09 13:33:01,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:33:01,847 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:33:01,847 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:33:01,847 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:33:01,848 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:01" (1/1) ... [2025-01-09 13:33:01,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:33:01,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:33:01,876 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:33:01,878 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:33:01,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:33:01,898 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:33:01,898 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:33:01,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:33:01,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:33:01,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:33:01,968 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:33:01,970 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:33:02,182 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 13:33:02,182 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:33:02,193 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:33:02,194 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:33:02,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:33:02 BoogieIcfgContainer [2025-01-09 13:33:02,194 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:33:02,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:33:02,196 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:33:02,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:33:02,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:33:01" (1/3) ... [2025-01-09 13:33:02,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf6389a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:33:02, skipping insertion in model container [2025-01-09 13:33:02,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:01" (2/3) ... [2025-01-09 13:33:02,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf6389a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:33:02, skipping insertion in model container [2025-01-09 13:33:02,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:33:02" (3/3) ... [2025-01-09 13:33:02,202 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-67.i [2025-01-09 13:33:02,214 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:33:02,216 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-67.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:33:02,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:33:02,282 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;@525edecc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:33:02,282 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:33:02,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 13:33:02,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 13:33:02,295 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:33:02,296 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:02,298 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:33:02,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:33:02,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1082496245, now seen corresponding path program 1 times [2025-01-09 13:33:02,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:33:02,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259035135] [2025-01-09 13:33:02,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:33:02,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:33:02,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 13:33:02,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 13:33:02,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:33:02,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:33:02,576 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 13:33:02,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:33:02,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259035135] [2025-01-09 13:33:02,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259035135] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:33:02,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491329888] [2025-01-09 13:33:02,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:33:02,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:33:02,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:33:02,581 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:33:02,583 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:33:02,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 13:33:02,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 13:33:02,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:33:02,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:33:02,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:33:02,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:33:02,781 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 13:33:02,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:33:02,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491329888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:33:02,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:33:02,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:33:02,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759411991] [2025-01-09 13:33:02,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:33:02,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:33:02,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:33:02,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:33:02,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:33:02,810 INFO L87 Difference]: Start difference. First operand has 52 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 13:33:02,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:33:02,839 INFO L93 Difference]: Finished difference Result 98 states and 168 transitions. [2025-01-09 13:33:02,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:33:02,843 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 117 [2025-01-09 13:33:02,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:33:02,849 INFO L225 Difference]: With dead ends: 98 [2025-01-09 13:33:02,850 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 13:33:02,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 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:33:02,876 INFO L435 NwaCegarLoop]: 72 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, 72 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:33:02,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:33:02,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 13:33:02,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 13:33:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 13:33:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2025-01-09 13:33:02,921 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 72 transitions. Word has length 117 [2025-01-09 13:33:02,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:33:02,922 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 72 transitions. [2025-01-09 13:33:02,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 13:33:02,923 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2025-01-09 13:33:02,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 13:33:02,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:33:02,928 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:02,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 13:33:03,129 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:33:03,130 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:33:03,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:33:03,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1106629129, now seen corresponding path program 1 times [2025-01-09 13:33:03,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:33:03,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767116382] [2025-01-09 13:33:03,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:33:03,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:33:03,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 13:33:03,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 13:33:03,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:33:03,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:33:03,700 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 13:33:03,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:33:03,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767116382] [2025-01-09 13:33:03,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767116382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:33:03,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:33:03,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:33:03,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668949936] [2025-01-09 13:33:03,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:33:03,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:33:03,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:33:03,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:33:03,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:33:03,705 INFO L87 Difference]: Start difference. First operand 49 states and 72 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 13:33:04,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:33:04,052 INFO L93 Difference]: Finished difference Result 196 states and 289 transitions. [2025-01-09 13:33:04,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:33:04,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 117 [2025-01-09 13:33:04,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:33:04,056 INFO L225 Difference]: With dead ends: 196 [2025-01-09 13:33:04,056 INFO L226 Difference]: Without dead ends: 150 [2025-01-09 13:33:04,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:33:04,057 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 96 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:33:04,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 280 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 13:33:04,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-01-09 13:33:04,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 94. [2025-01-09 13:33:04,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 13:33:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 141 transitions. [2025-01-09 13:33:04,102 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 141 transitions. Word has length 117 [2025-01-09 13:33:04,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:33:04,105 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 141 transitions. [2025-01-09 13:33:04,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 13:33:04,105 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 141 transitions. [2025-01-09 13:33:04,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 13:33:04,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:33:04,107 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:04,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:33:04,107 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:33:04,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:33:04,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1413330805, now seen corresponding path program 1 times [2025-01-09 13:33:04,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:33:04,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7216980] [2025-01-09 13:33:04,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:33:04,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:33:04,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 13:33:04,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 13:33:04,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:33:04,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:33:04,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [462903555] [2025-01-09 13:33:04,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:33:04,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:33:04,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:33:04,253 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:33:04,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 13:33:04,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 13:33:04,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 13:33:04,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:33:04,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:33:04,436 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:33:04,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 13:33:04,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 13:33:04,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:33:04,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:33:04,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:33:04,542 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:33:04,543 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:33:04,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 13:33:04,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:33:04,749 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 13:33:04,843 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:33:04,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:33:04 BoogieIcfgContainer [2025-01-09 13:33:04,848 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:33:04,849 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:33:04,849 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:33:04,849 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:33:04,849 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:33:02" (3/4) ... [2025-01-09 13:33:04,852 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:33:04,852 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:33:04,853 INFO L158 Benchmark]: Toolchain (without parser) took 3403.43ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 71.8MB in the end (delta: 40.7MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2025-01-09 13:33:04,854 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:33:04,854 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.84ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 99.4MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:33:04,855 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.13ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.4MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:33:04,855 INFO L158 Benchmark]: Boogie Preprocessor took 56.17ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 94.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:33:04,855 INFO L158 Benchmark]: RCFGBuilder took 346.84ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 77.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:33:04,856 INFO L158 Benchmark]: TraceAbstraction took 2652.01ms. Allocated memory is still 142.6MB. Free memory was 77.2MB in the beginning and 71.8MB in the end (delta: 5.3MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2025-01-09 13:33:04,856 INFO L158 Benchmark]: Witness Printer took 3.75ms. Allocated memory is still 142.6MB. Free memory was 71.8MB in the beginning and 71.8MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:33:04,858 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.84ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 99.4MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.13ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.4MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.17ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 94.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 346.84ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 77.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2652.01ms. Allocated memory is still 142.6MB. Free memory was 77.2MB in the beginning and 71.8MB in the end (delta: 5.3MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Witness Printer took 3.75ms. Allocated memory is still 142.6MB. Free memory was 71.8MB in the beginning and 71.8MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryFLOATComparisonOperation at line 98. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 2; [L23] signed short int var_1_4 = -64; [L24] signed short int var_1_5 = 256; [L25] unsigned short int var_1_6 = 128; [L26] signed short int var_1_7 = -128; [L27] unsigned short int var_1_8 = 16; [L28] unsigned short int var_1_9 = 256; [L29] signed long int var_1_10 = 128; [L30] unsigned short int var_1_11 = 47512; [L31] unsigned char var_1_12 = 16; [L32] unsigned char var_1_13 = 1; [L33] float var_1_14 = 5.5; [L34] float var_1_15 = 24.5; [L35] signed short int last_1_var_1_1 = 2; [L36] unsigned short int last_1_var_1_6 = 128; VAL [isInitial=0, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=-64, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L102] isInitial = 1 [L103] FCALL initially() [L105] CALL updateLastVariables() [L94] last_1_var_1_1 = var_1_1 [L95] last_1_var_1_6 = var_1_6 VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=-64, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L64] var_1_4 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_4 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L65] RET assume_abort_if_not(var_1_4 >= -16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L66] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L66] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L67] var_1_5 = __VERIFIER_nondet_short() [L68] CALL assume_abort_if_not(var_1_5 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L68] RET assume_abort_if_not(var_1_5 >= -16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L69] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L69] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L70] var_1_7 = __VERIFIER_nondet_short() [L71] CALL assume_abort_if_not(var_1_7 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L71] RET assume_abort_if_not(var_1_7 >= -32768) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L72] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L72] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L73] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L73] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L74] var_1_8 = __VERIFIER_nondet_ushort() [L75] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_9=256] [L75] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_9=256] [L76] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=256] [L76] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=256] [L77] var_1_9 = __VERIFIER_nondet_ushort() [L78] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072] [L78] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072] [L79] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L79] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L80] var_1_11 = __VERIFIER_nondet_ushort() [L81] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L81] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L82] CALL assume_abort_if_not(var_1_11 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L82] RET assume_abort_if_not(var_1_11 <= 65535) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L83] var_1_12 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L84] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L85] CALL assume_abort_if_not(var_1_12 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L85] RET assume_abort_if_not(var_1_12 <= 255) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L86] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=5, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=5, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L86] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=5, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L87] var_1_13 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=5, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=5, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L88] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=5, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L89] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=5, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=5, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L89] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=5, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L90] var_1_15 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=5, var_1_13=1, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=5, var_1_13=1, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L91] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=5, var_1_13=1, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L106] RET updateVariables() [L107] CALL step() [L40] signed long int stepLocal_1 = last_1_var_1_6; [L41] signed long int stepLocal_0 = last_1_var_1_6; VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, stepLocal_0=128, stepLocal_1=128, var_1_10=128, var_1_11=32767, var_1_12=5, var_1_13=1, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L42] COND FALSE !(stepLocal_0 >= (var_1_11 - var_1_8)) [L53] var_1_10 = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, stepLocal_1=128, var_1_10=2, var_1_11=32767, var_1_12=5, var_1_13=1, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L55] COND FALSE !(! (var_1_10 <= last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, stepLocal_1=128, var_1_10=2, var_1_11=32767, var_1_12=5, var_1_13=1, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L58] COND TRUE var_1_4 > (var_1_10 / var_1_7) [L59] var_1_6 = (var_1_8 + var_1_9) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, stepLocal_1=128, var_1_10=2, var_1_11=32767, var_1_12=5, var_1_13=1, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=32767, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L61] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, stepLocal_1=128, var_1_10=2, var_1_11=32767, var_1_12=5, var_1_13=1, var_1_14=2, var_1_15=2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=32767, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L107] RET step() [L108] CALL, EXPR property() [L98-L99] return ((((! (var_1_10 <= last_1_var_1_1)) ? (var_1_1 == ((signed short int) (var_1_4 + var_1_5))) : 1) && ((var_1_4 > (var_1_10 / var_1_7)) ? (var_1_6 == ((unsigned short int) (var_1_8 + var_1_9))) : 1)) && ((last_1_var_1_6 >= (var_1_11 - var_1_8)) ? (((var_1_7 / var_1_12) <= last_1_var_1_6) ? (var_1_10 == ((signed long int) ((last_1_var_1_6 - var_1_8) + -32))) : (var_1_13 ? (var_1_10 == ((signed long int) ((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))))) : (var_1_10 == ((signed long int) var_1_5)))) : (var_1_10 == ((signed long int) last_1_var_1_1)))) && (var_1_14 == ((float) var_1_15)) ; VAL [\result=0, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=2, var_1_11=32767, var_1_12=5, var_1_13=1, var_1_14=2, var_1_15=2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=32767, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=2, var_1_11=32767, var_1_12=5, var_1_13=1, var_1_14=2, var_1_15=2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=32767, var_1_7=3, var_1_8=-131072, var_1_9=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=2, var_1_11=32767, var_1_12=5, var_1_13=1, var_1_14=2, var_1_15=2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=32767, var_1_7=3, var_1_8=-131072, var_1_9=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 96 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 96 mSDsluCounter, 352 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 159 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71 IncrementalHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 193 mSDtfsCounter, 71 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 56 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 585 NumberOfCodeBlocks, 585 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 420 SizeOfPredicates, 0 NumberOfNonLiveVariables, 271 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2016/2052 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:33:04,879 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-while_file-67.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 fd38e103082400978e963855c45ad16aea167d5793b2ed8eb8338e9d66135232 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:33:07,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:33:07,263 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:33:07,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:33:07,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:33:07,290 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:33:07,291 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:33:07,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:33:07,291 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:33:07,291 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:33:07,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:33:07,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:33:07,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:33:07,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:33:07,292 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:33:07,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:33:07,292 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:33:07,292 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:33:07,293 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:33:07,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:33:07,293 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:33:07,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:33:07,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:33:07,293 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:33:07,293 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:33:07,293 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:33:07,293 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:33:07,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:33:07,293 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:33:07,293 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:33:07,294 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:33:07,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:33:07,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:33:07,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:33:07,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:33:07,294 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:33:07,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:33:07,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:33:07,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:33:07,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:33:07,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:33:07,294 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:33:07,295 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:33:07,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:33:07,295 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:33:07,295 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:33:07,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:33:07,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:33:07,295 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:33:07,295 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:33:07,295 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 -> fd38e103082400978e963855c45ad16aea167d5793b2ed8eb8338e9d66135232 [2025-01-09 13:33:07,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:33:07,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:33:07,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:33:07,575 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:33:07,575 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:33:07,576 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-while_file-67.i [2025-01-09 13:33:08,934 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ce9da6cc/b7c92d6fe9004296930f6cc4bcf6da5f/FLAG4f36c86b7 [2025-01-09 13:33:09,151 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:33:09,152 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-67.i [2025-01-09 13:33:09,163 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ce9da6cc/b7c92d6fe9004296930f6cc4bcf6da5f/FLAG4f36c86b7 [2025-01-09 13:33:09,182 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ce9da6cc/b7c92d6fe9004296930f6cc4bcf6da5f [2025-01-09 13:33:09,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:33:09,187 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:33:09,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:33:09,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:33:09,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:33:09,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:33:09" (1/1) ... [2025-01-09 13:33:09,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f3a110d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:09, skipping insertion in model container [2025-01-09 13:33:09,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:33:09" (1/1) ... [2025-01-09 13:33:09,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:33:09,362 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-while_file-67.i[915,928] [2025-01-09 13:33:09,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:33:09,441 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:33:09,453 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-while_file-67.i[915,928] [2025-01-09 13:33:09,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:33:09,502 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:33:09,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:09 WrapperNode [2025-01-09 13:33:09,503 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:33:09,504 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:33:09,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:33:09,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:33:09,510 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:33:09" (1/1) ... [2025-01-09 13:33:09,518 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:33:09" (1/1) ... [2025-01-09 13:33:09,535 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-01-09 13:33:09,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:33:09,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:33:09,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:33:09,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:33:09,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:09" (1/1) ... [2025-01-09 13:33:09,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:09" (1/1) ... [2025-01-09 13:33:09,548 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:09" (1/1) ... [2025-01-09 13:33:09,560 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:33:09,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:09" (1/1) ... [2025-01-09 13:33:09,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:09" (1/1) ... [2025-01-09 13:33:09,567 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:09" (1/1) ... [2025-01-09 13:33:09,568 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:09" (1/1) ... [2025-01-09 13:33:09,574 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:09" (1/1) ... [2025-01-09 13:33:09,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:09" (1/1) ... [2025-01-09 13:33:09,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:09" (1/1) ... [2025-01-09 13:33:09,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:33:09,590 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:33:09,590 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:33:09,590 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:33:09,591 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:09" (1/1) ... [2025-01-09 13:33:09,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:33:09,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:33:09,624 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:33:09,627 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:33:09,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:33:09,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:33:09,652 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:33:09,652 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:33:09,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:33:09,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:33:09,726 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:33:09,727 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:33:10,108 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 13:33:10,108 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:33:10,119 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:33:10,119 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:33:10,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:33:10 BoogieIcfgContainer [2025-01-09 13:33:10,120 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:33:10,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:33:10,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:33:10,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:33:10,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:33:09" (1/3) ... [2025-01-09 13:33:10,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69497ef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:33:10, skipping insertion in model container [2025-01-09 13:33:10,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:33:09" (2/3) ... [2025-01-09 13:33:10,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69497ef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:33:10, skipping insertion in model container [2025-01-09 13:33:10,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:33:10" (3/3) ... [2025-01-09 13:33:10,131 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-67.i [2025-01-09 13:33:10,145 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:33:10,146 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-67.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:33:10,193 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:33:10,204 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;@45cf53b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:33:10,204 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:33:10,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 13:33:10,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 13:33:10,218 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:33:10,218 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:10,219 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:33:10,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:33:10,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1082496245, now seen corresponding path program 1 times [2025-01-09 13:33:10,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:33:10,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513859803] [2025-01-09 13:33:10,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:33:10,247 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:33:10,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:33:10,250 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:33:10,251 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:33:10,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 13:33:10,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 13:33:10,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:33:10,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:33:10,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:33:10,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:33:10,473 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-01-09 13:33:10,473 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:33:10,474 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:33:10,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513859803] [2025-01-09 13:33:10,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [513859803] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:33:10,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:33:10,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:33:10,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105019632] [2025-01-09 13:33:10,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:33:10,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:33:10,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:33:10,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:33:10,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:33:10,501 INFO L87 Difference]: Start difference. First operand has 52 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 13:33:10,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:33:10,518 INFO L93 Difference]: Finished difference Result 98 states and 168 transitions. [2025-01-09 13:33:10,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:33:10,520 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 117 [2025-01-09 13:33:10,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:33:10,525 INFO L225 Difference]: With dead ends: 98 [2025-01-09 13:33:10,526 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 13:33:10,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 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:33:10,531 INFO L435 NwaCegarLoop]: 72 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, 72 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:33:10,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:33:10,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 13:33:10,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 13:33:10,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 13:33:10,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2025-01-09 13:33:10,580 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 72 transitions. Word has length 117 [2025-01-09 13:33:10,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:33:10,581 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 72 transitions. [2025-01-09 13:33:10,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 13:33:10,582 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2025-01-09 13:33:10,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 13:33:10,585 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:33:10,585 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:10,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-01-09 13:33:10,788 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:33:10,788 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:33:10,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:33:10,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1106629129, now seen corresponding path program 1 times [2025-01-09 13:33:10,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:33:10,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772465655] [2025-01-09 13:33:10,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:33:10,789 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:33:10,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:33:10,792 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:33:10,793 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:33:10,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 13:33:10,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 13:33:10,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:33:10,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:33:10,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 13:33:10,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:33:11,384 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 13:33:11,385 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:33:11,385 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:33:11,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772465655] [2025-01-09 13:33:11,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772465655] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:33:11,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:33:11,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:33:11,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236014162] [2025-01-09 13:33:11,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:33:11,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:33:11,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:33:11,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:33:11,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:33:11,389 INFO L87 Difference]: Start difference. First operand 49 states and 72 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 13:33:11,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:33:11,970 INFO L93 Difference]: Finished difference Result 196 states and 289 transitions. [2025-01-09 13:33:11,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:33:11,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 117 [2025-01-09 13:33:11,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:33:11,981 INFO L225 Difference]: With dead ends: 196 [2025-01-09 13:33:11,981 INFO L226 Difference]: Without dead ends: 150 [2025-01-09 13:33:11,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:33:11,985 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 83 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 13:33:11,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 280 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 13:33:11,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-01-09 13:33:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 94. [2025-01-09 13:33:12,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 13:33:12,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 141 transitions. [2025-01-09 13:33:12,038 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 141 transitions. Word has length 117 [2025-01-09 13:33:12,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:33:12,039 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 141 transitions. [2025-01-09 13:33:12,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 13:33:12,040 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 141 transitions. [2025-01-09 13:33:12,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 13:33:12,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:33:12,042 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:12,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 13:33:12,242 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:33:12,242 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:33:12,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:33:12,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1413330805, now seen corresponding path program 1 times [2025-01-09 13:33:12,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:33:12,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849793568] [2025-01-09 13:33:12,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:33:12,244 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:33:12,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:33:12,248 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:33:12,249 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:33:12,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 13:33:12,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 13:33:12,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:33:12,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:33:12,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 13:33:12,413 INFO L279 TraceCheckSpWp]: Computing forward predicates...