./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 b4d60c093ba6c9dcaff9815fcaab264eab148dbcfff5c12da0f56175eb222a22 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:38:18,128 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:38:18,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 11:38:18,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:38:18,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:38:18,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:38:18,202 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:38:18,202 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:38:18,202 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:38:18,202 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:38:18,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:38:18,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:38:18,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:38:18,203 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:38:18,203 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:38:18,203 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:38:18,203 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:38:18,203 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:38:18,203 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 11:38:18,203 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:38:18,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:38:18,203 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:38:18,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:38:18,204 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:38:18,204 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:38:18,204 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:38:18,204 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:38:18,204 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:38:18,204 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:38:18,204 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:38:18,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:38:18,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:38:18,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:38:18,204 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:38:18,205 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:38:18,205 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:38:18,205 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:38:18,205 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 11:38:18,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 11:38:18,205 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:38:18,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:38:18,205 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:38:18,205 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:38:18,205 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/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 -> b4d60c093ba6c9dcaff9815fcaab264eab148dbcfff5c12da0f56175eb222a22 [2025-03-03 11:38:18,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:38:18,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:38:18,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:38:18,421 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:38:18,422 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:38:18,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c [2025-03-03 11:38:19,510 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f43a92641/0b08f802eb1d4317aeb362ebe391bdb4/FLAGb8b4ebc43 [2025-03-03 11:38:19,709 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:38:19,710 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c [2025-03-03 11:38:19,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f43a92641/0b08f802eb1d4317aeb362ebe391bdb4/FLAGb8b4ebc43 [2025-03-03 11:38:20,088 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f43a92641/0b08f802eb1d4317aeb362ebe391bdb4 [2025-03-03 11:38:20,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:38:20,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:38:20,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:38:20,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:38:20,096 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:38:20,097 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:38:20" (1/1) ... [2025-03-03 11:38:20,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f9fcaa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:20, skipping insertion in model container [2025-03-03 11:38:20,098 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:38:20" (1/1) ... [2025-03-03 11:38:20,113 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:38:20,229 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c[1494,1507] [2025-03-03 11:38:20,234 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c[2698,2711] [2025-03-03 11:38:20,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:38:20,251 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:38:20,265 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c[1494,1507] [2025-03-03 11:38:20,268 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c[2698,2711] [2025-03-03 11:38:20,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:38:20,283 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:38:20,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:20 WrapperNode [2025-03-03 11:38:20,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:38:20,285 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:38:20,285 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:38:20,286 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:38:20,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:20" (1/1) ... [2025-03-03 11:38:20,296 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:20" (1/1) ... [2025-03-03 11:38:20,311 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 161 [2025-03-03 11:38:20,312 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:38:20,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:38:20,313 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:38:20,313 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:38:20,319 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:20" (1/1) ... [2025-03-03 11:38:20,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:20" (1/1) ... [2025-03-03 11:38:20,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:20" (1/1) ... [2025-03-03 11:38:20,336 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-03-03 11:38:20,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:20" (1/1) ... [2025-03-03 11:38:20,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:20" (1/1) ... [2025-03-03 11:38:20,342 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:20" (1/1) ... [2025-03-03 11:38:20,343 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:20" (1/1) ... [2025-03-03 11:38:20,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:20" (1/1) ... [2025-03-03 11:38:20,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:20" (1/1) ... [2025-03-03 11:38:20,349 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:38:20,350 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:38:20,350 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:38:20,350 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:38:20,351 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:20" (1/1) ... [2025-03-03 11:38:20,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:38:20,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:38:20,377 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 11:38:20,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 11:38:20,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:38:20,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 11:38:20,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:38:20,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:38:20,446 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:38:20,447 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:38:20,588 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L116: havoc main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1;havoc main_~main____CPAchecker_TMP_2~1#1;havoc main_~main____CPAchecker_TMP_1~1#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_2~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2025-03-03 11:38:20,595 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-03 11:38:20,595 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:38:20,602 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:38:20,602 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:38:20,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:38:20 BoogieIcfgContainer [2025-03-03 11:38:20,602 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:38:20,605 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:38:20,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:38:20,608 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:38:20,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:38:20" (1/3) ... [2025-03-03 11:38:20,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e44e524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:38:20, skipping insertion in model container [2025-03-03 11:38:20,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:20" (2/3) ... [2025-03-03 11:38:20,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e44e524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:38:20, skipping insertion in model container [2025-03-03 11:38:20,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:38:20" (3/3) ... [2025-03-03 11:38:20,610 INFO L128 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c.v+lhb-reducer.c [2025-03-03 11:38:20,621 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:38:20,622 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rlim_invariant.c.v+lhb-reducer.c that has 1 procedures, 42 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-03 11:38:20,656 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:38:20,665 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;@603aa54e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:38:20,666 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 11:38:20,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:38:20,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 11:38:20,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:38:20,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:38:20,673 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:38:20,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:38:20,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1163298710, now seen corresponding path program 1 times [2025-03-03 11:38:20,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:38:20,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357407786] [2025-03-03 11:38:20,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:38:20,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:38:20,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 11:38:20,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 11:38:20,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:38:20,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:38:20,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:38:20,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:38:20,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357407786] [2025-03-03 11:38:20,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357407786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:38:20,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:38:20,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 11:38:20,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792309626] [2025-03-03 11:38:20,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:38:20,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 11:38:20,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:38:20,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 11:38:20,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:38:20,877 INFO L87 Difference]: Start difference. First operand has 42 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:38:20,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:38:20,945 INFO L93 Difference]: Finished difference Result 50 states and 73 transitions. [2025-03-03 11:38:20,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 11:38:20,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-03 11:38:20,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:38:20,952 INFO L225 Difference]: With dead ends: 50 [2025-03-03 11:38:20,952 INFO L226 Difference]: Without dead ends: 41 [2025-03-03 11:38:20,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:38:20,957 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 22 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:38:20,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 207 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:38:20,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-03 11:38:20,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-03 11:38:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:38:20,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2025-03-03 11:38:20,983 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 16 [2025-03-03 11:38:20,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:38:20,984 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2025-03-03 11:38:20,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:38:20,984 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2025-03-03 11:38:20,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 11:38:20,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:38:20,985 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:38:20,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 11:38:20,986 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:38:20,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:38:20,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1164281813, now seen corresponding path program 1 times [2025-03-03 11:38:20,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:38:20,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234632057] [2025-03-03 11:38:20,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:38:20,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:38:20,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 11:38:20,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 11:38:20,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:38:20,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 11:38:20,999 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 11:38:21,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 11:38:21,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 11:38:21,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:38:21,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 11:38:21,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 11:38:21,021 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 11:38:21,022 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-03-03 11:38:21,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-03 11:38:21,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 11:38:21,025 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-03 11:38:21,048 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 11:38:21,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:38:21 BoogieIcfgContainer [2025-03-03 11:38:21,051 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 11:38:21,052 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 11:38:21,052 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 11:38:21,052 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 11:38:21,052 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:38:20" (3/4) ... [2025-03-03 11:38:21,054 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 11:38:21,054 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 11:38:21,055 INFO L158 Benchmark]: Toolchain (without parser) took 963.29ms. Allocated memory is still 167.8MB. Free memory was 124.5MB in the beginning and 66.8MB in the end (delta: 57.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-03 11:38:21,055 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:38:21,056 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.18ms. Allocated memory is still 167.8MB. Free memory was 124.5MB in the beginning and 112.4MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 11:38:21,056 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.76ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 111.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:38:21,057 INFO L158 Benchmark]: Boogie Preprocessor took 36.85ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 109.5MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 11:38:21,057 INFO L158 Benchmark]: IcfgBuilder took 252.63ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 94.9MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 11:38:21,057 INFO L158 Benchmark]: TraceAbstraction took 446.63ms. Allocated memory is still 167.8MB. Free memory was 94.3MB in the beginning and 67.6MB in the end (delta: 26.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 11:38:21,057 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 167.8MB. Free memory was 67.6MB in the beginning and 66.8MB in the end (delta: 779.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:38:21,058 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.14ms. Allocated memory is still 201.3MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.18ms. Allocated memory is still 167.8MB. Free memory was 124.5MB in the beginning and 112.4MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.76ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 111.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.85ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 109.5MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 252.63ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 94.9MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 446.63ms. Allocated memory is still 167.8MB. Free memory was 94.3MB in the beginning and 67.6MB in the end (delta: 26.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 167.8MB. Free memory was 67.6MB in the beginning and 66.8MB in the end (delta: 779.4kB). 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: 67]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 49, overapproximation of someBinaryDOUBLEComparisonOperation at line 31, overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 39, overapproximation of someBinaryDOUBLEComparisonOperation at line 41, overapproximation of to_real at line 24, overapproximation of someBinaryArithmeticFLOAToperation at line 48, overapproximation of someBinaryArithmeticFLOAToperation at line 51. Possible FailurePath: [L1] int __return_main; [L12] int __tmp_160_0; [L13] int __tmp_160_1; [L14] int __tmp_160_2; [L15] int __return_165; VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0] [L18] float main__X; [L19] float main__Y; [L20] float main__S; [L21] float main__R; [L22] float main__D; [L23] int main__i; [L24] main__Y = 0 [L25] main__i = 0 VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main__i=0] [L26] COND TRUE main__i < 100000 [L28] main__X = __VERIFIER_nondet_float() [L29] main__D = __VERIFIER_nondet_float() [L30] int main____CPAchecker_TMP_0; VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main__i=0] [L31] COND TRUE main__X >= -128.0 VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main__i=0] [L33] COND TRUE main__X <= 128.0 [L35] main____CPAchecker_TMP_0 = 1 VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main__i=0] [L36] COND TRUE main____CPAchecker_TMP_0 != 0 [L38] int main____CPAchecker_TMP_1; VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main__i=0] [L39] COND TRUE main__D >= 0.0 VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main__i=0] [L41] COND TRUE main__D <= 16.0 [L43] main____CPAchecker_TMP_1 = 1 VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__i=0] [L44] COND TRUE main____CPAchecker_TMP_1 != 0 [L46] main__S = main__Y [L47] main__Y = main__X [L48] main__R = main__X - main__S VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main__Y=54, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__i=0] [L49] COND TRUE main__R <= (-main__D) [L51] main__Y = main__S - main__D VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__i=0] [L53] int main____CPAchecker_TMP_2; VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__i=0] [L54] COND FALSE !(main__Y >= -129.0) VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__i=0] [L205] main____CPAchecker_TMP_2 = 0 VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__i=0] [L61] int __tmp_1; [L62] __tmp_1 = main____CPAchecker_TMP_2 [L63] int __VERIFIER_assert__cond; [L64] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__i=0] [L65] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__i=0] [L67] reach_error() VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__i=0] - UnprovableResult [Line: 123]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 207 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 147 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23 IncrementalHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 60 mSDtfsCounter, 23 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 23 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 11:38:21,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 b4d60c093ba6c9dcaff9815fcaab264eab148dbcfff5c12da0f56175eb222a22 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:38:22,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:38:22,888 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 11:38:22,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:38:22,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:38:22,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:38:22,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:38:22,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:38:22,909 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:38:22,909 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:38:22,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:38:22,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:38:22,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:38:22,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:38:22,910 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:38:22,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:38:22,910 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:38:22,910 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:38:22,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:38:22,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:38:22,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:38:22,910 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:38:22,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:38:22,911 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 11:38:22,911 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 11:38:22,911 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 11:38:22,911 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:38:22,911 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:38:22,911 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:38:22,911 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:38:22,911 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:38:22,911 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:38:22,911 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:38:22,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:38:22,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:38:22,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:38:22,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:38:22,911 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:38:22,911 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:38:22,911 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 11:38:22,912 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 11:38:22,912 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:38:22,912 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:38:22,912 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:38:22,912 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:38:22,912 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/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 -> b4d60c093ba6c9dcaff9815fcaab264eab148dbcfff5c12da0f56175eb222a22 [2025-03-03 11:38:23,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:38:23,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:38:23,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:38:23,144 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:38:23,144 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:38:23,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c [2025-03-03 11:38:24,301 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce9bf48d0/e872b1ae776444bea7f4f23d63068989/FLAG031f0cfb4 [2025-03-03 11:38:24,489 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:38:24,490 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c [2025-03-03 11:38:24,497 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce9bf48d0/e872b1ae776444bea7f4f23d63068989/FLAG031f0cfb4 [2025-03-03 11:38:24,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce9bf48d0/e872b1ae776444bea7f4f23d63068989 [2025-03-03 11:38:24,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:38:24,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:38:24,516 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:38:24,516 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:38:24,520 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:38:24,520 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:38:24" (1/1) ... [2025-03-03 11:38:24,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5017c59d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:24, skipping insertion in model container [2025-03-03 11:38:24,522 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:38:24" (1/1) ... [2025-03-03 11:38:24,539 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:38:24,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c[1494,1507] [2025-03-03 11:38:24,641 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c[2698,2711] [2025-03-03 11:38:24,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:38:24,655 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:38:24,665 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c[1494,1507] [2025-03-03 11:38:24,668 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c[2698,2711] [2025-03-03 11:38:24,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:38:24,680 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:38:24,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:24 WrapperNode [2025-03-03 11:38:24,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:38:24,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:38:24,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:38:24,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:38:24,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:24" (1/1) ... [2025-03-03 11:38:24,690 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:24" (1/1) ... [2025-03-03 11:38:24,706 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 162 [2025-03-03 11:38:24,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:38:24,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:38:24,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:38:24,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:38:24,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:24" (1/1) ... [2025-03-03 11:38:24,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:24" (1/1) ... [2025-03-03 11:38:24,714 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:24" (1/1) ... [2025-03-03 11:38:24,721 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-03-03 11:38:24,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:24" (1/1) ... [2025-03-03 11:38:24,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:24" (1/1) ... [2025-03-03 11:38:24,725 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:24" (1/1) ... [2025-03-03 11:38:24,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:24" (1/1) ... [2025-03-03 11:38:24,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:24" (1/1) ... [2025-03-03 11:38:24,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:24" (1/1) ... [2025-03-03 11:38:24,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:38:24,731 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:38:24,731 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:38:24,731 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:38:24,732 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:24" (1/1) ... [2025-03-03 11:38:24,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:38:24,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:38:24,758 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 11:38:24,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 11:38:24,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:38:24,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 11:38:24,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:38:24,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:38:24,835 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:38:24,837 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:38:26,026 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L116: havoc main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1;havoc main_~main____CPAchecker_TMP_2~1#1;havoc main_~main____CPAchecker_TMP_1~1#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_2~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2025-03-03 11:38:26,035 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-03-03 11:38:26,035 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:38:26,044 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:38:26,044 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:38:26,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:38:26 BoogieIcfgContainer [2025-03-03 11:38:26,044 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:38:26,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:38:26,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:38:26,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:38:26,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:38:24" (1/3) ... [2025-03-03 11:38:26,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c287e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:38:26, skipping insertion in model container [2025-03-03 11:38:26,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:24" (2/3) ... [2025-03-03 11:38:26,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c287e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:38:26, skipping insertion in model container [2025-03-03 11:38:26,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:38:26" (3/3) ... [2025-03-03 11:38:26,053 INFO L128 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c.v+lhb-reducer.c [2025-03-03 11:38:26,063 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:38:26,064 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rlim_invariant.c.v+lhb-reducer.c that has 1 procedures, 42 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-03 11:38:26,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:38:26,107 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;@6fd8ecb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:38:26,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 11:38:26,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:38:26,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 11:38:26,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:38:26,114 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:38:26,114 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:38:26,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:38:26,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1163298710, now seen corresponding path program 1 times [2025-03-03 11:38:26,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:38:26,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081131593] [2025-03-03 11:38:26,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:38:26,126 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-03-03 11:38:26,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:38:26,130 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-03 11:38:26,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 11:38:26,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 11:38:26,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 11:38:26,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:38:26,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:38:26,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 11:38:26,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:38:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:38:26,276 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:38:26,276 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:38:26,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081131593] [2025-03-03 11:38:26,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2081131593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:38:26,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:38:26,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:38:26,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147254036] [2025-03-03 11:38:26,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:38:26,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:38:26,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:38:26,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:38:26,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:38:26,296 INFO L87 Difference]: Start difference. First operand has 42 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:38:26,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:38:26,341 INFO L93 Difference]: Finished difference Result 49 states and 72 transitions. [2025-03-03 11:38:26,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:38:26,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-03 11:38:26,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:38:26,347 INFO L225 Difference]: With dead ends: 49 [2025-03-03 11:38:26,347 INFO L226 Difference]: Without dead ends: 41 [2025-03-03 11:38:26,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:38:26,350 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 1 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:38:26,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 175 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:38:26,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-03 11:38:26,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-03 11:38:26,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:38:26,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2025-03-03 11:38:26,369 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 16 [2025-03-03 11:38:26,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:38:26,369 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2025-03-03 11:38:26,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:38:26,369 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2025-03-03 11:38:26,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 11:38:26,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:38:26,370 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:38:26,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 11:38:26,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-03 11:38:26,571 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:38:26,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:38:26,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1164281813, now seen corresponding path program 1 times [2025-03-03 11:38:26,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:38:26,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651117959] [2025-03-03 11:38:26,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:38:26,572 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-03-03 11:38:26,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:38:26,573 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-03 11:38:26,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 11:38:26,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 11:38:26,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 11:38:26,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:38:26,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:38:26,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 11:38:26,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:38:29,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:38:29,912 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:38:29,912 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:38:29,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651117959] [2025-03-03 11:38:29,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651117959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:38:29,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:38:29,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 11:38:29,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108917518] [2025-03-03 11:38:29,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:38:29,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 11:38:29,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:38:29,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 11:38:29,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:38:29,914 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:38:33,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 11:38:36,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 11:38:41,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 11:38:43,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 11:38:45,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 11:38:48,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 11:38:49,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 11:38:53,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 11:38:57,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 11:39:01,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 11:39:05,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 11:39:07,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 11:39:10,463 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 [0] [2025-03-03 11:39:12,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 11:39:13,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:39:13,530 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2025-03-03 11:39:13,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 11:39:13,534 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-03 11:39:13,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:39:13,535 INFO L225 Difference]: With dead ends: 86 [2025-03-03 11:39:13,535 INFO L226 Difference]: Without dead ends: 61 [2025-03-03 11:39:13,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:39:13,536 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 84 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:39:13,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 80 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 4 Unknown, 0 Unchecked, 43.6s Time] [2025-03-03 11:39:13,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-03 11:39:13,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2025-03-03 11:39:13,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:39:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2025-03-03 11:39:13,542 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 16 [2025-03-03 11:39:13,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:39:13,542 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2025-03-03 11:39:13,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:39:13,542 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2025-03-03 11:39:13,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 11:39:13,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:39:13,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:39:13,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 11:39:13,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-03-03 11:39:13,743 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:39:13,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:39:13,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1705385181, now seen corresponding path program 1 times [2025-03-03 11:39:13,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:39:13,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361487324] [2025-03-03 11:39:13,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:39:13,744 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-03-03 11:39:13,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:39:13,745 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-03-03 11:39:13,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 11:39:13,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 11:39:13,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 11:39:13,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:39:13,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:39:13,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 11:39:13,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:39:19,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:39:19,487 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:39:19,487 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:39:19,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361487324] [2025-03-03 11:39:19,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361487324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:39:19,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:39:19,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 11:39:19,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215688529] [2025-03-03 11:39:19,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:39:19,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 11:39:19,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:39:19,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 11:39:19,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-03 11:39:19,488 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:39:27,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:39:27,604 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2025-03-03 11:39:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 11:39:27,611 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-03 11:39:27,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:39:27,612 INFO L225 Difference]: With dead ends: 81 [2025-03-03 11:39:27,612 INFO L226 Difference]: Without dead ends: 56 [2025-03-03 11:39:27,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-03 11:39:27,613 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 59 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:39:27,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 68 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2025-03-03 11:39:27,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-03 11:39:27,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 44. [2025-03-03 11:39:27,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:39:27,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2025-03-03 11:39:27,616 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 17 [2025-03-03 11:39:27,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:39:27,616 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2025-03-03 11:39:27,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:39:27,616 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2025-03-03 11:39:27,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 11:39:27,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:39:27,616 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:39:27,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 11:39:27,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-03-03 11:39:27,817 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:39:27,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:39:27,817 INFO L85 PathProgramCache]: Analyzing trace with hash 285704027, now seen corresponding path program 1 times [2025-03-03 11:39:27,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:39:27,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715340313] [2025-03-03 11:39:27,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:39:27,818 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-03-03 11:39:27,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:39:27,821 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-03-03 11:39:27,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 11:39:27,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 11:39:27,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 11:39:27,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:39:27,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:39:27,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 11:39:27,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:39:30,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:39:30,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:39:30,634 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:39:30,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715340313] [2025-03-03 11:39:30,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715340313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:39:30,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:39:30,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 11:39:30,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293156659] [2025-03-03 11:39:30,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:39:30,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 11:39:30,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:39:30,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 11:39:30,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:39:30,635 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:39:43,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:39:43,663 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2025-03-03 11:39:43,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 11:39:43,667 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-03 11:39:43,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:39:43,668 INFO L225 Difference]: With dead ends: 89 [2025-03-03 11:39:43,668 INFO L226 Difference]: Without dead ends: 64 [2025-03-03 11:39:43,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:39:43,668 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 62 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:39:43,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 136 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 13.0s Time] [2025-03-03 11:39:43,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-03 11:39:43,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 46. [2025-03-03 11:39:43,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 45 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:39:43,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2025-03-03 11:39:43,673 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 17 [2025-03-03 11:39:43,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:39:43,673 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2025-03-03 11:39:43,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:39:43,673 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2025-03-03 11:39:43,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 11:39:43,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:39:43,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:39:43,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-03 11:39:43,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-03-03 11:39:43,874 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:39:43,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:39:43,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2060711389, now seen corresponding path program 1 times [2025-03-03 11:39:43,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:39:43,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806831261] [2025-03-03 11:39:43,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:39:43,874 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-03-03 11:39:43,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:39:43,876 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-03-03 11:39:43,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 11:39:43,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 11:39:43,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 11:39:43,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:39:43,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:39:43,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 11:39:43,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:39:46,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:39:46,243 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:39:46,243 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:39:46,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806831261] [2025-03-03 11:39:46,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806831261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:39:46,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:39:46,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 11:39:46,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995826946] [2025-03-03 11:39:46,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:39:46,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 11:39:46,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:39:46,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 11:39:46,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:39:46,244 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)