./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/interpolation.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/float-benchs/interpolation.c -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 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 18:27:56,984 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 18:27:57,053 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 18:27:57,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 18:27:57,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 18:27:57,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 18:27:57,090 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 18:27:57,090 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 18:27:57,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 18:27:57,091 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 18:27:57,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 18:27:57,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 18:27:57,092 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 18:27:57,092 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 18:27:57,092 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 18:27:57,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 18:27:57,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 18:27:57,093 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 18:27:57,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 18:27:57,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 18:27:57,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 18:27:57,093 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 18:27:57,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 18:27:57,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 18:27:57,094 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 18:27:57,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 18:27:57,094 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 18:27:57,094 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 18:27:57,094 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 18:27:57,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 18:27:57,094 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 18:27:57,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 18:27:57,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 18:27:57,095 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 18:27:57,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 18:27:57,095 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 18:27:57,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 18:27:57,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 18:27:57,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 18:27:57,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 18:27:57,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 18:27:57,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 18:27:57,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 18:27:57,096 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 -> 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd [2025-02-07 18:27:57,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 18:27:57,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 18:27:57,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 18:27:57,390 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 18:27:57,390 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 18:27:57,392 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation.c [2025-02-07 18:27:58,671 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81ca48024/5133f806d34d4daf9568b75f9c35759d/FLAG5f1dec318 [2025-02-07 18:27:58,974 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 18:27:58,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c [2025-02-07 18:27:58,982 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81ca48024/5133f806d34d4daf9568b75f9c35759d/FLAG5f1dec318 [2025-02-07 18:27:59,000 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81ca48024/5133f806d34d4daf9568b75f9c35759d [2025-02-07 18:27:59,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 18:27:59,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 18:27:59,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 18:27:59,005 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 18:27:59,009 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 18:27:59,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 06:27:59" (1/1) ... [2025-02-07 18:27:59,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c0edeed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:27:59, skipping insertion in model container [2025-02-07 18:27:59,011 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 06:27:59" (1/1) ... [2025-02-07 18:27:59,025 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 18:27:59,143 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/float-benchs/interpolation.c[449,462] [2025-02-07 18:27:59,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 18:27:59,169 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 18:27:59,176 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/float-benchs/interpolation.c[449,462] [2025-02-07 18:27:59,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 18:27:59,200 INFO L204 MainTranslator]: Completed translation [2025-02-07 18:27:59,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:27:59 WrapperNode [2025-02-07 18:27:59,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 18:27:59,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 18:27:59,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 18:27:59,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 18:27:59,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:27:59" (1/1) ... [2025-02-07 18:27:59,211 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:27:59" (1/1) ... [2025-02-07 18:27:59,223 INFO L138 Inliner]: procedures = 18, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2025-02-07 18:27:59,224 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 18:27:59,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 18:27:59,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 18:27:59,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 18:27:59,231 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:27:59" (1/1) ... [2025-02-07 18:27:59,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:27:59" (1/1) ... [2025-02-07 18:27:59,232 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:27:59" (1/1) ... [2025-02-07 18:27:59,241 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 8, 8]. 44 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2025-02-07 18:27:59,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:27:59" (1/1) ... [2025-02-07 18:27:59,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:27:59" (1/1) ... [2025-02-07 18:27:59,246 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:27:59" (1/1) ... [2025-02-07 18:27:59,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:27:59" (1/1) ... [2025-02-07 18:27:59,250 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:27:59" (1/1) ... [2025-02-07 18:27:59,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:27:59" (1/1) ... [2025-02-07 18:27:59,252 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 18:27:59,253 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 18:27:59,253 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 18:27:59,253 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 18:27:59,254 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:27:59" (1/1) ... [2025-02-07 18:27:59,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 18:27:59,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 18:27:59,280 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 18:27:59,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 18:27:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 18:27:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 18:27:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 18:27:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 18:27:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 18:27:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-07 18:27:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-07 18:27:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-07 18:27:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 18:27:59,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 18:27:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-07 18:27:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-07 18:27:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-07 18:27:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 18:27:59,370 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 18:27:59,372 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 18:27:59,511 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: call ULTIMATE.dealloc(main_~#min~0#1.base, main_~#min~0#1.offset);havoc main_~#min~0#1.base, main_~#min~0#1.offset;call ULTIMATE.dealloc(main_~#max~0#1.base, main_~#max~0#1.offset);havoc main_~#max~0#1.base, main_~#max~0#1.offset; [2025-02-07 18:27:59,523 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-02-07 18:27:59,523 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 18:27:59,532 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 18:27:59,534 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 18:27:59,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 06:27:59 BoogieIcfgContainer [2025-02-07 18:27:59,534 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 18:27:59,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 18:27:59,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 18:27:59,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 18:27:59,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 06:27:59" (1/3) ... [2025-02-07 18:27:59,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4349a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 06:27:59, skipping insertion in model container [2025-02-07 18:27:59,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:27:59" (2/3) ... [2025-02-07 18:27:59,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4349a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 06:27:59, skipping insertion in model container [2025-02-07 18:27:59,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 06:27:59" (3/3) ... [2025-02-07 18:27:59,544 INFO L128 eAbstractionObserver]: Analyzing ICFG interpolation.c [2025-02-07 18:27:59,556 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 18:27:59,557 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interpolation.c that has 1 procedures, 15 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 18:27:59,604 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 18:27:59,617 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;@22b5539a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 18:27:59,617 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 18:27:59,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:27:59,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 18:27:59,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:27:59,625 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 18:27:59,626 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:27:59,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:27:59,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1477152309, now seen corresponding path program 1 times [2025-02-07 18:27:59,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 18:27:59,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254086218] [2025-02-07 18:27:59,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:27:59,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 18:27:59,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 18:27:59,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 18:27:59,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:27:59,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:27:59,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:27:59,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 18:27:59,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254086218] [2025-02-07 18:27:59,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254086218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 18:27:59,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 18:27:59,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 18:27:59,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034432518] [2025-02-07 18:27:59,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 18:27:59,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 18:27:59,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 18:27:59,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 18:27:59,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 18:27:59,782 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:27:59,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:27:59,789 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2025-02-07 18:27:59,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 18:27:59,791 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-07 18:27:59,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:27:59,795 INFO L225 Difference]: With dead ends: 26 [2025-02-07 18:27:59,795 INFO L226 Difference]: Without dead ends: 11 [2025-02-07 18:27:59,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 18:27:59,800 INFO L435 NwaCegarLoop]: 17 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, 17 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 18:27:59,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 18:27:59,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-02-07 18:27:59,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-02-07 18:27:59,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:27:59,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2025-02-07 18:27:59,825 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2025-02-07 18:27:59,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:27:59,826 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-02-07 18:27:59,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:27:59,826 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2025-02-07 18:27:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 18:27:59,827 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:27:59,828 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 18:27:59,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 18:27:59,828 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:27:59,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:27:59,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1448523158, now seen corresponding path program 1 times [2025-02-07 18:27:59,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 18:27:59,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062899420] [2025-02-07 18:27:59,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:27:59,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 18:27:59,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 18:27:59,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 18:27:59,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:27:59,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:27:59,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:27:59,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 18:27:59,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062899420] [2025-02-07 18:27:59,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062899420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 18:27:59,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 18:27:59,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 18:27:59,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808474465] [2025-02-07 18:27:59,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 18:27:59,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 18:27:59,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 18:27:59,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 18:27:59,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 18:27:59,984 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:27:59,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:27:59,998 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2025-02-07 18:27:59,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 18:27:59,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-07 18:27:59,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:27:59,999 INFO L225 Difference]: With dead ends: 21 [2025-02-07 18:28:00,000 INFO L226 Difference]: Without dead ends: 17 [2025-02-07 18:28:00,001 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-02-07 18:28:00,002 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 18:28:00,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 19 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 18:28:00,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-02-07 18:28:00,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2025-02-07 18:28:00,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:28:00,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2025-02-07 18:28:00,008 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2025-02-07 18:28:00,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:28:00,008 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-02-07 18:28:00,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:28:00,009 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2025-02-07 18:28:00,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 18:28:00,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:28:00,009 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 18:28:00,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 18:28:00,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:28:00,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:28:00,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1955406919, now seen corresponding path program 1 times [2025-02-07 18:28:00,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 18:28:00,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285566502] [2025-02-07 18:28:00,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:28:00,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 18:28:00,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 18:28:00,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 18:28:00,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:28:00,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 18:28:00,040 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 18:28:00,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 18:28:00,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 18:28:00,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:28:00,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 18:28:00,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 18:28:00,079 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 18:28:00,080 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 18:28:00,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 18:28:00,085 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-07 18:28:00,102 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 18:28:00,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 06:28:00 BoogieIcfgContainer [2025-02-07 18:28:00,106 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 18:28:00,107 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 18:28:00,107 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 18:28:00,107 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 18:28:00,108 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 06:27:59" (3/4) ... [2025-02-07 18:28:00,110 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 18:28:00,110 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 18:28:00,111 INFO L158 Benchmark]: Toolchain (without parser) took 1107.39ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 49.6MB in the end (delta: 55.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-07 18:28:00,112 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 18:28:00,112 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.14ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 93.7MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 18:28:00,113 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.13ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 92.4MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 18:28:00,115 INFO L158 Benchmark]: Boogie Preprocessor took 27.75ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 91.5MB in the end (delta: 904.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 18:28:00,115 INFO L158 Benchmark]: IcfgBuilder took 281.76ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 78.8MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 18:28:00,115 INFO L158 Benchmark]: TraceAbstraction took 569.64ms. Allocated memory is still 142.6MB. Free memory was 78.8MB in the beginning and 49.6MB in the end (delta: 29.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-07 18:28:00,115 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 142.6MB. Free memory is still 49.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 18:28:00,116 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.25ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.14ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 93.7MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.13ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 92.4MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.75ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 91.5MB in the end (delta: 904.1kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 281.76ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 78.8MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 569.64ms. Allocated memory is still 142.6MB. Free memory was 78.8MB in the beginning and 49.6MB in the end (delta: 29.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 142.6MB. Free memory is still 49.6MB. 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: 9]: 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 22, overapproximation of someBinaryFLOATComparisonOperation at line 19, overapproximation of someBinaryFLOATComparisonOperation at line 19, overapproximation of someBinaryFLOATComparisonOperation at line 26, overapproximation of to_real at line 15, overapproximation of someBinaryArithmeticFLOAToperation at line 24. Possible FailurePath: [L13] int i; [L14] float z, t; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L18] t = __VERIFIER_nondet_float() [L19] EXPR min[0] [L19] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] VAL [max={4:0}] [L19] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L19] EXPR max[sizeof(max) / sizeof(max[0]) - 1] [L19] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] VAL [max={4:0}] [L19] CALL assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L7] COND FALSE !(!cond) [L19] RET assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L21] i = 0 VAL [i=0, max={4:0}] [L21] COND TRUE i < sizeof(min) / sizeof(min[0]) [L22] EXPR max[i] [L22] COND TRUE t <= max[i] [L24] EXPR min[i] [L24] EXPR max[i] [L24] EXPR min[i] [L24] z = (t - min[i]) / (max[i] - min[i]) [L26] CALL __VERIFIER_assert(z >= 0.f && z <= 1.f) [L9] COND TRUE !(cond) [L9] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6 IncrementalHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 28 mSDtfsCounter, 6 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred 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, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 18 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-07 18:28:00,135 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/float-benchs/interpolation.c -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 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 18:28:02,296 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 18:28:02,395 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-07 18:28:02,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 18:28:02,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 18:28:02,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 18:28:02,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 18:28:02,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 18:28:02,438 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 18:28:02,439 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 18:28:02,439 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 18:28:02,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 18:28:02,440 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 18:28:02,440 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 18:28:02,440 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 18:28:02,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 18:28:02,440 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 18:28:02,441 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 18:28:02,441 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 18:28:02,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 18:28:02,441 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 18:28:02,441 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 18:28:02,441 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 18:28:02,441 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 18:28:02,442 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 18:28:02,442 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 18:28:02,442 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 18:28:02,442 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 18:28:02,442 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 18:28:02,442 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 18:28:02,442 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 18:28:02,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 18:28:02,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 18:28:02,443 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 18:28:02,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 18:28:02,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 18:28:02,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 18:28:02,443 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 18:28:02,443 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 18:28:02,443 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 18:28:02,443 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 18:28:02,443 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 18:28:02,444 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 18:28:02,444 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 18:28:02,444 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 18:28:02,444 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 -> 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd [2025-02-07 18:28:02,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 18:28:02,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 18:28:02,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 18:28:02,729 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 18:28:02,730 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 18:28:02,731 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation.c [2025-02-07 18:28:04,019 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7cb4f4fc1/ebb48d350e014392872da922b46750ce/FLAGa424990da [2025-02-07 18:28:04,202 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 18:28:04,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c [2025-02-07 18:28:04,209 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7cb4f4fc1/ebb48d350e014392872da922b46750ce/FLAGa424990da [2025-02-07 18:28:04,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7cb4f4fc1/ebb48d350e014392872da922b46750ce [2025-02-07 18:28:04,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 18:28:04,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 18:28:04,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 18:28:04,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 18:28:04,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 18:28:04,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 06:28:04" (1/1) ... [2025-02-07 18:28:04,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76ebb5b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:28:04, skipping insertion in model container [2025-02-07 18:28:04,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 06:28:04" (1/1) ... [2025-02-07 18:28:04,244 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 18:28:04,379 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/float-benchs/interpolation.c[449,462] [2025-02-07 18:28:04,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 18:28:04,415 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 18:28:04,426 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/float-benchs/interpolation.c[449,462] [2025-02-07 18:28:04,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 18:28:04,457 INFO L204 MainTranslator]: Completed translation [2025-02-07 18:28:04,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:28:04 WrapperNode [2025-02-07 18:28:04,459 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 18:28:04,460 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 18:28:04,460 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 18:28:04,460 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 18:28:04,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:28:04" (1/1) ... [2025-02-07 18:28:04,474 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:28:04" (1/1) ... [2025-02-07 18:28:04,497 INFO L138 Inliner]: procedures = 19, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2025-02-07 18:28:04,498 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 18:28:04,499 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 18:28:04,499 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 18:28:04,499 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 18:28:04,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:28:04" (1/1) ... [2025-02-07 18:28:04,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:28:04" (1/1) ... [2025-02-07 18:28:04,509 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:28:04" (1/1) ... [2025-02-07 18:28:04,522 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 8, 8]. 44 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2025-02-07 18:28:04,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:28:04" (1/1) ... [2025-02-07 18:28:04,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:28:04" (1/1) ... [2025-02-07 18:28:04,535 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:28:04" (1/1) ... [2025-02-07 18:28:04,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:28:04" (1/1) ... [2025-02-07 18:28:04,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:28:04" (1/1) ... [2025-02-07 18:28:04,537 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:28:04" (1/1) ... [2025-02-07 18:28:04,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 18:28:04,540 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 18:28:04,540 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 18:28:04,541 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 18:28:04,542 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:28:04" (1/1) ... [2025-02-07 18:28:04,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 18:28:04,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 18:28:04,574 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 18:28:04,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 18:28:04,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 18:28:04,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-02-07 18:28:04,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-02-07 18:28:04,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-02-07 18:28:04,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 18:28:04,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-07 18:28:04,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-07 18:28:04,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 18:28:04,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-07 18:28:04,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-07 18:28:04,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-02-07 18:28:04,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 18:28:04,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 18:28:04,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 18:28:04,664 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 18:28:04,666 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 18:28:07,443 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: call ULTIMATE.dealloc(main_~#min~0#1.base, main_~#min~0#1.offset);havoc main_~#min~0#1.base, main_~#min~0#1.offset;call ULTIMATE.dealloc(main_~#max~0#1.base, main_~#max~0#1.offset);havoc main_~#max~0#1.base, main_~#max~0#1.offset; [2025-02-07 18:28:07,460 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-02-07 18:28:07,460 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 18:28:07,471 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 18:28:07,471 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 18:28:07,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 06:28:07 BoogieIcfgContainer [2025-02-07 18:28:07,474 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 18:28:07,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 18:28:07,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 18:28:07,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 18:28:07,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 06:28:04" (1/3) ... [2025-02-07 18:28:07,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@788f8bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 06:28:07, skipping insertion in model container [2025-02-07 18:28:07,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:28:04" (2/3) ... [2025-02-07 18:28:07,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@788f8bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 06:28:07, skipping insertion in model container [2025-02-07 18:28:07,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 06:28:07" (3/3) ... [2025-02-07 18:28:07,484 INFO L128 eAbstractionObserver]: Analyzing ICFG interpolation.c [2025-02-07 18:28:07,497 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 18:28:07,498 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interpolation.c that has 1 procedures, 15 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 18:28:07,538 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 18:28:07,551 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;@68843209, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 18:28:07,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 18:28:07,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:28:07,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 18:28:07,562 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:28:07,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 18:28:07,563 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:28:07,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:28:07,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1477152309, now seen corresponding path program 1 times [2025-02-07 18:28:07,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 18:28:07,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507855304] [2025-02-07 18:28:07,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:28:07,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 18:28:07,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 18:28:07,586 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-07 18:28:07,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-07 18:28:07,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 18:28:07,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 18:28:07,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:28:07,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:28:07,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-07 18:28:07,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:28:07,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:28:07,872 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 18:28:07,872 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 18:28:07,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507855304] [2025-02-07 18:28:07,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507855304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 18:28:07,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 18:28:07,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 18:28:07,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442995293] [2025-02-07 18:28:07,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 18:28:07,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 18:28:07,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 18:28:07,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 18:28:07,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 18:28:07,895 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:28:07,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:28:07,902 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2025-02-07 18:28:07,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 18:28:07,904 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-07 18:28:07,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:28:07,907 INFO L225 Difference]: With dead ends: 26 [2025-02-07 18:28:07,907 INFO L226 Difference]: Without dead ends: 11 [2025-02-07 18:28:07,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 18:28:07,911 INFO L435 NwaCegarLoop]: 17 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, 17 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 18:28:07,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 18:28:07,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-02-07 18:28:07,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-02-07 18:28:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:28:07,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2025-02-07 18:28:07,937 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2025-02-07 18:28:07,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:28:07,938 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-02-07 18:28:07,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:28:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2025-02-07 18:28:07,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 18:28:07,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:28:07,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 18:28:07,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-07 18:28:08,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 18:28:08,139 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:28:08,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:28:08,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1448523158, now seen corresponding path program 1 times [2025-02-07 18:28:08,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 18:28:08,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942241768] [2025-02-07 18:28:08,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:28:08,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 18:28:08,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 18:28:08,143 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-07 18:28:08,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-07 18:28:08,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 18:28:08,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 18:28:08,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:28:08,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:28:08,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-07 18:28:08,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:28:08,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:28:08,420 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 18:28:08,420 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 18:28:08,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942241768] [2025-02-07 18:28:08,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942241768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 18:28:08,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 18:28:08,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 18:28:08,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244971153] [2025-02-07 18:28:08,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 18:28:08,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 18:28:08,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 18:28:08,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 18:28:08,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 18:28:08,423 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:28:10,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 18:28:10,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:28:10,919 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2025-02-07 18:28:10,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 18:28:10,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-07 18:28:10,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:28:10,920 INFO L225 Difference]: With dead ends: 18 [2025-02-07 18:28:10,920 INFO L226 Difference]: Without dead ends: 14 [2025-02-07 18:28:10,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-02-07 18:28:10,921 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-07 18:28:10,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 17 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-07 18:28:10,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-02-07 18:28:10,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2025-02-07 18:28:10,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:28:10,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2025-02-07 18:28:10,924 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2025-02-07 18:28:10,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:28:10,925 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-02-07 18:28:10,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:28:10,925 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2025-02-07 18:28:10,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 18:28:10,925 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:28:10,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 18:28:10,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-07 18:28:11,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 18:28:11,126 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:28:11,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:28:11,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1955406919, now seen corresponding path program 1 times [2025-02-07 18:28:11,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 18:28:11,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194579487] [2025-02-07 18:28:11,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:28:11,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 18:28:11,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 18:28:11,129 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-07 18:28:11,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-07 18:28:11,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 18:28:11,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 18:28:11,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:28:11,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:28:11,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-07 18:28:11,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:28:13,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 18:28:13,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 348 treesize of output 264 [2025-02-07 18:28:13,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 277 treesize of output 157 [2025-02-07 18:28:24,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:28:24,918 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 18:28:24,918 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 18:28:24,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194579487] [2025-02-07 18:28:24,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194579487] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 18:28:24,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 18:28:24,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-07 18:28:24,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758398850] [2025-02-07 18:28:24,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 18:28:24,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 18:28:24,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 18:28:24,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 18:28:24,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-07 18:28:24,920 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 10 states, 10 states have (on average 1.0) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:28:26,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 18:28:30,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 18:28:34,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 18:28:34,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:28:34,312 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2025-02-07 18:28:34,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 18:28:34,313 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.0) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-07 18:28:34,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:28:34,314 INFO L225 Difference]: With dead ends: 24 [2025-02-07 18:28:34,314 INFO L226 Difference]: Without dead ends: 20 [2025-02-07 18:28:34,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-07 18:28:34,315 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2025-02-07 18:28:34,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 25 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2025-02-07 18:28:34,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-07 18:28:34,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2025-02-07 18:28:34,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:28:34,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2025-02-07 18:28:34,318 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2025-02-07 18:28:34,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:28:34,318 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-02-07 18:28:34,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.0) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:28:34,319 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2025-02-07 18:28:34,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 18:28:34,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:28:34,319 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 18:28:34,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-07 18:28:34,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 18:28:34,520 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:28:34,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:28:34,521 INFO L85 PathProgramCache]: Analyzing trace with hash 532105914, now seen corresponding path program 1 times [2025-02-07 18:28:34,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 18:28:34,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137671791] [2025-02-07 18:28:34,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:28:34,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 18:28:34,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 18:28:34,524 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-07 18:28:34,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-07 18:28:34,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 18:28:34,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 18:28:34,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:28:34,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:28:34,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 18:28:34,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:28:34,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:28:34,810 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 18:28:34,810 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 18:28:34,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137671791] [2025-02-07 18:28:34,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137671791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 18:28:34,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 18:28:34,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 18:28:34,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329059432] [2025-02-07 18:28:34,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 18:28:34,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 18:28:34,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 18:28:34,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 18:28:34,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 18:28:34,811 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:28:34,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:28:34,856 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2025-02-07 18:28:34,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 18:28:34,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-07 18:28:34,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:28:34,857 INFO L225 Difference]: With dead ends: 23 [2025-02-07 18:28:34,857 INFO L226 Difference]: Without dead ends: 13 [2025-02-07 18:28:34,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 18:28:34,858 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 18:28:34,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 18:28:34,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-07 18:28:34,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-02-07 18:28:34,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:28:34,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2025-02-07 18:28:34,861 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2025-02-07 18:28:34,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:28:34,861 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2025-02-07 18:28:34,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:28:34,861 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2025-02-07 18:28:34,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 18:28:34,861 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:28:34,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 18:28:34,872 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 (5)] Ended with exit code 0 [2025-02-07 18:28:35,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 18:28:35,062 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:28:35,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:28:35,063 INFO L85 PathProgramCache]: Analyzing trace with hash -486044599, now seen corresponding path program 1 times [2025-02-07 18:28:35,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 18:28:35,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7741503] [2025-02-07 18:28:35,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:28:35,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 18:28:35,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 18:28:35,067 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-07 18:28:35,068 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 (6)] Waiting until timeout for monitored process [2025-02-07 18:28:35,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 18:28:35,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 18:28:35,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:28:35,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:28:35,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 18:28:35,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:28:35,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:28:35,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 18:28:35,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:28:35,378 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 18:28:35,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7741503] [2025-02-07 18:28:35,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7741503] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 18:28:35,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 18:28:35,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-02-07 18:28:35,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62050113] [2025-02-07 18:28:35,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 18:28:35,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 18:28:35,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 18:28:35,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 18:28:35,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 18:28:35,380 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:28:39,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 18:28:41,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 18:28:41,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:28:41,608 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2025-02-07 18:28:41,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 18:28:41,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-07 18:28:41,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:28:41,610 INFO L225 Difference]: With dead ends: 25 [2025-02-07 18:28:41,610 INFO L226 Difference]: Without dead ends: 21 [2025-02-07 18:28:41,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-07 18:28:41,611 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-02-07 18:28:41,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 32 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2025-02-07 18:28:41,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-02-07 18:28:41,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2025-02-07 18:28:41,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:28:41,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2025-02-07 18:28:41,615 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2025-02-07 18:28:41,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:28:41,615 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2025-02-07 18:28:41,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:28:41,615 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2025-02-07 18:28:41,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 18:28:41,615 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:28:41,615 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 18:28:41,626 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 (6)] Ended with exit code 0 [2025-02-07 18:28:41,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 18:28:41,816 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:28:41,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:28:41,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2111624634, now seen corresponding path program 1 times [2025-02-07 18:28:41,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 18:28:41,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284878809] [2025-02-07 18:28:41,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:28:41,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 18:28:41,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 18:28:41,820 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-07 18:28:41,821 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 (7)] Waiting until timeout for monitored process [2025-02-07 18:28:41,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 18:28:42,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 18:28:42,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:28:42,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:28:42,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-07 18:28:42,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:28:45,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 18:28:45,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 393 treesize of output 285 [2025-02-07 18:28:45,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 18:28:45,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 279 treesize of output 159 [2025-02-07 18:28:50,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:28:50,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 18:29:01,552 WARN L286 SmtUtils]: Spent 6.36s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)