./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b4d60c093ba6c9dcaff9815fcaab264eab148dbcfff5c12da0f56175eb222a22 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:55:12,238 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:55:12,289 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:55:12,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:55:12,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:55:12,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:55:12,322 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:55:12,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:55:12,323 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:55:12,323 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:55:12,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:55:12,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:55:12,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:55:12,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:55:12,325 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:55:12,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:55:12,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:55:12,325 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:55:12,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:55:12,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:55:12,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:55:12,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:55:12,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:55:12,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:55:12,326 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:55:12,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:55:12,326 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:55:12,327 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:55:12,327 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:55:12,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:55:12,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:55:12,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:55:12,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:55:12,328 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:55:12,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:55:12,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:55:12,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:55:12,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:55:12,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:55:12,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:55:12,328 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:55:12,328 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:55:12,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:55:12,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:55:12,329 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:55:12,329 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:55:12,329 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:55:12,329 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:55:12,329 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b4d60c093ba6c9dcaff9815fcaab264eab148dbcfff5c12da0f56175eb222a22 [2025-01-09 00:55:12,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:55:12,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:55:12,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:55:12,627 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:55:12,627 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:55:12,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c [2025-01-09 00:55:13,919 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8439915db/92596c1a17ee4822aa9476e3d42299d7/FLAGac3879255 [2025-01-09 00:55:14,181 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:55:14,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c [2025-01-09 00:55:14,190 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8439915db/92596c1a17ee4822aa9476e3d42299d7/FLAGac3879255 [2025-01-09 00:55:14,483 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8439915db/92596c1a17ee4822aa9476e3d42299d7 [2025-01-09 00:55:14,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:55:14,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:55:14,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:55:14,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:55:14,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:55:14,492 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:55:14" (1/1) ... [2025-01-09 00:55:14,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78d1a8b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:14, skipping insertion in model container [2025-01-09 00:55:14,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:55:14" (1/1) ... [2025-01-09 00:55:14,516 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:55:14,657 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c[1494,1507] [2025-01-09 00:55:14,671 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c[2698,2711] [2025-01-09 00:55:14,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:55:14,690 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:55:14,704 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c[1494,1507] [2025-01-09 00:55:14,711 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c[2698,2711] [2025-01-09 00:55:14,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:55:14,732 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:55:14,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:14 WrapperNode [2025-01-09 00:55:14,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:55:14,733 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:55:14,733 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:55:14,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:55:14,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:14" (1/1) ... [2025-01-09 00:55:14,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:14" (1/1) ... [2025-01-09 00:55:14,762 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 161 [2025-01-09 00:55:14,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:55:14,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:55:14,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:55:14,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:55:14,773 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:14" (1/1) ... [2025-01-09 00:55:14,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:14" (1/1) ... [2025-01-09 00:55:14,775 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:14" (1/1) ... [2025-01-09 00:55:14,787 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 00:55:14,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:14" (1/1) ... [2025-01-09 00:55:14,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:14" (1/1) ... [2025-01-09 00:55:14,797 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:14" (1/1) ... [2025-01-09 00:55:14,798 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:14" (1/1) ... [2025-01-09 00:55:14,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:14" (1/1) ... [2025-01-09 00:55:14,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:14" (1/1) ... [2025-01-09 00:55:14,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:14" (1/1) ... [2025-01-09 00:55:14,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:55:14,807 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:55:14,810 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:55:14,810 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:55:14,811 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:14" (1/1) ... [2025-01-09 00:55:14,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:55:14,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:55:14,840 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:55:14,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:55:14,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:55:14,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:55:14,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:55:14,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:55:14,919 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:55:14,921 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:55:15,130 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-01-09 00:55:15,131 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:55:15,140 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:55:15,140 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 00:55:15,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:55:15 BoogieIcfgContainer [2025-01-09 00:55:15,141 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:55:15,145 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:55:15,145 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:55:15,149 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:55:15,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:55:14" (1/3) ... [2025-01-09 00:55:15,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14adae21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:55:15, skipping insertion in model container [2025-01-09 00:55:15,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:14" (2/3) ... [2025-01-09 00:55:15,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14adae21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:55:15, skipping insertion in model container [2025-01-09 00:55:15,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:55:15" (3/3) ... [2025-01-09 00:55:15,153 INFO L128 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c.v+lhb-reducer.c [2025-01-09 00:55:15,167 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:55:15,168 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-01-09 00:55:15,221 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:55:15,233 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;@1011740b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:55:15,234 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 00:55:15,238 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-01-09 00:55:15,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 00:55:15,242 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:55:15,242 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:55:15,243 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:55:15,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:55:15,247 INFO L85 PathProgramCache]: Analyzing trace with hash 346658074, now seen corresponding path program 1 times [2025-01-09 00:55:15,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:55:15,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983039316] [2025-01-09 00:55:15,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:55:15,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:55:15,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 00:55:15,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 00:55:15,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:55:15,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 00:55:15,325 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 00:55:15,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 00:55:15,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 00:55:15,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:55:15,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 00:55:15,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 00:55:15,355 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 00:55:15,356 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-01-09 00:55:15,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-09 00:55:15,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:55:15,362 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-09 00:55:15,386 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:55:15,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:55:15 BoogieIcfgContainer [2025-01-09 00:55:15,388 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:55:15,389 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:55:15,389 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:55:15,389 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:55:15,390 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:55:15" (3/4) ... [2025-01-09 00:55:15,391 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 00:55:15,392 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:55:15,393 INFO L158 Benchmark]: Toolchain (without parser) took 906.50ms. Allocated memory is still 167.8MB. Free memory was 124.4MB in the beginning and 80.7MB in the end (delta: 43.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 00:55:15,393 INFO L158 Benchmark]: CDTParser took 0.78ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:55:15,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.41ms. Allocated memory is still 167.8MB. Free memory was 124.4MB in the beginning and 112.2MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 00:55:15,393 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.65ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 110.4MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 00:55:15,394 INFO L158 Benchmark]: Boogie Preprocessor took 41.27ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 109.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:55:15,394 INFO L158 Benchmark]: RCFGBuilder took 333.44ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 94.8MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 00:55:15,394 INFO L158 Benchmark]: TraceAbstraction took 243.54ms. Allocated memory is still 167.8MB. Free memory was 94.3MB in the beginning and 80.7MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 00:55:15,394 INFO L158 Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 167.8MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:55:15,396 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.78ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.41ms. Allocated memory is still 167.8MB. Free memory was 124.4MB in the beginning and 112.2MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.65ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 110.4MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.27ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 109.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 333.44ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 94.8MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 243.54ms. Allocated memory is still 167.8MB. Free memory was 94.3MB in the beginning and 80.7MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 2.81ms. Allocated memory is still 167.8MB. Free memory is still 80.7MB. 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 39, overapproximation of someBinaryDOUBLEComparisonOperation at line 41, overapproximation of someBinaryDOUBLEComparisonOperation at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 31, overapproximation of someBinaryDOUBLEComparisonOperation at line 54, 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.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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-01-09 00:55:15,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b4d60c093ba6c9dcaff9815fcaab264eab148dbcfff5c12da0f56175eb222a22 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:55:17,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:55:17,666 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 00:55:17,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:55:17,672 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:55:17,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:55:17,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:55:17,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:55:17,700 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:55:17,700 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:55:17,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:55:17,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:55:17,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:55:17,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:55:17,702 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:55:17,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:55:17,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:55:17,702 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:55:17,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:55:17,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:55:17,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:55:17,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:55:17,703 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:55:17,703 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 00:55:17,703 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 00:55:17,703 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 00:55:17,703 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:55:17,703 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:55:17,703 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:55:17,703 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:55:17,704 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:55:17,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:55:17,704 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:55:17,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:55:17,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:55:17,704 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:55:17,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:55:17,704 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:55:17,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:55:17,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:55:17,704 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:55:17,704 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:55:17,704 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:55:17,704 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:55:17,704 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 00:55:17,704 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 00:55:17,704 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:55:17,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:55:17,705 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:55:17,705 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:55:17,705 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b4d60c093ba6c9dcaff9815fcaab264eab148dbcfff5c12da0f56175eb222a22 [2025-01-09 00:55:17,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:55:17,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:55:17,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:55:17,982 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:55:17,982 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:55:17,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c [2025-01-09 00:55:19,297 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c17fca346/2e3d60b822854e2d8df57f70bf465348/FLAGf92839bf4 [2025-01-09 00:55:19,487 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:55:19,487 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c [2025-01-09 00:55:19,494 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c17fca346/2e3d60b822854e2d8df57f70bf465348/FLAGf92839bf4 [2025-01-09 00:55:19,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c17fca346/2e3d60b822854e2d8df57f70bf465348 [2025-01-09 00:55:19,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:55:19,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:55:19,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:55:19,511 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:55:19,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:55:19,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:55:19" (1/1) ... [2025-01-09 00:55:19,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fb04a20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:19, skipping insertion in model container [2025-01-09 00:55:19,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:55:19" (1/1) ... [2025-01-09 00:55:19,529 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:55:19,649 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c[1494,1507] [2025-01-09 00:55:19,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c[2698,2711] [2025-01-09 00:55:19,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:55:19,673 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:55:19,685 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c[1494,1507] [2025-01-09 00:55:19,689 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c[2698,2711] [2025-01-09 00:55:19,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:55:19,705 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:55:19,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:19 WrapperNode [2025-01-09 00:55:19,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:55:19,706 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:55:19,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:55:19,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:55:19,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:19" (1/1) ... [2025-01-09 00:55:19,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:19" (1/1) ... [2025-01-09 00:55:19,732 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 162 [2025-01-09 00:55:19,732 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:55:19,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:55:19,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:55:19,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:55:19,739 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:19" (1/1) ... [2025-01-09 00:55:19,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:19" (1/1) ... [2025-01-09 00:55:19,741 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:19" (1/1) ... [2025-01-09 00:55:19,755 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 00:55:19,755 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:19" (1/1) ... [2025-01-09 00:55:19,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:19" (1/1) ... [2025-01-09 00:55:19,761 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:19" (1/1) ... [2025-01-09 00:55:19,761 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:19" (1/1) ... [2025-01-09 00:55:19,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:19" (1/1) ... [2025-01-09 00:55:19,764 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:19" (1/1) ... [2025-01-09 00:55:19,765 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:19" (1/1) ... [2025-01-09 00:55:19,767 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:55:19,768 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:55:19,768 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:55:19,768 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:55:19,769 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:19" (1/1) ... [2025-01-09 00:55:19,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:55:19,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:55:19,801 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:55:19,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:55:19,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:55:19,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 00:55:19,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:55:19,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:55:19,905 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:55:19,907 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:55:21,313 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-01-09 00:55:21,314 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:55:21,324 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:55:21,325 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 00:55:21,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:55:21 BoogieIcfgContainer [2025-01-09 00:55:21,326 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:55:21,328 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:55:21,328 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:55:21,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:55:21,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:55:19" (1/3) ... [2025-01-09 00:55:21,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c6c1879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:55:21, skipping insertion in model container [2025-01-09 00:55:21,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:19" (2/3) ... [2025-01-09 00:55:21,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c6c1879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:55:21, skipping insertion in model container [2025-01-09 00:55:21,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:55:21" (3/3) ... [2025-01-09 00:55:21,335 INFO L128 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c.v+lhb-reducer.c [2025-01-09 00:55:21,345 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:55:21,346 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-01-09 00:55:21,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:55:21,387 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;@196a5e19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:55:21,387 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 00:55:21,391 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-01-09 00:55:21,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 00:55:21,395 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:55:21,395 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:55:21,396 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:55:21,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:55:21,401 INFO L85 PathProgramCache]: Analyzing trace with hash 346658074, now seen corresponding path program 1 times [2025-01-09 00:55:21,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 00:55:21,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805566708] [2025-01-09 00:55:21,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:55:21,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 00:55:21,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 00:55:21,418 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 00:55:21,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 00:55:21,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 00:55:21,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 00:55:21,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:55:21,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:55:21,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 00:55:21,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:55:28,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:55:28,138 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:55:28,139 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 00:55:28,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805566708] [2025-01-09 00:55:28,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805566708] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:55:28,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:55:28,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 00:55:28,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957985818] [2025-01-09 00:55:28,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:55:28,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 00:55:28,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 00:55:28,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 00:55:28,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:55:28,165 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 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-01-09 00:55:30,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 00:55:36,229 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-01-09 00:55:43,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 00:55:49,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 00:55:54,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 00:55:57,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 00:55:59,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 00:56:05,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 00:56:09,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:56:09,249 INFO L93 Difference]: Finished difference Result 91 states and 136 transitions. [2025-01-09 00:56:09,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 00:56:09,259 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-01-09 00:56:09,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:56:09,263 INFO L225 Difference]: With dead ends: 91 [2025-01-09 00:56:09,263 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 00:56:09,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:56:09,266 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 86 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:56:09,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 115 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 5 Unknown, 0 Unchecked, 41.0s Time] [2025-01-09 00:56:09,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 00:56:09,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2025-01-09 00:56:09,285 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-01-09 00:56:09,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2025-01-09 00:56:09,291 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 16 [2025-01-09 00:56:09,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:56:09,291 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2025-01-09 00:56:09,291 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-01-09 00:56:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2025-01-09 00:56:09,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 00:56:09,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:56:09,292 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:56:09,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 00:56:09,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 00:56:09,493 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:56:09,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:56:09,493 INFO L85 PathProgramCache]: Analyzing trace with hash 257195701, now seen corresponding path program 1 times [2025-01-09 00:56:09,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 00:56:09,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540865045] [2025-01-09 00:56:09,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:56:09,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 00:56:09,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 00:56:09,496 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 00:56:09,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 00:56:09,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 00:56:09,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 00:56:09,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:56:09,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:56:09,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:56:09,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:56:09,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:56:09,599 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:56:09,599 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 00:56:09,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540865045] [2025-01-09 00:56:09,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540865045] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:56:09,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:56:09,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:56:09,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138121582] [2025-01-09 00:56:09,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:56:09,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:56:09,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 00:56:09,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:56:09,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:56:09,601 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. 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-01-09 00:56:09,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:56:09,628 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2025-01-09 00:56:09,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:56:09,630 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-01-09 00:56:09,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:56:09,630 INFO L225 Difference]: With dead ends: 45 [2025-01-09 00:56:09,630 INFO L226 Difference]: Without dead ends: 43 [2025-01-09 00:56:09,630 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-01-09 00:56:09,631 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:56:09,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 141 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 00:56:09,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-09 00:56:09,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-01-09 00:56:09,636 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-01-09 00:56:09,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2025-01-09 00:56:09,636 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 16 [2025-01-09 00:56:09,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:56:09,636 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2025-01-09 00:56:09,637 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-01-09 00:56:09,637 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2025-01-09 00:56:09,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 00:56:09,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:56:09,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:56:09,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-01-09 00:56:09,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 00:56:09,843 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:56:09,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:56:09,844 INFO L85 PathProgramCache]: Analyzing trace with hash -533932591, now seen corresponding path program 1 times [2025-01-09 00:56:09,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 00:56:09,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572609881] [2025-01-09 00:56:09,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:56:09,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 00:56:09,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 00:56:09,847 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 00:56:09,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 00:56:09,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 00:56:09,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 00:56:09,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:56:09,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:56:09,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 00:56:09,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:56:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:56:15,819 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:56:15,819 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 00:56:15,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572609881] [2025-01-09 00:56:15,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [572609881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:56:15,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:56:15,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 00:56:15,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57412536] [2025-01-09 00:56:15,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:56:15,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 00:56:15,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 00:56:15,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 00:56:15,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:56:15,820 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-01-09 00:56:28,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:56:28,119 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2025-01-09 00:56:28,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 00:56:28,128 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-01-09 00:56:28,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:56:28,129 INFO L225 Difference]: With dead ends: 81 [2025-01-09 00:56:28,129 INFO L226 Difference]: Without dead ends: 56 [2025-01-09 00:56:28,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:56:28,130 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 58 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:56:28,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 83 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 12.3s Time] [2025-01-09 00:56:28,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-09 00:56:28,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 44. [2025-01-09 00:56:28,133 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-01-09 00:56:28,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2025-01-09 00:56:28,134 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 17 [2025-01-09 00:56:28,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:56:28,134 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2025-01-09 00:56:28,134 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-01-09 00:56:28,134 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2025-01-09 00:56:28,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 00:56:28,135 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:56:28,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:56:28,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 00:56:28,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 00:56:28,336 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:56:28,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:56:28,336 INFO L85 PathProgramCache]: Analyzing trace with hash -354879015, now seen corresponding path program 1 times [2025-01-09 00:56:28,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 00:56:28,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [908781451] [2025-01-09 00:56:28,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:56:28,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 00:56:28,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 00:56:28,339 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 00:56:28,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 00:56:28,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 00:56:28,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 00:56:28,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:56:28,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:56:28,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 00:56:28,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:56:32,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:56:32,332 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:56:32,332 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 00:56:32,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [908781451] [2025-01-09 00:56:32,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [908781451] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:56:32,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:56:32,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 00:56:32,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285950323] [2025-01-09 00:56:32,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:56:32,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 00:56:32,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 00:56:32,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 00:56:32,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:56:32,334 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-01-09 00:56:46,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:56:46,500 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2025-01-09 00:56:46,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 00:56:46,505 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-01-09 00:56:46,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:56:46,506 INFO L225 Difference]: With dead ends: 89 [2025-01-09 00:56:46,506 INFO L226 Difference]: Without dead ends: 64 [2025-01-09 00:56:46,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 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-01-09 00:56:46,509 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 62 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:56:46,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 110 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 14.1s Time] [2025-01-09 00:56:46,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-09 00:56:46,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 46. [2025-01-09 00:56:46,512 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-01-09 00:56:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2025-01-09 00:56:46,512 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 17 [2025-01-09 00:56:46,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:56:46,512 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2025-01-09 00:56:46,512 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-01-09 00:56:46,513 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2025-01-09 00:56:46,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 00:56:46,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:56:46,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:56:46,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 00:56:46,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 00:56:46,715 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:56:46,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:56:46,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1420128347, now seen corresponding path program 1 times [2025-01-09 00:56:46,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 00:56:46,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672430647] [2025-01-09 00:56:46,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:56:46,716 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 00:56:46,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 00:56:46,718 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 00:56:46,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 00:56:46,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 00:56:46,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 00:56:46,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:56:46,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:56:46,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:56:46,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:56:50,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:56:50,628 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:56:50,628 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 00:56:50,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672430647] [2025-01-09 00:56:50,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672430647] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:56:50,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:56:50,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 00:56:50,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412261765] [2025-01-09 00:56:50,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:56:50,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:56:50,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 00:56:50,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:56:50,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:56:50,629 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)