./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/bary_diverge.c --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/float-benchs/bary_diverge.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:49:52,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:49:52,994 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:49:52,998 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:49:52,999 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:49:53,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:49:53,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:49:53,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:49:53,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:49:53,021 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:49:53,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:49:53,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:49:53,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:49:53,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:49:53,022 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:49:53,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:49:53,023 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:49:53,023 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:49:53,023 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:49:53,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:49:53,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:49:53,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:49:53,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:49:53,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:49:53,024 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:49:53,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:49:53,024 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:49:53,024 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:49:53,024 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:49:53,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:49:53,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:49:53,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:49:53,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:49:53,025 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:49:53,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:49:53,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:49:53,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:49:53,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:49:53,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:49:53,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:49:53,025 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:49:53,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:49:53,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:49:53,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:49:53,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:49:53,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:49:53,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:49:53,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:49:53,026 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 -> b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 [2025-01-09 00:49:53,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:49:53,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:49:53,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:49:53,244 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:49:53,244 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:49:53,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/bary_diverge.c [2025-01-09 00:49:54,418 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40f5415f4/d8d1db51586743998e3f1c5231f921ba/FLAGf031f4894 [2025-01-09 00:49:54,702 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:49:54,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/bary_diverge.c [2025-01-09 00:49:54,712 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40f5415f4/d8d1db51586743998e3f1c5231f921ba/FLAGf031f4894 [2025-01-09 00:49:54,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40f5415f4/d8d1db51586743998e3f1c5231f921ba [2025-01-09 00:49:55,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:49:55,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:49:55,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:49:55,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:49:55,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:49:55,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:49:54" (1/1) ... [2025-01-09 00:49:55,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f13e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:55, skipping insertion in model container [2025-01-09 00:49:55,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:49:54" (1/1) ... [2025-01-09 00:49:55,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:49:55,110 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/bary_diverge.c[632,645] [2025-01-09 00:49:55,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:49:55,127 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:49:55,133 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/bary_diverge.c[632,645] [2025-01-09 00:49:55,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:49:55,145 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:49:55,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:55 WrapperNode [2025-01-09 00:49:55,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:49:55,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:49:55,147 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:49:55,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:49:55,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:55" (1/1) ... [2025-01-09 00:49:55,155 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:55" (1/1) ... [2025-01-09 00:49:55,164 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 66 [2025-01-09 00:49:55,164 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:49:55,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:49:55,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:49:55,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:49:55,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:55" (1/1) ... [2025-01-09 00:49:55,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:55" (1/1) ... [2025-01-09 00:49:55,170 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:55" (1/1) ... [2025-01-09 00:49:55,176 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 00:49:55,177 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:55" (1/1) ... [2025-01-09 00:49:55,177 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:55" (1/1) ... [2025-01-09 00:49:55,179 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:55" (1/1) ... [2025-01-09 00:49:55,179 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:55" (1/1) ... [2025-01-09 00:49:55,181 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:55" (1/1) ... [2025-01-09 00:49:55,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:55" (1/1) ... [2025-01-09 00:49:55,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:55" (1/1) ... [2025-01-09 00:49:55,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:49:55,184 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:49:55,184 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:49:55,184 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:49:55,184 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:55" (1/1) ... [2025-01-09 00:49:55,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:49:55,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:49:55,204 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 00:49:55,206 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 00:49:55,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:49:55,223 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2025-01-09 00:49:55,223 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2025-01-09 00:49:55,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:49:55,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:49:55,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:49:55,284 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:49:55,285 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:49:55,390 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 00:49:55,390 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:49:55,396 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:49:55,397 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 00:49:55,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:49:55 BoogieIcfgContainer [2025-01-09 00:49:55,398 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:49:55,400 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:49:55,401 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:49:55,405 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:49:55,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:49:54" (1/3) ... [2025-01-09 00:49:55,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48edad0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:49:55, skipping insertion in model container [2025-01-09 00:49:55,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:55" (2/3) ... [2025-01-09 00:49:55,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48edad0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:49:55, skipping insertion in model container [2025-01-09 00:49:55,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:49:55" (3/3) ... [2025-01-09 00:49:55,407 INFO L128 eAbstractionObserver]: Analyzing ICFG bary_diverge.c [2025-01-09 00:49:55,418 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:49:55,420 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bary_diverge.c that has 2 procedures, 30 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:49:55,464 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:49:55,473 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;@5f339912, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:49:55,474 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:49:55,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 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 00:49:55,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 00:49:55,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:49:55,482 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:49:55,483 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:49:55,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:49:55,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1344259182, now seen corresponding path program 1 times [2025-01-09 00:49:55,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:49:55,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985495409] [2025-01-09 00:49:55,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:49:55,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:49:55,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 00:49:55,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 00:49:55,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:49:55,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:49:55,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 00:49:55,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:49:55,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985495409] [2025-01-09 00:49:55,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985495409] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:49:55,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504605393] [2025-01-09 00:49:55,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:49:55,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:49:55,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:49:55,594 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 00:49:55,599 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 00:49:55,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 00:49:55,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 00:49:55,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:49:55,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:49:55,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 00:49:55,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:49:55,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 00:49:55,672 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:49:55,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504605393] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:49:55,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:49:55,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 00:49:55,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088093977] [2025-01-09 00:49:55,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:49:55,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 00:49:55,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:49:55,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 00:49:55,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 00:49:55,692 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 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 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 00:49:55,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:49:55,705 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2025-01-09 00:49:55,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 00:49:55,708 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2025-01-09 00:49:55,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:49:55,712 INFO L225 Difference]: With dead ends: 57 [2025-01-09 00:49:55,712 INFO L226 Difference]: Without dead ends: 27 [2025-01-09 00:49:55,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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 00:49:55,716 INFO L435 NwaCegarLoop]: 36 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, 36 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 00:49:55,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 00:49:55,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-09 00:49:55,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-01-09 00:49:55,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 00:49:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2025-01-09 00:49:55,748 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 22 [2025-01-09 00:49:55,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:49:55,749 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2025-01-09 00:49:55,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 00:49:55,749 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2025-01-09 00:49:55,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 00:49:55,751 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:49:55,751 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:49:55,757 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 00:49:55,952 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 00:49:55,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:49:55,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:49:55,953 INFO L85 PathProgramCache]: Analyzing trace with hash 51179054, now seen corresponding path program 1 times [2025-01-09 00:49:55,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:49:55,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315124892] [2025-01-09 00:49:55,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:49:55,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:49:55,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 00:49:55,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 00:49:55,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:49:55,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 00:49:55,980 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 00:49:55,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 00:49:55,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 00:49:55,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:49:55,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 00:49:56,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 00:49:56,003 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 00:49:56,004 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:49:56,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:49:56,014 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 00:49:56,030 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:49:56,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:49:56 BoogieIcfgContainer [2025-01-09 00:49:56,032 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:49:56,033 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:49:56,033 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:49:56,033 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:49:56,033 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:49:55" (3/4) ... [2025-01-09 00:49:56,035 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 00:49:56,035 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:49:56,036 INFO L158 Benchmark]: Toolchain (without parser) took 1033.89ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 79.1MB in the end (delta: 54.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-09 00:49:56,036 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 234.9MB. Free memory is still 151.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:49:56,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 139.30ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 121.8MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 00:49:56,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.55ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 120.8MB in the end (delta: 979.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:49:56,037 INFO L158 Benchmark]: Boogie Preprocessor took 18.29ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 119.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:49:56,037 INFO L158 Benchmark]: RCFGBuilder took 214.83ms. Allocated memory is still 167.8MB. Free memory was 119.5MB in the beginning and 107.4MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 00:49:56,037 INFO L158 Benchmark]: TraceAbstraction took 631.87ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 79.6MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 00:49:56,037 INFO L158 Benchmark]: Witness Printer took 2.57ms. Allocated memory is still 167.8MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:49:56,038 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 234.9MB. Free memory is still 151.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 139.30ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 121.8MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.55ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 120.8MB in the end (delta: 979.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.29ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 119.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 214.83ms. Allocated memory is still 167.8MB. Free memory was 119.5MB in the beginning and 107.4MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 631.87ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 79.6MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 2.57ms. Allocated memory is still 167.8MB. Free memory is still 79.1MB. 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: 14]: 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 50, overapproximation of someBinaryFLOATComparisonOperation at line 36, overapproximation of someBinaryFLOATComparisonOperation at line 26. Possible FailurePath: [L19] BOOLEAN INIT; [L20] float C1, I; [L34] static float X,Y,Z; VAL [C1=0, I=0, INIT=0, X=0, Y=0, Z=0] [L55] int i; [L57] INIT = TRUE VAL [C1=0, I=0, INIT=1, X=0, Y=0, Z=0] [L58] CALL, EXPR RANDOM_INPUT() VAL [C1=0, I=0, INIT=1, X=0, Y=0, Z=0] [L24] float x; [L25] x = __VERIFIER_nondet_float() [L26] CALL assume_abort_if_not(x >= -1.f && x <= 1.f) [L12] COND FALSE !(!cond) VAL [C1=0, I=0, INIT=1, X=0, Y=0, Z=0] [L26] RET assume_abort_if_not(x >= -1.f && x <= 1.f) [L27] return x; VAL [C1=0, I=0, INIT=1, X=0, Y=0, Z=0, \result=54] [L58] RET, EXPR RANDOM_INPUT() VAL [C1=0, I=0, INIT=1, X=0, Y=0, Z=0] [L58] C1 = RANDOM_INPUT() [L59] CALL, EXPR RANDOM_INPUT() VAL [C1=54, I=0, INIT=1, X=0, Y=0, Z=0] [L24] float x; [L25] x = __VERIFIER_nondet_float() [L26] CALL assume_abort_if_not(x >= -1.f && x <= 1.f) [L12] COND FALSE !(!cond) VAL [C1=54, I=0, INIT=1, X=0, Y=0, Z=0] [L26] RET assume_abort_if_not(x >= -1.f && x <= 1.f) [L27] return x; VAL [C1=54, I=0, INIT=1, X=0, Y=0, Z=0, \result=53] [L59] RET, EXPR RANDOM_INPUT() VAL [C1=54, I=0, INIT=1, X=0, Y=0, Z=0] [L59] I = RANDOM_INPUT() [L61] i = 0 VAL [C1=54, I=53, INIT=1, X=0, Y=0, Z=0, i=0] [L61] COND TRUE i < 3600000 [L62] CALL bary() [L36] COND TRUE C1 > 0.f [L37] Z = Y [L38] Y = X VAL [C1=54, I=53, INIT=1, X=0, Y=0, Z=0] [L41] COND TRUE INIT == TRUE [L42] X = I [L43] Y = I [L44] Z = I VAL [C1=54, I=53, INIT=1, X=53, Y=53, Z=53] [L50] CALL __VERIFIER_assert(X >= -5.f && X <= 5.f) [L14] COND TRUE !(cond) VAL [C1=54, I=53, INIT=1, X=53, Y=53, Z=53] [L14] reach_error() VAL [C1=54, I=53, INIT=1, X=53, Y=53, Z=53] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 2, 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, 36 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, 36 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 23 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 42 SizeOfPredicates, 0 NumberOfNonLiveVariables, 88 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 7/10 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 00:49:56,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/bary_diverge.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:49:58,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:49:58,200 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 00:49:58,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:49:58,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:49:58,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:49:58,233 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:49:58,233 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:49:58,233 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:49:58,233 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:49:58,234 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:49:58,234 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:49:58,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:49:58,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:49:58,235 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:49:58,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:49:58,235 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:49:58,235 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:49:58,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:49:58,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:49:58,236 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:49:58,236 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:49:58,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:49:58,236 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 00:49:58,236 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 00:49:58,236 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 00:49:58,236 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:49:58,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:49:58,236 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:49:58,236 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:49:58,236 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:49:58,236 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:49:58,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:49:58,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:49:58,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:49:58,237 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:49:58,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:49:58,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:49:58,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:49:58,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:49:58,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:49:58,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:49:58,238 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:49:58,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:49:58,238 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 00:49:58,238 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 00:49:58,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:49:58,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:49:58,238 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:49:58,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:49:58,239 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 -> b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 [2025-01-09 00:49:58,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:49:58,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:49:58,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:49:58,481 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:49:58,481 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:49:58,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/bary_diverge.c [2025-01-09 00:49:59,674 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e409a2fe/a1268dd6b7244351930a1d3f4ec54d41/FLAG99dd07b83 [2025-01-09 00:49:59,867 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:49:59,868 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/bary_diverge.c [2025-01-09 00:49:59,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e409a2fe/a1268dd6b7244351930a1d3f4ec54d41/FLAG99dd07b83 [2025-01-09 00:50:00,252 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e409a2fe/a1268dd6b7244351930a1d3f4ec54d41 [2025-01-09 00:50:00,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:50:00,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:50:00,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:50:00,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:50:00,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:50:00,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:50:00" (1/1) ... [2025-01-09 00:50:00,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3065cc44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:00, skipping insertion in model container [2025-01-09 00:50:00,262 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:50:00" (1/1) ... [2025-01-09 00:50:00,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:50:00,372 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/bary_diverge.c[632,645] [2025-01-09 00:50:00,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:50:00,399 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:50:00,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/bary_diverge.c[632,645] [2025-01-09 00:50:00,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:50:00,427 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:50:00,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:00 WrapperNode [2025-01-09 00:50:00,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:50:00,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:50:00,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:50:00,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:50:00,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:00" (1/1) ... [2025-01-09 00:50:00,439 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:00" (1/1) ... [2025-01-09 00:50:00,449 INFO L138 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 67 [2025-01-09 00:50:00,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:50:00,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:50:00,451 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:50:00,451 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:50:00,456 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:00" (1/1) ... [2025-01-09 00:50:00,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:00" (1/1) ... [2025-01-09 00:50:00,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:00" (1/1) ... [2025-01-09 00:50:00,469 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 00:50:00,472 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:00" (1/1) ... [2025-01-09 00:50:00,472 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:00" (1/1) ... [2025-01-09 00:50:00,476 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:00" (1/1) ... [2025-01-09 00:50:00,480 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:00" (1/1) ... [2025-01-09 00:50:00,482 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:00" (1/1) ... [2025-01-09 00:50:00,483 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:00" (1/1) ... [2025-01-09 00:50:00,483 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:00" (1/1) ... [2025-01-09 00:50:00,486 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:50:00,487 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:50:00,487 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:50:00,487 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:50:00,488 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:00" (1/1) ... [2025-01-09 00:50:00,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:50:00,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:50:00,511 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 00:50:00,512 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 00:50:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:50:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2025-01-09 00:50:00,529 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2025-01-09 00:50:00,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 00:50:00,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:50:00,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:50:00,585 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:50:00,587 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:50:04,756 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-01-09 00:50:04,756 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:50:04,761 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:50:04,762 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 00:50:04,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:50:04 BoogieIcfgContainer [2025-01-09 00:50:04,762 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:50:04,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:50:04,764 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:50:04,767 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:50:04,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:50:00" (1/3) ... [2025-01-09 00:50:04,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3c8a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:50:04, skipping insertion in model container [2025-01-09 00:50:04,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:00" (2/3) ... [2025-01-09 00:50:04,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3c8a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:50:04, skipping insertion in model container [2025-01-09 00:50:04,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:50:04" (3/3) ... [2025-01-09 00:50:04,768 INFO L128 eAbstractionObserver]: Analyzing ICFG bary_diverge.c [2025-01-09 00:50:04,777 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:50:04,778 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bary_diverge.c that has 2 procedures, 30 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:50:04,807 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:50:04,818 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;@7ea47f92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:50:04,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:50:04,820 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 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 00:50:04,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 00:50:04,831 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:50:04,832 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:50:04,832 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:50:04,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:50:04,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1344259182, now seen corresponding path program 1 times [2025-01-09 00:50:04,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 00:50:04,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739303747] [2025-01-09 00:50:04,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:50:04,854 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 00:50:04,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 00:50:04,857 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 00:50:04,858 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 00:50:04,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 00:50:04,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 00:50:04,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:50:04,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:50:04,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 00:50:04,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:50:04,945 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 00:50:04,945 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:50:04,946 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 00:50:04,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739303747] [2025-01-09 00:50:04,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739303747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:50:04,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:50:04,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:50:04,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140006956] [2025-01-09 00:50:04,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:50:04,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 00:50:04,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 00:50:04,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 00:50:04,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 00:50:04,967 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 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 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 00:50:04,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:50:04,977 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2025-01-09 00:50:04,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 00:50:04,978 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2025-01-09 00:50:04,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:50:04,981 INFO L225 Difference]: With dead ends: 57 [2025-01-09 00:50:04,981 INFO L226 Difference]: Without dead ends: 27 [2025-01-09 00:50:04,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 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 00:50:04,985 INFO L435 NwaCegarLoop]: 36 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, 36 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 00:50:04,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 00:50:04,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-09 00:50:05,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-01-09 00:50:05,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 00:50:05,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2025-01-09 00:50:05,008 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 22 [2025-01-09 00:50:05,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:50:05,009 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2025-01-09 00:50:05,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 00:50:05,009 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2025-01-09 00:50:05,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 00:50:05,010 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:50:05,010 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:50:05,013 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 00:50:05,210 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 00:50:05,211 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:50:05,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:50:05,212 INFO L85 PathProgramCache]: Analyzing trace with hash 51179054, now seen corresponding path program 1 times [2025-01-09 00:50:05,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 00:50:05,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758490103] [2025-01-09 00:50:05,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:50:05,212 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 00:50:05,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 00:50:05,218 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 00:50:05,220 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 00:50:05,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 00:50:05,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 00:50:05,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:50:05,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:50:05,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 00:50:05,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:50:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 00:50:05,588 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:50:05,588 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 00:50:05,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758490103] [2025-01-09 00:50:05,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758490103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:50:05,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:50:05,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 00:50:05,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894068158] [2025-01-09 00:50:05,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:50:05,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 00:50:05,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 00:50:05,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 00:50:05,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:50:05,590 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 00:50:09,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:50:13,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:50:17,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:50:22,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:50:26,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:50:27,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:50:31,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:50:33,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:50:37,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:50:41,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:50:43,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:50:43,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:50:43,183 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2025-01-09 00:50:43,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 00:50:43,183 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-01-09 00:50:43,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:50:43,184 INFO L225 Difference]: With dead ends: 68 [2025-01-09 00:50:43,185 INFO L226 Difference]: Without dead ends: 66 [2025-01-09 00:50:43,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-01-09 00:50:43,186 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 49 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 17 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:50:43,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 160 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 145 Invalid, 8 Unknown, 0 Unchecked, 37.2s Time] [2025-01-09 00:50:43,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-09 00:50:43,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 44. [2025-01-09 00:50:43,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 00:50:43,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2025-01-09 00:50:43,192 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 22 [2025-01-09 00:50:43,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:50:43,192 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2025-01-09 00:50:43,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 00:50:43,193 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2025-01-09 00:50:43,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 00:50:43,193 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:50:43,193 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:50:43,196 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 00:50:43,396 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 00:50:43,396 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:50:43,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:50:43,397 INFO L85 PathProgramCache]: Analyzing trace with hash 51238636, now seen corresponding path program 1 times [2025-01-09 00:50:43,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 00:50:43,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762443507] [2025-01-09 00:50:43,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:50:43,397 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 00:50:43,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 00:50:43,399 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 00:50:43,401 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 00:50:43,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 00:50:43,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 00:50:43,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:50:43,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:50:43,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:50:43,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:50:43,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 00:50:43,610 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:50:43,610 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 00:50:43,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [762443507] [2025-01-09 00:50:43,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [762443507] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:50:43,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:50:43,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:50:43,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361886843] [2025-01-09 00:50:43,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:50:43,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:50:43,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 00:50:43,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:50:43,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:50:43,611 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 00:50:46,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:50:46,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:50:46,593 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2025-01-09 00:50:46,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:50:46,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-01-09 00:50:46,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:50:46,618 INFO L225 Difference]: With dead ends: 83 [2025-01-09 00:50:46,619 INFO L226 Difference]: Without dead ends: 62 [2025-01-09 00:50:46,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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 00:50:46,619 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:50:46,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-09 00:50:46,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-09 00:50:46,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2025-01-09 00:50:46,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 47 states have internal predecessors, (50), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 00:50:46,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2025-01-09 00:50:46,653 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 22 [2025-01-09 00:50:46,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:50:46,653 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2025-01-09 00:50:46,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 00:50:46,654 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2025-01-09 00:50:46,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 00:50:46,654 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:50:46,655 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 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 00:50:46,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 00:50:46,855 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 00:50:46,856 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:50:46,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:50:46,857 INFO L85 PathProgramCache]: Analyzing trace with hash -533615706, now seen corresponding path program 1 times [2025-01-09 00:50:46,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 00:50:46,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906844622] [2025-01-09 00:50:46,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:50:46,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 00:50:46,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 00:50:46,862 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 00:50:46,862 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 00:50:46,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 00:50:46,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 00:50:46,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:50:46,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:50:46,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 00:50:46,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:50:47,221 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 00:50:47,221 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:50:47,222 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 00:50:47,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906844622] [2025-01-09 00:50:47,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906844622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:50:47,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:50:47,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 00:50:47,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655831449] [2025-01-09 00:50:47,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:50:47,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 00:50:47,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 00:50:47,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 00:50:47,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:50:47,223 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 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 00:50:51,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:50:53,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:50:56,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:51:01,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:51:04,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:51:04,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:51:04,770 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2025-01-09 00:51:04,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 00:51:04,771 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 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 51 [2025-01-09 00:51:04,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:51:04,772 INFO L225 Difference]: With dead ends: 81 [2025-01-09 00:51:04,772 INFO L226 Difference]: Without dead ends: 79 [2025-01-09 00:51:04,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2025-01-09 00:51:04,773 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 48 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 22 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:51:04,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 222 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 170 Invalid, 2 Unknown, 0 Unchecked, 17.1s Time] [2025-01-09 00:51:04,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-09 00:51:04,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 54. [2025-01-09 00:51:04,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 00:51:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2025-01-09 00:51:04,780 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 51 [2025-01-09 00:51:04,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:51:04,781 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2025-01-09 00:51:04,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 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 00:51:04,781 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2025-01-09 00:51:04,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 00:51:04,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:51:04,782 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 1, 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 00:51:04,785 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 (5)] Forceful destruction successful, exit code 0 [2025-01-09 00:51:04,982 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 00:51:04,983 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:51:04,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:51:04,983 INFO L85 PathProgramCache]: Analyzing trace with hash -533556124, now seen corresponding path program 1 times [2025-01-09 00:51:04,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 00:51:04,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [219702468] [2025-01-09 00:51:04,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:51:04,984 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 00:51:04,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 00:51:04,985 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 00:51:04,986 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 00:51:05,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 00:51:05,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 00:51:05,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:51:05,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:51:05,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 00:51:05,306 INFO L279 TraceCheckSpWp]: Computing forward predicates...