./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-79.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-79.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 087e6cd2d99060c16318d94e67eed026c21e542402823046e52131085ccd5550 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:22:47,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:22:47,921 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:22:47,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:22:47,926 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:22:47,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:22:47,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:22:47,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:22:47,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:22:47,947 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:22:47,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:22:47,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:22:47,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:22:47,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:22:47,948 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:22:47,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:22:47,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:22:47,948 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:22:47,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:22:47,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:22:47,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:22:47,948 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:22:47,948 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:22:47,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:22:47,949 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:22:47,949 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:22:47,949 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:22:47,949 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:22:47,949 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:22:47,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:22:47,949 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:22:47,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:22:47,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:22:47,949 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:22:47,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:22:47,949 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:22:47,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:22:47,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:22:47,949 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:22:47,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:22:47,950 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:22:47,950 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:22:47,950 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:22:47,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:22:47,950 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:22:47,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:22:47,950 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:22:47,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:22:47,950 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 -> 087e6cd2d99060c16318d94e67eed026c21e542402823046e52131085ccd5550 [2025-01-09 13:22:48,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:22:48,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:22:48,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:22:48,226 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:22:48,227 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:22:48,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-79.i [2025-01-09 13:22:49,350 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85d38c6c5/e738deeffd224f5b9a85994ccd28d5c0/FLAG25d8318c8 [2025-01-09 13:22:49,617 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:22:49,617 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-79.i [2025-01-09 13:22:49,626 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85d38c6c5/e738deeffd224f5b9a85994ccd28d5c0/FLAG25d8318c8 [2025-01-09 13:22:49,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85d38c6c5/e738deeffd224f5b9a85994ccd28d5c0 [2025-01-09 13:22:49,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:22:49,938 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:22:49,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:22:49,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:22:49,942 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:22:49,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:22:49" (1/1) ... [2025-01-09 13:22:49,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4717e1ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:49, skipping insertion in model container [2025-01-09 13:22:49,944 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:22:49" (1/1) ... [2025-01-09 13:22:49,957 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:22:50,067 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-79.i[915,928] [2025-01-09 13:22:50,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:22:50,108 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:22:50,116 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-79.i[915,928] [2025-01-09 13:22:50,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:22:50,151 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:22:50,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:50 WrapperNode [2025-01-09 13:22:50,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:22:50,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:22:50,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:22:50,153 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:22:50,158 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:22:50" (1/1) ... [2025-01-09 13:22:50,163 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:22:50" (1/1) ... [2025-01-09 13:22:50,183 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2025-01-09 13:22:50,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:22:50,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:22:50,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:22:50,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:22:50,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:50" (1/1) ... [2025-01-09 13:22:50,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:50" (1/1) ... [2025-01-09 13:22:50,198 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:50" (1/1) ... [2025-01-09 13:22:50,214 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:22:50,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:50" (1/1) ... [2025-01-09 13:22:50,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:50" (1/1) ... [2025-01-09 13:22:50,223 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:50" (1/1) ... [2025-01-09 13:22:50,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:50" (1/1) ... [2025-01-09 13:22:50,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:50" (1/1) ... [2025-01-09 13:22:50,227 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:50" (1/1) ... [2025-01-09 13:22:50,227 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:50" (1/1) ... [2025-01-09 13:22:50,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:22:50,230 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:22:50,230 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:22:50,230 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:22:50,231 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:50" (1/1) ... [2025-01-09 13:22:50,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:22:50,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:22:50,264 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:22:50,267 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:22:50,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:22:50,285 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:22:50,286 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:22:50,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:22:50,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:22:50,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:22:50,338 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:22:50,339 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:22:50,483 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-01-09 13:22:50,484 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:22:50,490 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:22:50,490 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:22:50,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:22:50 BoogieIcfgContainer [2025-01-09 13:22:50,491 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:22:50,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:22:50,493 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:22:50,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:22:50,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:22:49" (1/3) ... [2025-01-09 13:22:50,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3d9be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:22:50, skipping insertion in model container [2025-01-09 13:22:50,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:50" (2/3) ... [2025-01-09 13:22:50,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3d9be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:22:50, skipping insertion in model container [2025-01-09 13:22:50,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:22:50" (3/3) ... [2025-01-09 13:22:50,499 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-79.i [2025-01-09 13:22:50,509 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:22:50,510 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-79.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:22:50,550 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:22:50,559 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;@58348aeb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:22:50,559 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:22:50,562 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 13:22:50,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 13:22:50,568 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:22:50,568 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:50,569 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:22:50,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:22:50,572 INFO L85 PathProgramCache]: Analyzing trace with hash 2140552908, now seen corresponding path program 1 times [2025-01-09 13:22:50,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:22:50,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370735481] [2025-01-09 13:22:50,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:22:50,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:22:50,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 13:22:50,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 13:22:50,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:22:50,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:22:50,739 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-01-09 13:22:50,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:22:50,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370735481] [2025-01-09 13:22:50,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370735481] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:22:50,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454397440] [2025-01-09 13:22:50,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:22:50,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:22:50,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:22:50,744 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:22:50,745 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:22:50,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 13:22:50,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 13:22:50,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:22:50,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:22:50,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:22:50,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:22:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-01-09 13:22:50,866 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:22:50,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454397440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:22:50,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:22:50,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:22:50,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147497753] [2025-01-09 13:22:50,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:22:50,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:22:50,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:22:50,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:22:50,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:22:50,885 INFO L87 Difference]: Start difference. First operand has 46 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 13:22:50,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:22:50,899 INFO L93 Difference]: Finished difference Result 89 states and 142 transitions. [2025-01-09 13:22:50,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:22:50,901 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2025-01-09 13:22:50,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:22:50,904 INFO L225 Difference]: With dead ends: 89 [2025-01-09 13:22:50,905 INFO L226 Difference]: Without dead ends: 43 [2025-01-09 13:22:50,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 87 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:22:50,908 INFO L435 NwaCegarLoop]: 64 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, 64 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:22:50,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:22:50,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-09 13:22:50,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-01-09 13:22:50,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 13:22:50,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2025-01-09 13:22:50,934 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 86 [2025-01-09 13:22:50,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:22:50,934 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2025-01-09 13:22:50,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 13:22:50,934 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2025-01-09 13:22:50,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 13:22:50,936 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:22:50,936 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:50,942 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:22:51,140 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:22:51,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:22:51,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:22:51,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1784722602, now seen corresponding path program 1 times [2025-01-09 13:22:51,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:22:51,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428937233] [2025-01-09 13:22:51,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:22:51,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:22:51,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 13:22:51,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 13:22:51,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:22:51,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:22:51,285 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 13:22:51,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:22:51,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428937233] [2025-01-09 13:22:51,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428937233] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:22:51,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:22:51,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:22:51,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597994588] [2025-01-09 13:22:51,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:22:51,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:22:51,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:22:51,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:22:51,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:22:51,287 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:22:51,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:22:51,320 INFO L93 Difference]: Finished difference Result 94 states and 133 transitions. [2025-01-09 13:22:51,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:22:51,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 86 [2025-01-09 13:22:51,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:22:51,323 INFO L225 Difference]: With dead ends: 94 [2025-01-09 13:22:51,323 INFO L226 Difference]: Without dead ends: 54 [2025-01-09 13:22:51,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:22:51,324 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 15 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:22:51,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 112 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:22:51,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-09 13:22:51,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2025-01-09 13:22:51,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 13:22:51,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2025-01-09 13:22:51,330 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 86 [2025-01-09 13:22:51,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:22:51,331 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2025-01-09 13:22:51,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:22:51,331 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2025-01-09 13:22:51,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 13:22:51,332 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:22:51,333 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:51,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:22:51,333 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:22:51,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:22:51,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1197440697, now seen corresponding path program 1 times [2025-01-09 13:22:51,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:22:51,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199008346] [2025-01-09 13:22:51,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:22:51,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:22:51,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 13:22:51,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 13:22:51,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:22:51,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:22:51,403 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:22:51,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 13:22:51,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 13:22:51,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:22:51,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:22:51,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:22:51,487 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:22:51,488 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:22:51,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:22:51,492 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 13:22:51,544 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:22:51,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:22:51 BoogieIcfgContainer [2025-01-09 13:22:51,547 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:22:51,547 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:22:51,547 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:22:51,548 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:22:51,548 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:22:50" (3/4) ... [2025-01-09 13:22:51,550 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:22:51,550 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:22:51,551 INFO L158 Benchmark]: Toolchain (without parser) took 1612.24ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 110.0MB in the end (delta: 12.5MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2025-01-09 13:22:51,551 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:22:51,551 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.08ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 109.8MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:22:51,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.39ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 108.1MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:22:51,551 INFO L158 Benchmark]: Boogie Preprocessor took 43.66ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 106.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:22:51,551 INFO L158 Benchmark]: RCFGBuilder took 260.99ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 91.8MB in the end (delta: 14.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:22:51,551 INFO L158 Benchmark]: TraceAbstraction took 1054.38ms. Allocated memory is still 167.8MB. Free memory was 91.3MB in the beginning and 111.0MB in the end (delta: -19.7MB). Peak memory consumption was 63.8MB. Max. memory is 16.1GB. [2025-01-09 13:22:51,552 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 110.0MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:22:51,552 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.08ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 109.8MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.39ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 108.1MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.66ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 106.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 260.99ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 91.8MB in the end (delta: 14.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1054.38ms. Allocated memory is still 167.8MB. Free memory was 91.3MB in the beginning and 111.0MB in the end (delta: -19.7MB). Peak memory consumption was 63.8MB. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 110.0MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 44, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L23] unsigned char var_1_2 = 1; [L24] signed char var_1_3 = 0; [L25] signed char var_1_4 = 64; [L26] signed char var_1_5 = 64; [L27] unsigned short int var_1_6 = 25; [L28] float var_1_7 = 256.4; [L29] double var_1_10 = 9999999999.515; [L30] float var_1_11 = 8.5; [L31] float var_1_12 = 2.5; [L32] double var_1_13 = 15.8; [L33] double var_1_14 = 25.8; VAL [isInitial=0, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L94] isInitial = 1 [L95] FCALL initially() [L96] int k_loop; [L97] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L97] COND TRUE k_loop < 1 [L98] FCALL updateLastVariables() [L99] CALL updateVariables() [L64] var_1_2 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L65] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L66] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L66] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L67] var_1_3 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L68] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L69] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L69] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L70] var_1_4 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_4 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L71] RET assume_abort_if_not(var_1_4 >= -1) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L72] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L72] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L73] var_1_5 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25, var_1_7=1282/5] [L74] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25, var_1_7=1282/5] [L75] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25, var_1_7=1282/5] [L75] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25, var_1_7=1282/5] [L76] var_1_7 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L77] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L78] var_1_11 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L79] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L80] var_1_12 = __VERIFIER_nondet_float() [L81] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L81] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L82] var_1_13 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L83] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L84] var_1_14 = __VERIFIER_nondet_double() [L85] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L85] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L99] RET updateVariables() [L100] CALL step() [L37] COND TRUE ! var_1_2 VAL [isInitial=1, var_1_10=1999999999903/200, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L38] COND TRUE ! var_1_2 [L39] var_1_1 = (var_1_3 + -32) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_1=-95, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L44] COND FALSE !(var_1_7 < (var_1_11 - var_1_12)) [L51] var_1_10 = var_1_14 VAL [isInitial=1, var_1_10=10000000004, var_1_14=10000000004, var_1_1=-95, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L53] COND FALSE !(\read(var_1_2)) [L60] var_1_6 = 16 VAL [isInitial=1, var_1_10=10000000004, var_1_14=10000000004, var_1_1=-95, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=16] [L100] RET step() [L101] CALL, EXPR property() [L90-L91] return (((! var_1_2) ? ((! var_1_2) ? (var_1_1 == ((signed char) (var_1_3 + -32))) : (var_1_1 == ((signed char) (var_1_4 - var_1_5)))) : 1) && (var_1_2 ? (((var_1_7 - ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) <= var_1_10) ? (var_1_6 == ((unsigned short int) ((((256) < 0 ) ? -(256) : (256))))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) 16)))) && ((var_1_7 < (var_1_11 - var_1_12)) ? (((var_1_7 / 7.2) <= var_1_11) ? (var_1_10 == ((double) (var_1_13 - var_1_14))) : (var_1_10 == ((double) var_1_13))) : (var_1_10 == ((double) var_1_14))) ; VAL [\result=0, isInitial=1, var_1_10=10000000004, var_1_14=10000000004, var_1_1=-95, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=16] [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=10000000004, var_1_14=10000000004, var_1_1=-95, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=16] [L19] reach_error() VAL [isInitial=1, var_1_10=10000000004, var_1_14=10000000004, var_1_1=-95, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 176 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 129 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 203 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 912/936 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:22:51,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-79.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 087e6cd2d99060c16318d94e67eed026c21e542402823046e52131085ccd5550 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:22:53,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:22:53,567 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:22:53,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:22:53,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:22:53,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:22:53,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:22:53,589 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:22:53,590 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:22:53,590 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:22:53,590 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:22:53,590 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:22:53,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:22:53,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:22:53,590 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:22:53,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:22:53,591 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:22:53,591 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:22:53,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:22:53,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:22:53,591 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:22:53,591 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:22:53,591 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:22:53,591 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:22:53,591 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:22:53,591 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:22:53,591 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:22:53,592 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:22:53,592 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:22:53,592 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:22:53,592 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:22:53,592 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:22:53,592 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:22:53,592 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:22:53,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:22:53,593 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:22:53,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:22:53,594 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:22:53,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:22:53,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:22:53,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:22:53,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:22:53,594 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:22:53,594 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:22:53,594 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:22:53,594 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:22:53,594 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:22:53,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:22:53,594 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:22:53,594 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:22:53,594 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 -> 087e6cd2d99060c16318d94e67eed026c21e542402823046e52131085ccd5550 [2025-01-09 13:22:53,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:22:53,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:22:53,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:22:53,832 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:22:53,832 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:22:53,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-79.i [2025-01-09 13:22:54,987 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aaac57e5b/572c24b6230c417682b964dacb728933/FLAG7175fb24e [2025-01-09 13:22:55,165 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:22:55,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-79.i [2025-01-09 13:22:55,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aaac57e5b/572c24b6230c417682b964dacb728933/FLAG7175fb24e [2025-01-09 13:22:55,540 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aaac57e5b/572c24b6230c417682b964dacb728933 [2025-01-09 13:22:55,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:22:55,543 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:22:55,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:22:55,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:22:55,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:22:55,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:22:55" (1/1) ... [2025-01-09 13:22:55,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fdd4dd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:55, skipping insertion in model container [2025-01-09 13:22:55,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:22:55" (1/1) ... [2025-01-09 13:22:55,559 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:22:55,650 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-79.i[915,928] [2025-01-09 13:22:55,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:22:55,703 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:22:55,711 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-79.i[915,928] [2025-01-09 13:22:55,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:22:55,742 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:22:55,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:55 WrapperNode [2025-01-09 13:22:55,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:22:55,745 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:22:55,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:22:55,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:22:55,752 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:22:55" (1/1) ... [2025-01-09 13:22:55,765 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:22:55" (1/1) ... [2025-01-09 13:22:55,785 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2025-01-09 13:22:55,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:22:55,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:22:55,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:22:55,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:22:55,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:55" (1/1) ... [2025-01-09 13:22:55,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:55" (1/1) ... [2025-01-09 13:22:55,802 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:55" (1/1) ... [2025-01-09 13:22:55,816 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:22:55,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:55" (1/1) ... [2025-01-09 13:22:55,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:55" (1/1) ... [2025-01-09 13:22:55,829 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:55" (1/1) ... [2025-01-09 13:22:55,830 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:55" (1/1) ... [2025-01-09 13:22:55,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:55" (1/1) ... [2025-01-09 13:22:55,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:55" (1/1) ... [2025-01-09 13:22:55,843 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:55" (1/1) ... [2025-01-09 13:22:55,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:22:55,846 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:22:55,848 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:22:55,848 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:22:55,849 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:55" (1/1) ... [2025-01-09 13:22:55,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:22:55,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:22:55,883 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:22:55,889 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:22:55,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:22:55,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:22:55,907 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:22:55,907 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:22:55,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:22:55,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:22:55,965 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:22:55,967 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:23:09,806 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-01-09 13:23:09,806 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:23:09,812 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:23:09,813 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:23:09,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:23:09 BoogieIcfgContainer [2025-01-09 13:23:09,813 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:23:09,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:23:09,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:23:09,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:23:09,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:22:55" (1/3) ... [2025-01-09 13:23:09,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fbf40b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:23:09, skipping insertion in model container [2025-01-09 13:23:09,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:22:55" (2/3) ... [2025-01-09 13:23:09,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fbf40b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:23:09, skipping insertion in model container [2025-01-09 13:23:09,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:23:09" (3/3) ... [2025-01-09 13:23:09,820 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-79.i [2025-01-09 13:23:09,830 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:23:09,831 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-79.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:23:09,864 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:23:09,871 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;@4fd25ecd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:23:09,872 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:23:09,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 13:23:09,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 13:23:09,880 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:23:09,880 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:09,880 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:23:09,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:23:09,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2140552908, now seen corresponding path program 1 times [2025-01-09 13:23:09,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:23:09,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799779930] [2025-01-09 13:23:09,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:23:09,891 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:23:09,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:23:09,894 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:23:09,906 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:23:09,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 13:23:10,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 13:23:10,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:23:10,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:23:10,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:23:10,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:23:10,784 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-01-09 13:23:10,786 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:23:10,786 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:23:10,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1799779930] [2025-01-09 13:23:10,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1799779930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:23:10,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:23:10,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:23:10,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066651913] [2025-01-09 13:23:10,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:23:10,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:23:10,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:23:10,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:23:10,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:23:10,808 INFO L87 Difference]: Start difference. First operand has 46 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 13:23:10,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:23:10,822 INFO L93 Difference]: Finished difference Result 89 states and 142 transitions. [2025-01-09 13:23:10,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:23:10,823 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2025-01-09 13:23:10,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:23:10,827 INFO L225 Difference]: With dead ends: 89 [2025-01-09 13:23:10,827 INFO L226 Difference]: Without dead ends: 43 [2025-01-09 13:23:10,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 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:23:10,832 INFO L435 NwaCegarLoop]: 64 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, 64 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:23:10,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:23:10,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-09 13:23:10,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-01-09 13:23:10,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 13:23:10,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2025-01-09 13:23:10,859 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 86 [2025-01-09 13:23:10,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:23:10,860 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2025-01-09 13:23:10,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 13:23:10,861 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2025-01-09 13:23:10,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 13:23:10,863 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:23:10,864 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:10,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 13:23:11,068 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:23:11,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:23:11,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:23:11,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1784722602, now seen corresponding path program 1 times [2025-01-09 13:23:11,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:23:11,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [441087200] [2025-01-09 13:23:11,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:23:11,071 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:23:11,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:23:11,073 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:23:11,074 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:23:11,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 13:23:11,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 13:23:11,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:23:11,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:23:11,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 13:23:11,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:23:12,099 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 13:23:12,099 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:23:12,099 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:23:12,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [441087200] [2025-01-09 13:23:12,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [441087200] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:23:12,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:23:12,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:23:12,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407894524] [2025-01-09 13:23:12,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:23:12,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:23:12,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:23:12,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:23:12,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:23:12,102 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:23:16,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:23:20,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:23:20,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:23:20,543 INFO L93 Difference]: Finished difference Result 94 states and 133 transitions. [2025-01-09 13:23:20,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:23:20,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 86 [2025-01-09 13:23:20,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:23:20,650 INFO L225 Difference]: With dead ends: 94 [2025-01-09 13:23:20,650 INFO L226 Difference]: Without dead ends: 54 [2025-01-09 13:23:20,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:23:20,651 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 15 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-01-09 13:23:20,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 111 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-01-09 13:23:20,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-09 13:23:20,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2025-01-09 13:23:20,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 13:23:20,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2025-01-09 13:23:20,657 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 86 [2025-01-09 13:23:20,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:23:20,658 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2025-01-09 13:23:20,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:23:20,658 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2025-01-09 13:23:20,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 13:23:20,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:23:20,660 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:20,682 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:23:20,860 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:23:20,861 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:23:20,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:23:20,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1197440697, now seen corresponding path program 1 times [2025-01-09 13:23:20,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:23:20,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086724552] [2025-01-09 13:23:20,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:23:20,862 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:23:20,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:23:20,864 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:23:20,864 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:23:20,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 13:23:21,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 13:23:21,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:23:21,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:23:21,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 13:23:21,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:23:44,834 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 13:23:57,304 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 13:24:10,176 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 13:24:22,650 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)