./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-22.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 980b1737abc4897cffcf9ffd697bb8a6c2567cb964b43bf5603c43f896e3728c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:16:00,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:16:00,086 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:16:00,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:16:00,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:16:00,109 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:16:00,109 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:16:00,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:16:00,109 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:16:00,110 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:16:00,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:16:00,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:16:00,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:16:00,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:16:00,110 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:16:00,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:16:00,110 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:16:00,110 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:16:00,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:16:00,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:16:00,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:16:00,111 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:16:00,111 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:16:00,111 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:16:00,111 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:16:00,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:16:00,111 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:16:00,111 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:16:00,111 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:16:00,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:16:00,111 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:16:00,111 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:16:00,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:16:00,112 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:16:00,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:16:00,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:16:00,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:16:00,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:16:00,112 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:16:00,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:16:00,112 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:16:00,112 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:16:00,112 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:16:00,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:16:00,112 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:16:00,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:16:00,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:16:00,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:16:00,113 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 -> 980b1737abc4897cffcf9ffd697bb8a6c2567cb964b43bf5603c43f896e3728c [2025-01-09 14:16:00,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:16:00,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:16:00,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:16:00,277 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:16:00,277 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:16:00,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-22.i [2025-01-09 14:16:01,405 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4a029d8d/d0d6beb652694570b1692cfe5f1976ba/FLAGd41d3ab07 [2025-01-09 14:16:01,685 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:16:01,686 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-22.i [2025-01-09 14:16:01,691 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4a029d8d/d0d6beb652694570b1692cfe5f1976ba/FLAGd41d3ab07 [2025-01-09 14:16:01,979 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4a029d8d/d0d6beb652694570b1692cfe5f1976ba [2025-01-09 14:16:01,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:16:01,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:16:01,983 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:16:01,983 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:16:01,986 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:16:01,987 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:16:01" (1/1) ... [2025-01-09 14:16:01,987 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ca01079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:01, skipping insertion in model container [2025-01-09 14:16:01,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:16:01" (1/1) ... [2025-01-09 14:16:01,996 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:16:02,093 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-22.i[915,928] [2025-01-09 14:16:02,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:16:02,127 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:16:02,135 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-22.i[915,928] [2025-01-09 14:16:02,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:16:02,155 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:16:02,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:02 WrapperNode [2025-01-09 14:16:02,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:16:02,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:16:02,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:16:02,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:16:02,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:02" (1/1) ... [2025-01-09 14:16:02,168 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:02" (1/1) ... [2025-01-09 14:16:02,180 INFO L138 Inliner]: procedures = 26, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 59 [2025-01-09 14:16:02,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:16:02,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:16:02,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:16:02,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:16:02,188 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:02" (1/1) ... [2025-01-09 14:16:02,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:02" (1/1) ... [2025-01-09 14:16:02,190 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:02" (1/1) ... [2025-01-09 14:16:02,204 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:16:02,205 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:02" (1/1) ... [2025-01-09 14:16:02,205 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:02" (1/1) ... [2025-01-09 14:16:02,209 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:02" (1/1) ... [2025-01-09 14:16:02,213 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:02" (1/1) ... [2025-01-09 14:16:02,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:02" (1/1) ... [2025-01-09 14:16:02,216 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:02" (1/1) ... [2025-01-09 14:16:02,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:02" (1/1) ... [2025-01-09 14:16:02,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:16:02,219 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:16:02,219 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:16:02,219 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:16:02,220 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:02" (1/1) ... [2025-01-09 14:16:02,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:16:02,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:16:02,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:16:02,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:16:02,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:16:02,265 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:16:02,265 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:16:02,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:16:02,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:16:02,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:16:02,306 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:16:02,307 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:16:02,385 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 14:16:02,386 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:16:02,391 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:16:02,392 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:16:02,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:16:02 BoogieIcfgContainer [2025-01-09 14:16:02,392 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:16:02,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:16:02,394 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:16:02,397 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:16:02,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:16:01" (1/3) ... [2025-01-09 14:16:02,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678cef5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:16:02, skipping insertion in model container [2025-01-09 14:16:02,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:02" (2/3) ... [2025-01-09 14:16:02,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678cef5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:16:02, skipping insertion in model container [2025-01-09 14:16:02,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:16:02" (3/3) ... [2025-01-09 14:16:02,398 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-22.i [2025-01-09 14:16:02,407 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:16:02,408 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-22.i that has 2 procedures, 30 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:16:02,437 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:16:02,444 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;@877bdc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:16:02,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:16:02,446 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 14:16:02,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 14:16:02,450 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:16:02,450 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:16:02,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:16:02,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:16:02,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1098228154, now seen corresponding path program 1 times [2025-01-09 14:16:02,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:16:02,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003408301] [2025-01-09 14:16:02,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:16:02,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:16:02,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 14:16:02,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 14:16:02,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:16:02,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:16:02,554 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 14:16:02,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:16:02,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003408301] [2025-01-09 14:16:02,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003408301] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:16:02,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102981106] [2025-01-09 14:16:02,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:16:02,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:16:02,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:16:02,558 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:16:02,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:16:02,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 14:16:02,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 14:16:02,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:16:02,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:16:02,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:16:02,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:16:02,626 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 14:16:02,626 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:16:02,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102981106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:16:02,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:16:02,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:16:02,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072967776] [2025-01-09 14:16:02,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:16:02,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:16:02,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:16:02,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:16:02,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:16:02,641 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 14:16:02,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:16:02,651 INFO L93 Difference]: Finished difference Result 54 states and 78 transitions. [2025-01-09 14:16:02,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:16:02,652 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2025-01-09 14:16:02,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:16:02,655 INFO L225 Difference]: With dead ends: 54 [2025-01-09 14:16:02,655 INFO L226 Difference]: Without dead ends: 27 [2025-01-09 14:16:02,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:16:02,658 INFO L435 NwaCegarLoop]: 34 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, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:16:02,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:16:02,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-09 14:16:02,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-01-09 14:16:02,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 14:16:02,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2025-01-09 14:16:02,679 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 40 [2025-01-09 14:16:02,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:16:02,679 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-01-09 14:16:02,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 14:16:02,679 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2025-01-09 14:16:02,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 14:16:02,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:16:02,680 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:16:02,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:16:02,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:16:02,881 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:16:02,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:16:02,882 INFO L85 PathProgramCache]: Analyzing trace with hash -442627324, now seen corresponding path program 1 times [2025-01-09 14:16:02,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:16:02,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097269111] [2025-01-09 14:16:02,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:16:02,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:16:02,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 14:16:02,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 14:16:02,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:16:02,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:16:02,954 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 14:16:02,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 14:16:02,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 14:16:02,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:16:02,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:16:03,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 14:16:03,003 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 14:16:03,004 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:16:03,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:16:03,007 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 14:16:03,024 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:16:03,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:16:03 BoogieIcfgContainer [2025-01-09 14:16:03,027 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:16:03,027 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:16:03,027 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:16:03,027 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:16:03,028 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:16:02" (3/4) ... [2025-01-09 14:16:03,029 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 14:16:03,030 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:16:03,031 INFO L158 Benchmark]: Toolchain (without parser) took 1049.02ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 62.5MB in the end (delta: 61.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-09 14:16:03,031 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:16:03,031 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.27ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 111.9MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:16:03,031 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.25ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 111.0MB in the end (delta: 964.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:16:03,031 INFO L158 Benchmark]: Boogie Preprocessor took 36.63ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 109.1MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:16:03,032 INFO L158 Benchmark]: RCFGBuilder took 172.82ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 97.6MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:16:03,032 INFO L158 Benchmark]: TraceAbstraction took 633.25ms. Allocated memory is still 167.8MB. Free memory was 97.0MB in the beginning and 62.5MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 14:16:03,032 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 167.8MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:16:03,033 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.39ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 175.27ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 111.9MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.25ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 111.0MB in the end (delta: 964.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.63ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 109.1MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 172.82ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 97.6MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 633.25ms. Allocated memory is still 167.8MB. Free memory was 97.0MB in the beginning and 62.5MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 167.8MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 49, overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 42, overapproximation of someBinaryDOUBLEComparisonOperation at line 31, overapproximation of someBinaryDOUBLEComparisonOperation at line 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 36, overapproximation of someBinaryDOUBLEComparisonOperation at line 54. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] double var_1_2 = 999999.2; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 100.52; [L26] double var_1_5 = 31.2; [L27] float var_1_6 = 5.8; VAL [isInitial=0, var_1_1=0, var_1_2=4999996/5, var_1_3=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L58] isInitial = 1 [L59] FCALL initially() [L61] FCALL updateLastVariables() [L62] CALL updateVariables() [L41] var_1_2 = __VERIFIER_nondet_double() [L42] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L42] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L43] var_1_3 = __VERIFIER_nondet_uchar() [L44] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L44] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L45] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L45] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L46] var_1_5 = __VERIFIER_nondet_double() [L47] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_6=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_6=29/5] [L47] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_6=29/5] [L48] var_1_6 = __VERIFIER_nondet_float() [L49] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25] [L49] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25] [L62] RET updateVariables() [L63] CALL step() [L31] COND FALSE !(var_1_2 <= var_1_5) VAL [isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25] [L36] COND TRUE 1.125 >= var_1_4 [L37] var_1_1 = (! (! var_1_3)) VAL [isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25] [L63] RET step() [L64] CALL, EXPR property() [L54-L55] return ((1.125 >= var_1_4) ? (var_1_1 == ((unsigned char) (! (! var_1_3)))) : 1) && ((var_1_2 <= var_1_5) ? ((! var_1_3) ? (var_1_4 == ((float) var_1_6)) : 1) : 1) ; VAL [\result=0, isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25] [L64] RET, EXPR property() [L64] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25] [L19] reach_error() VAL [isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 34 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 78 SizeOfPredicates, 0 NumberOfNonLiveVariables, 106 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 72/80 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 14:16:03,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-22.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 980b1737abc4897cffcf9ffd697bb8a6c2567cb964b43bf5603c43f896e3728c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:16:04,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:16:05,043 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 14:16:05,050 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:16:05,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:16:05,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:16:05,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:16:05,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:16:05,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:16:05,075 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:16:05,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:16:05,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:16:05,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:16:05,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:16:05,076 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:16:05,076 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:16:05,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:16:05,077 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:16:05,077 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:16:05,077 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:16:05,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:16:05,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:16:05,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:16:05,077 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 14:16:05,077 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 14:16:05,077 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 14:16:05,077 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:16:05,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:16:05,078 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:16:05,078 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:16:05,078 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:16:05,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:16:05,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:16:05,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:16:05,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:16:05,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:16:05,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:16:05,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:16:05,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:16:05,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:16:05,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:16:05,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:16:05,079 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:16:05,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:16:05,079 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 14:16:05,080 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 14:16:05,080 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:16:05,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:16:05,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:16:05,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:16:05,080 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 -> 980b1737abc4897cffcf9ffd697bb8a6c2567cb964b43bf5603c43f896e3728c [2025-01-09 14:16:05,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:16:05,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:16:05,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:16:05,362 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:16:05,362 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:16:05,364 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-22.i [2025-01-09 14:16:06,665 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92ce8c89c/cdb032f824db4ba781d1cb31d0a2fa20/FLAG33f239388 [2025-01-09 14:16:06,839 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:16:06,839 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-22.i [2025-01-09 14:16:06,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92ce8c89c/cdb032f824db4ba781d1cb31d0a2fa20/FLAG33f239388 [2025-01-09 14:16:06,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92ce8c89c/cdb032f824db4ba781d1cb31d0a2fa20 [2025-01-09 14:16:06,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:16:06,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:16:06,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:16:06,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:16:06,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:16:06,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:16:06" (1/1) ... [2025-01-09 14:16:06,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57796d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:06, skipping insertion in model container [2025-01-09 14:16:06,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:16:06" (1/1) ... [2025-01-09 14:16:06,876 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:16:06,977 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-22.i[915,928] [2025-01-09 14:16:07,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:16:07,015 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:16:07,024 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-22.i[915,928] [2025-01-09 14:16:07,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:16:07,047 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:16:07,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:07 WrapperNode [2025-01-09 14:16:07,048 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:16:07,049 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:16:07,049 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:16:07,050 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:16:07,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:07" (1/1) ... [2025-01-09 14:16:07,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:07" (1/1) ... [2025-01-09 14:16:07,079 INFO L138 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 59 [2025-01-09 14:16:07,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:16:07,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:16:07,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:16:07,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:16:07,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:07" (1/1) ... [2025-01-09 14:16:07,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:07" (1/1) ... [2025-01-09 14:16:07,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:07" (1/1) ... [2025-01-09 14:16:07,099 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:16:07,100 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:07" (1/1) ... [2025-01-09 14:16:07,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:07" (1/1) ... [2025-01-09 14:16:07,107 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:07" (1/1) ... [2025-01-09 14:16:07,109 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:07" (1/1) ... [2025-01-09 14:16:07,111 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:07" (1/1) ... [2025-01-09 14:16:07,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:07" (1/1) ... [2025-01-09 14:16:07,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:07" (1/1) ... [2025-01-09 14:16:07,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:16:07,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:16:07,118 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:16:07,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:16:07,119 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:07" (1/1) ... [2025-01-09 14:16:07,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:16:07,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:16:07,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:16:07,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:16:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:16:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 14:16:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:16:07,166 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:16:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:16:07,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:16:07,217 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:16:07,219 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:16:07,422 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 14:16:07,422 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:16:07,428 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:16:07,428 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:16:07,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:16:07 BoogieIcfgContainer [2025-01-09 14:16:07,430 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:16:07,431 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:16:07,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:16:07,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:16:07,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:16:06" (1/3) ... [2025-01-09 14:16:07,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cfcfff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:16:07, skipping insertion in model container [2025-01-09 14:16:07,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:16:07" (2/3) ... [2025-01-09 14:16:07,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cfcfff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:16:07, skipping insertion in model container [2025-01-09 14:16:07,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:16:07" (3/3) ... [2025-01-09 14:16:07,439 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-22.i [2025-01-09 14:16:07,449 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:16:07,451 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-22.i that has 2 procedures, 30 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:16:07,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:16:07,501 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;@e6ab810, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:16:07,502 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:16:07,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 14:16:07,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 14:16:07,509 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:16:07,510 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:16:07,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:16:07,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:16:07,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1098228154, now seen corresponding path program 1 times [2025-01-09 14:16:07,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:16:07,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336964674] [2025-01-09 14:16:07,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:16:07,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-01-09 14:16:07,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:16:07,523 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:16:07,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 (2)] Waiting until timeout for monitored process [2025-01-09 14:16:07,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 14:16:07,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 14:16:07,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:16:07,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:16:07,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:16:07,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:16:07,670 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 14:16:07,670 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:16:07,671 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:16:07,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336964674] [2025-01-09 14:16:07,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336964674] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:16:07,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:16:07,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:16:07,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657269253] [2025-01-09 14:16:07,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:16:07,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:16:07,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:16:07,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:16:07,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:16:07,688 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 14:16:07,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:16:07,699 INFO L93 Difference]: Finished difference Result 54 states and 78 transitions. [2025-01-09 14:16:07,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:16:07,700 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2025-01-09 14:16:07,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:16:07,704 INFO L225 Difference]: With dead ends: 54 [2025-01-09 14:16:07,704 INFO L226 Difference]: Without dead ends: 27 [2025-01-09 14:16:07,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:16:07,707 INFO L435 NwaCegarLoop]: 34 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, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:16:07,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:16:07,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-09 14:16:07,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-01-09 14:16:07,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 14:16:07,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2025-01-09 14:16:07,729 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 40 [2025-01-09 14:16:07,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:16:07,730 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-01-09 14:16:07,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 14:16:07,730 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2025-01-09 14:16:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 14:16:07,731 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:16:07,731 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:16:07,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 14:16:07,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:16:07,932 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:16:07,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:16:07,933 INFO L85 PathProgramCache]: Analyzing trace with hash -442627324, now seen corresponding path program 1 times [2025-01-09 14:16:07,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:16:07,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089683009] [2025-01-09 14:16:07,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:16:07,936 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:16:07,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:16:07,938 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:16:07,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 14:16:07,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 14:16:08,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 14:16:08,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:16:08,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:16:08,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 14:16:08,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:16:08,278 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 14:16:08,278 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:16:08,278 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:16:08,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089683009] [2025-01-09 14:16:08,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089683009] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:16:08,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:16:08,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:16:08,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491279306] [2025-01-09 14:16:08,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:16:08,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:16:08,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:16:08,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:16:08,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:16:08,280 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 14:16:08,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:16:08,455 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2025-01-09 14:16:08,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:16:08,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 40 [2025-01-09 14:16:08,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:16:08,457 INFO L225 Difference]: With dead ends: 75 [2025-01-09 14:16:08,457 INFO L226 Difference]: Without dead ends: 51 [2025-01-09 14:16:08,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:16:08,458 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:16:08,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 53 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:16:08,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-09 14:16:08,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2025-01-09 14:16:08,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 14:16:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2025-01-09 14:16:08,465 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 40 [2025-01-09 14:16:08,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:16:08,465 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2025-01-09 14:16:08,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 14:16:08,465 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2025-01-09 14:16:08,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 14:16:08,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:16:08,466 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:16:08,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-01-09 14:16:08,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:16:08,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:16:08,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:16:08,669 INFO L85 PathProgramCache]: Analyzing trace with hash -440780282, now seen corresponding path program 1 times [2025-01-09 14:16:08,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:16:08,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605661873] [2025-01-09 14:16:08,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:16:08,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:16:08,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:16:08,675 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:16:08,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 14:16:08,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 14:16:08,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 14:16:08,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:16:08,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:16:08,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 14:16:08,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:16:09,380 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 14:16:09,380 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:16:09,380 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:16:09,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [605661873] [2025-01-09 14:16:09,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [605661873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:16:09,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:16:09,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:16:09,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163861930] [2025-01-09 14:16:09,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:16:09,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:16:09,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:16:09,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:16:09,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:16:09,382 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 14:16:09,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:16:09,893 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2025-01-09 14:16:09,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:16:09,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 40 [2025-01-09 14:16:09,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:16:09,895 INFO L225 Difference]: With dead ends: 60 [2025-01-09 14:16:09,895 INFO L226 Difference]: Without dead ends: 58 [2025-01-09 14:16:09,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:16:09,895 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:16:09,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 121 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:16:09,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-09 14:16:09,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2025-01-09 14:16:09,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 14:16:09,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2025-01-09 14:16:09,901 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 40 [2025-01-09 14:16:09,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:16:09,901 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2025-01-09 14:16:09,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 14:16:09,902 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2025-01-09 14:16:09,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 14:16:09,902 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:16:09,902 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:16:09,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-01-09 14:16:10,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:16:10,103 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:16:10,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:16:10,104 INFO L85 PathProgramCache]: Analyzing trace with hash 391941064, now seen corresponding path program 1 times [2025-01-09 14:16:10,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:16:10,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1575255781] [2025-01-09 14:16:10,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:16:10,104 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:16:10,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:16:10,106 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:16:10,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 14:16:10,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 14:16:10,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 14:16:10,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:16:10,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:16:10,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 14:16:10,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:16:11,522 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 14:16:11,522 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:16:11,522 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:16:11,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1575255781] [2025-01-09 14:16:11,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1575255781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:16:11,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:16:11,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:16:11,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663935032] [2025-01-09 14:16:11,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:16:11,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:16:11,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:16:11,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:16:11,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:16:11,524 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 14:16:12,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:16:12,423 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2025-01-09 14:16:12,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 14:16:12,427 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2025-01-09 14:16:12,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:16:12,428 INFO L225 Difference]: With dead ends: 101 [2025-01-09 14:16:12,428 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 14:16:12,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:16:12,429 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 55 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:16:12,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 180 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:16:12,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 14:16:12,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 73. [2025-01-09 14:16:12,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 57 states have internal predecessors, (64), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 14:16:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2025-01-09 14:16:12,443 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 41 [2025-01-09 14:16:12,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:16:12,444 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2025-01-09 14:16:12,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 14:16:12,444 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2025-01-09 14:16:12,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 14:16:12,446 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:16:12,446 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:16:12,451 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-01-09 14:16:12,646 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-01-09 14:16:12,648 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:16:12,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:16:12,648 INFO L85 PathProgramCache]: Analyzing trace with hash 393788106, now seen corresponding path program 1 times [2025-01-09 14:16:12,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:16:12,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [927052303] [2025-01-09 14:16:12,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:16:12,649 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:16:12,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:16:12,651 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-01-09 14:16:12,654 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-01-09 14:16:12,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 14:16:12,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 14:16:12,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:16:12,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:16:12,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 14:16:12,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:16:13,916 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 14:16:13,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:16:19,587 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:16:19,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [927052303] [2025-01-09 14:16:19,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [927052303] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:16:19,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1273722662] [2025-01-09 14:16:19,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:16:19,587 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 14:16:19,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 14:16:19,590 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 14:16:19,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-01-09 14:16:19,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 14:16:20,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 14:16:20,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:16:20,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:16:20,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 14:16:20,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:16:24,554 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 14:16:24,556 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:16:24,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1273722662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:16:24,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:16:24,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 18 [2025-01-09 14:16:24,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101291571] [2025-01-09 14:16:24,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:16:24,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:16:24,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:16:24,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:16:24,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2025-01-09 14:16:24,558 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 14:16:29,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:16:29,577 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2025-01-09 14:16:29,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:16:29,580 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2025-01-09 14:16:29,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:16:29,581 INFO L225 Difference]: With dead ends: 97 [2025-01-09 14:16:29,581 INFO L226 Difference]: Without dead ends: 95 [2025-01-09 14:16:29,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2025-01-09 14:16:29,582 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 54 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:16:29,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 168 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 14:16:29,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-09 14:16:29,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 76. [2025-01-09 14:16:29,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 60 states have internal predecessors, (67), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 14:16:29,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2025-01-09 14:16:29,598 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 41 [2025-01-09 14:16:29,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:16:29,598 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2025-01-09 14:16:29,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 14:16:29,598 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2025-01-09 14:16:29,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 14:16:29,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:16:29,599 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:16:29,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2025-01-09 14:16:29,805 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-01-09 14:16:30,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-01-09 14:16:30,003 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:16:30,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:16:30,004 INFO L85 PathProgramCache]: Analyzing trace with hash 451046408, now seen corresponding path program 1 times [2025-01-09 14:16:30,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:16:30,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324509046] [2025-01-09 14:16:30,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:16:30,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:16:30,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:16:30,011 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:16:30,013 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 (8)] Waiting until timeout for monitored process [2025-01-09 14:16:30,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 14:16:30,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 14:16:30,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:16:30,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:16:30,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 14:16:30,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:16:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 14:16:30,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:16:30,225 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 14:16:30,225 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:16:30,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324509046] [2025-01-09 14:16:30,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324509046] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:16:30,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 14:16:30,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-01-09 14:16:30,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930781587] [2025-01-09 14:16:30,225 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 14:16:30,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:16:30,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:16:30,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:16:30,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:16:30,226 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 14:16:30,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:16:30,456 INFO L93 Difference]: Finished difference Result 157 states and 180 transitions. [2025-01-09 14:16:30,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:16:30,461 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 41 [2025-01-09 14:16:30,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:16:30,462 INFO L225 Difference]: With dead ends: 157 [2025-01-09 14:16:30,462 INFO L226 Difference]: Without dead ends: 84 [2025-01-09 14:16:30,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:16:30,463 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 44 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:16:30,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 59 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:16:30,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-09 14:16:30,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2025-01-09 14:16:30,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 61 states have internal predecessors, (65), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 14:16:30,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2025-01-09 14:16:30,478 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 41 [2025-01-09 14:16:30,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:16:30,478 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2025-01-09 14:16:30,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 14:16:30,478 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2025-01-09 14:16:30,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 14:16:30,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:16:30,482 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:16:30,488 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 (8)] Ended with exit code 0 [2025-01-09 14:16:30,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:16:30,684 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:16:30,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:16:30,684 INFO L85 PathProgramCache]: Analyzing trace with hash -329338820, now seen corresponding path program 1 times [2025-01-09 14:16:30,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:16:30,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553887504] [2025-01-09 14:16:30,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:16:30,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:16:30,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:16:30,690 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:16:30,691 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 (9)] Waiting until timeout for monitored process [2025-01-09 14:16:30,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 14:16:30,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 14:16:30,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:16:30,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:16:30,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 14:16:30,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:16:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-01-09 14:16:31,741 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:16:31,741 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:16:31,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553887504] [2025-01-09 14:16:31,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553887504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:16:31,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:16:31,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:16:31,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922934871] [2025-01-09 14:16:31,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:16:31,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:16:31,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:16:31,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:16:31,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:16:31,743 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 14:16:32,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:16:32,037 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2025-01-09 14:16:32,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:16:32,040 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 78 [2025-01-09 14:16:32,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:16:32,041 INFO L225 Difference]: With dead ends: 92 [2025-01-09 14:16:32,041 INFO L226 Difference]: Without dead ends: 90 [2025-01-09 14:16:32,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:16:32,042 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 18 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:16:32,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 124 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:16:32,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-09 14:16:32,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 79. [2025-01-09 14:16:32,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 61 states have internal predecessors, (65), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 14:16:32,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2025-01-09 14:16:32,047 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 78 [2025-01-09 14:16:32,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:16:32,048 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2025-01-09 14:16:32,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 14:16:32,048 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2025-01-09 14:16:32,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 14:16:32,049 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:16:32,049 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:16:32,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2025-01-09 14:16:32,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:16:32,253 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:16:32,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:16:32,254 INFO L85 PathProgramCache]: Analyzing trace with hash -327491778, now seen corresponding path program 1 times [2025-01-09 14:16:32,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:16:32,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117570317] [2025-01-09 14:16:32,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:16:32,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:16:32,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:16:32,256 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:16:32,258 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 (10)] Waiting until timeout for monitored process [2025-01-09 14:16:32,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 14:16:32,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 14:16:32,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:16:32,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:16:32,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 14:16:32,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:16:35,188 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-09 14:16:35,188 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:16:35,188 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:16:35,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117570317] [2025-01-09 14:16:35,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2117570317] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:16:35,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:16:35,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:16:35,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589050683] [2025-01-09 14:16:35,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:16:35,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:16:35,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:16:35,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:16:35,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:16:35,190 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 14:16:35,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:16:35,963 INFO L93 Difference]: Finished difference Result 156 states and 173 transitions. [2025-01-09 14:16:35,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:16:35,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 78 [2025-01-09 14:16:35,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:16:35,968 INFO L225 Difference]: With dead ends: 156 [2025-01-09 14:16:35,968 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 14:16:35,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:16:35,969 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:16:35,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 80 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:16:35,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 14:16:35,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2025-01-09 14:16:35,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.0740740740740742) internal successors, (87), 82 states have internal predecessors, (87), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 14:16:35,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2025-01-09 14:16:35,982 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 78 [2025-01-09 14:16:35,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:16:35,982 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2025-01-09 14:16:35,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 14:16:35,982 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2025-01-09 14:16:35,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 14:16:35,983 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:16:35,983 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:16:35,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2025-01-09 14:16:36,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:16:36,187 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:16:36,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:16:36,188 INFO L85 PathProgramCache]: Analyzing trace with hash -79345284, now seen corresponding path program 1 times [2025-01-09 14:16:36,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:16:36,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874322765] [2025-01-09 14:16:36,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:16:36,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:16:36,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:16:36,191 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:16:36,192 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 (11)] Waiting until timeout for monitored process [2025-01-09 14:16:36,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 14:16:36,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 14:16:36,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:16:36,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:16:36,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 14:16:36,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:16:39,985 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 114 proven. 2 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-09 14:16:39,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:16:41,789 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 14:16:41,789 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:16:41,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874322765] [2025-01-09 14:16:41,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874322765] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:16:41,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 14:16:41,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-01-09 14:16:41,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134195675] [2025-01-09 14:16:41,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 14:16:41,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:16:41,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:16:41,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:16:41,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:16:41,790 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 14:16:44,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:16:44,331 INFO L93 Difference]: Finished difference Result 186 states and 206 transitions. [2025-01-09 14:16:44,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:16:44,334 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 78 [2025-01-09 14:16:44,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:16:44,335 INFO L225 Difference]: With dead ends: 186 [2025-01-09 14:16:44,335 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 14:16:44,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:16:44,336 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:16:44,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 117 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 14:16:44,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 14:16:44,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 14:16:44,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-01-09 14:16:44,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 14:16:44,336 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2025-01-09 14:16:44,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:16:44,336 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 14:16:44,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 14:16:44,337 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 14:16:44,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 14:16:44,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:16:44,348 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 (11)] Ended with exit code 0 [2025-01-09 14:16:44,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:16:44,550 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:16:44,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 14:16:56,968 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:16:56,984 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 14:16:56,985 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 14:16:56,986 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 14:16:56,986 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 14:16:56,986 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-01-09 14:16:56,986 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-01-09 14:16:56,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:16:56 BoogieIcfgContainer [2025-01-09 14:16:56,987 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:16:56,988 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:16:56,988 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:16:56,988 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:16:56,988 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:16:07" (3/4) ... [2025-01-09 14:16:56,990 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 14:16:56,994 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-09 14:16:56,998 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-01-09 14:16:56,998 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 14:16:56,998 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 14:16:56,999 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 14:16:57,083 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 14:16:57,084 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 14:16:57,084 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:16:57,084 INFO L158 Benchmark]: Toolchain (without parser) took 50225.96ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 91.7MB in the beginning and 152.8MB in the end (delta: -61.1MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2025-01-09 14:16:57,085 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 83.9MB. Free memory was 62.1MB in the beginning and 62.1MB in the end (delta: 18.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:16:57,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.56ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 79.6MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:16:57,085 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.55ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 78.2MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:16:57,085 INFO L158 Benchmark]: Boogie Preprocessor took 36.89ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 76.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:16:57,085 INFO L158 Benchmark]: RCFGBuilder took 311.24ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 65.3MB in the end (delta: 11.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:16:57,086 INFO L158 Benchmark]: TraceAbstraction took 49555.81ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 64.6MB in the beginning and 158.7MB in the end (delta: -94.1MB). Peak memory consumption was 88.2MB. Max. memory is 16.1GB. [2025-01-09 14:16:57,087 INFO L158 Benchmark]: Witness Printer took 96.08ms. Allocated memory is still 192.9MB. Free memory was 158.7MB in the beginning and 152.8MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:16:57,088 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.21ms. Allocated memory is still 83.9MB. Free memory was 62.1MB in the beginning and 62.1MB in the end (delta: 18.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.56ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 79.6MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.55ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 78.2MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.89ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 76.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 311.24ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 65.3MB in the end (delta: 11.1MB). There was no memory consumed. Max. memory is 16.1GB. * TraceAbstraction took 49555.81ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 64.6MB in the beginning and 158.7MB in the end (delta: -94.1MB). Peak memory consumption was 88.2MB. Max. memory is 16.1GB. * Witness Printer took 96.08ms. Allocated memory is still 192.9MB. Free memory was 158.7MB in the beginning and 152.8MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.1s, OverallIterations: 9, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 221 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 207 mSDsluCounter, 936 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 639 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 574 IncrementalHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 297 mSDtfsCounter, 574 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 658 GetRequests, 582 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 12.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=8, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 69 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 22.9s InterpolantComputationTime, 518 NumberOfCodeBlocks, 518 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 625 ConstructedInterpolants, 0 QuantifiedInterpolants, 2954 SizeOfPredicates, 51 NumberOfNonLiveVariables, 876 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 1085/1104 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: (var_1_3 <= 0) RESULT: Ultimate proved your program to be correct! [2025-01-09 14:16:57,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE