./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-21.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4557fd955b08b5fada9f3a6efa621afd9324a377fdc4d7b9e90703dc668aa740 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:27:34,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:27:34,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:27:34,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:27:34,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:27:34,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:27:34,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:27:34,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:27:34,996 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:27:34,996 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:27:34,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:27:34,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:27:34,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:27:34,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:27:34,997 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:27:34,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:27:34,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:27:34,997 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:27:34,997 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:27:34,997 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:27:34,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:27:34,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:27:34,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:27:34,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:27:34,998 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:27:34,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:27:34,998 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:27:34,998 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:27:34,998 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:27:34,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:27:34,999 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:27:34,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:27:34,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:27:34,999 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:27:35,000 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:27:35,000 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:27:35,000 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:27:35,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:27:35,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:27:35,000 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:27:35,000 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:27:35,001 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:27:35,001 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:27:35,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:27:35,001 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:27:35,001 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:27:35,001 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:27:35,002 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:27:35,002 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 -> 4557fd955b08b5fada9f3a6efa621afd9324a377fdc4d7b9e90703dc668aa740 [2025-01-09 12:27:35,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:27:35,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:27:35,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:27:35,300 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:27:35,300 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:27:35,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-21.i [2025-01-09 12:27:36,611 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9844045a1/b47f83db2408401686b8b2cde41c5670/FLAG844a4b304 [2025-01-09 12:27:36,870 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:27:36,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-21.i [2025-01-09 12:27:36,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9844045a1/b47f83db2408401686b8b2cde41c5670/FLAG844a4b304 [2025-01-09 12:27:37,175 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9844045a1/b47f83db2408401686b8b2cde41c5670 [2025-01-09 12:27:37,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:27:37,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:27:37,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:27:37,180 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:27:37,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:27:37,184 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:37,185 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@261c242d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37, skipping insertion in model container [2025-01-09 12:27:37,185 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:37,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:27:37,324 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-21.i[917,930] [2025-01-09 12:27:37,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:27:37,381 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:27:37,391 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-21.i[917,930] [2025-01-09 12:27:37,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:27:37,439 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:27:37,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37 WrapperNode [2025-01-09 12:27:37,440 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:27:37,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:27:37,442 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:27:37,442 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:27:37,448 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:27:37" (1/1) ... [2025-01-09 12:27:37,457 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:27:37" (1/1) ... [2025-01-09 12:27:37,492 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 82 [2025-01-09 12:27:37,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:27:37,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:27:37,497 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:27:37,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:27:37,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:37,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:37,511 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:37,531 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 12:27:37,531 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:37,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:37,539 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:37,540 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:37,546 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:37,547 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:37,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:37,553 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:27:37,554 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:27:37,556 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:27:37,556 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:27:37,557 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37" (1/1) ... [2025-01-09 12:27:37,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:27:37,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:27:37,589 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 12:27:37,595 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 12:27:37,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:27:37,615 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:27:37,615 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:27:37,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:27:37,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:27:37,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:27:37,678 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:27:37,680 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:27:37,844 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 12:27:37,845 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:27:37,853 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:27:37,854 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:27:37,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:27:37 BoogieIcfgContainer [2025-01-09 12:27:37,855 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:27:37,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:27:37,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:27:37,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:27:37,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:27:37" (1/3) ... [2025-01-09 12:27:37,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776b478f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:27:37, skipping insertion in model container [2025-01-09 12:27:37,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:37" (2/3) ... [2025-01-09 12:27:37,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776b478f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:27:37, skipping insertion in model container [2025-01-09 12:27:37,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:27:37" (3/3) ... [2025-01-09 12:27:37,864 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-21.i [2025-01-09 12:27:37,873 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:27:37,875 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-21.i that has 2 procedures, 38 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:27:37,938 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:27:37,952 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;@76ebddd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:27:37,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:27:37,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 12:27:37,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 12:27:37,966 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:27:37,966 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:27:37,967 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:27:37,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:27:37,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1038644249, now seen corresponding path program 1 times [2025-01-09 12:27:37,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:27:37,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651903947] [2025-01-09 12:27:37,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:27:37,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:27:38,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 12:27:38,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 12:27:38,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:38,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:27:38,164 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-09 12:27:38,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:27:38,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651903947] [2025-01-09 12:27:38,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651903947] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:27:38,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817716284] [2025-01-09 12:27:38,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:27:38,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:27:38,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:27:38,174 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:27:38,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 12:27:38,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 12:27:38,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 12:27:38,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:38,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:27:38,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:27:38,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:27:38,303 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-09 12:27:38,304 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:27:38,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817716284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:27:38,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:27:38,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:27:38,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085295063] [2025-01-09 12:27:38,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:27:38,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:27:38,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:27:38,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:27:38,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:27:38,329 INFO L87 Difference]: Start difference. First operand has 38 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 12:27:38,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:27:38,342 INFO L93 Difference]: Finished difference Result 70 states and 108 transitions. [2025-01-09 12:27:38,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:27:38,344 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2025-01-09 12:27:38,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:27:38,350 INFO L225 Difference]: With dead ends: 70 [2025-01-09 12:27:38,350 INFO L226 Difference]: Without dead ends: 35 [2025-01-09 12:27:38,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:27:38,354 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:27:38,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:27:38,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-09 12:27:38,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-01-09 12:27:38,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 12:27:38,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2025-01-09 12:27:38,390 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 53 [2025-01-09 12:27:38,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:27:38,391 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2025-01-09 12:27:38,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 12:27:38,392 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2025-01-09 12:27:38,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 12:27:38,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:27:38,393 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:27:38,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 12:27:38,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 12:27:38,594 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:27:38,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:27:38,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1633389595, now seen corresponding path program 1 times [2025-01-09 12:27:38,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:27:38,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029737329] [2025-01-09 12:27:38,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:27:38,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:27:38,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 12:27:38,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 12:27:38,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:38,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:27:40,574 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 12:27:40,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:27:40,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029737329] [2025-01-09 12:27:40,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029737329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:27:40,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:27:40,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:27:40,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213820138] [2025-01-09 12:27:40,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:27:40,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:27:40,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:27:40,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:27:40,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:27:40,577 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 12:27:40,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:27:40,954 INFO L93 Difference]: Finished difference Result 122 states and 166 transitions. [2025-01-09 12:27:40,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:27:40,955 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 53 [2025-01-09 12:27:40,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:27:40,956 INFO L225 Difference]: With dead ends: 122 [2025-01-09 12:27:40,957 INFO L226 Difference]: Without dead ends: 90 [2025-01-09 12:27:40,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:27:40,958 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 72 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:27:40,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 280 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:27:40,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-09 12:27:40,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 80. [2025-01-09 12:27:40,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 60 states have internal predecessors, (71), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 12:27:40,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 105 transitions. [2025-01-09 12:27:40,980 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 105 transitions. Word has length 53 [2025-01-09 12:27:40,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:27:40,981 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 105 transitions. [2025-01-09 12:27:40,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 12:27:40,982 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2025-01-09 12:27:40,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 12:27:40,983 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:27:40,984 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:27:40,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:27:40,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:27:40,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:27:40,987 INFO L85 PathProgramCache]: Analyzing trace with hash 314833155, now seen corresponding path program 1 times [2025-01-09 12:27:40,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:27:40,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453670197] [2025-01-09 12:27:40,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:27:40,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:27:41,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 12:27:41,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 12:27:41,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:41,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:27:42,077 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 12:27:42,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:27:42,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453670197] [2025-01-09 12:27:42,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453670197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:27:42,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:27:42,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 12:27:42,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162057249] [2025-01-09 12:27:42,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:27:42,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:27:42,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:27:42,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:27:42,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:27:42,080 INFO L87 Difference]: Start difference. First operand 80 states and 105 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 12:27:42,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:27:42,915 INFO L93 Difference]: Finished difference Result 197 states and 262 transitions. [2025-01-09 12:27:42,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 12:27:42,916 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2025-01-09 12:27:42,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:27:42,919 INFO L225 Difference]: With dead ends: 197 [2025-01-09 12:27:42,919 INFO L226 Difference]: Without dead ends: 165 [2025-01-09 12:27:42,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2025-01-09 12:27:42,924 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 140 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:27:42,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 334 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 12:27:42,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-01-09 12:27:42,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 135. [2025-01-09 12:27:42,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 97 states have (on average 1.1958762886597938) internal successors, (116), 99 states have internal predecessors, (116), 31 states have call successors, (31), 6 states have call predecessors, (31), 6 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 12:27:42,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 178 transitions. [2025-01-09 12:27:42,963 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 178 transitions. Word has length 55 [2025-01-09 12:27:42,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:27:42,963 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 178 transitions. [2025-01-09 12:27:42,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 12:27:42,964 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 178 transitions. [2025-01-09 12:27:42,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 12:27:42,966 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:27:42,966 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:27:42,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:27:42,967 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:27:42,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:27:42,968 INFO L85 PathProgramCache]: Analyzing trace with hash 936179947, now seen corresponding path program 1 times [2025-01-09 12:27:42,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:27:42,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487345666] [2025-01-09 12:27:42,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:27:42,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:27:42,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 12:27:42,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 12:27:42,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:42,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:27:43,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1771409843] [2025-01-09 12:27:43,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:27:43,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:27:43,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:27:43,003 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:27:43,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 12:27:43,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 12:27:43,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 12:27:43,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:43,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:27:43,072 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:27:43,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 12:27:43,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 12:27:43,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:43,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:27:43,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:27:43,133 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:27:43,134 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:27:43,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 12:27:43,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:27:43,339 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 12:27:43,379 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:27:43,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:27:43 BoogieIcfgContainer [2025-01-09 12:27:43,383 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:27:43,384 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:27:43,384 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:27:43,384 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:27:43,385 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:27:37" (3/4) ... [2025-01-09 12:27:43,387 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:27:43,387 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:27:43,389 INFO L158 Benchmark]: Toolchain (without parser) took 6209.30ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 105.9MB in the beginning and 146.6MB in the end (delta: -40.6MB). Peak memory consumption was 152.0MB. Max. memory is 16.1GB. [2025-01-09 12:27:43,389 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:27:43,390 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.71ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 93.6MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:27:43,390 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.68ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 91.5MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:27:43,390 INFO L158 Benchmark]: Boogie Preprocessor took 57.05ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 88.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:27:43,390 INFO L158 Benchmark]: RCFGBuilder took 300.99ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 73.8MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:27:43,390 INFO L158 Benchmark]: TraceAbstraction took 5526.16ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 73.8MB in the beginning and 146.7MB in the end (delta: -72.8MB). Peak memory consumption was 118.4MB. Max. memory is 16.1GB. [2025-01-09 12:27:43,390 INFO L158 Benchmark]: Witness Printer took 3.89ms. Allocated memory is still 335.5MB. Free memory was 146.7MB in the beginning and 146.6MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:27:43,394 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.71ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 93.6MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.68ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 91.5MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.05ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 88.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 300.99ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 73.8MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5526.16ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 73.8MB in the beginning and 146.7MB in the end (delta: -72.8MB). Peak memory consumption was 118.4MB. Max. memory is 16.1GB. * Witness Printer took 3.89ms. Allocated memory is still 335.5MB. Free memory was 146.7MB in the beginning and 146.6MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 46, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] unsigned char var_1_7 = 0; [L24] double var_1_8 = 15.6; [L25] double var_1_9 = 15.4; [L26] double var_1_10 = 32.2; [L27] unsigned char var_1_12 = 1; [L28] signed short int var_1_13 = 256; [L29] float var_1_14 = 5.75; [L30] float var_1_15 = 8.6; [L31] unsigned char last_1_var_1_7 = 0; [L32] signed short int last_1_var_1_13 = 256; VAL [isInitial=0, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0, var_1_8=78/5, var_1_9=77/5] [L84] isInitial = 1 [L85] FCALL initially() [L87] CALL updateLastVariables() [L76] last_1_var_1_7 = var_1_7 [L77] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0, var_1_8=78/5, var_1_9=77/5] [L87] RET updateLastVariables() [L88] CALL updateVariables() [L61] var_1_8 = __VERIFIER_nondet_double() [L62] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0, var_1_9=77/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0, var_1_9=77/5] [L62] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0, var_1_9=77/5] [L63] var_1_9 = __VERIFIER_nondet_double() [L64] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L64] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L65] var_1_10 = __VERIFIER_nondet_double() [L66] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L66] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L67] var_1_12 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L68] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L69] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L69] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L70] var_1_14 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_15=43/5, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_15=43/5, var_1_1=32, var_1_7=0] [L71] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_15=43/5, var_1_1=32, var_1_7=0] [L72] var_1_15 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L73] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L88] RET updateVariables() [L89] CALL step() [L36] COND TRUE (last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L37] COND FALSE !(last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L45] COND TRUE \read(var_1_12) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L46] COND TRUE (var_1_14 - var_1_15) >= ((var_1_8 + var_1_10) + var_1_9) [L47] var_1_13 = ((((var_1_1) > (var_1_1)) ? (var_1_1) : (var_1_1))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] [L52] COND TRUE ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) <= var_1_10 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] [L53] COND FALSE !(last_1_var_1_7 && (var_1_1 >= var_1_1)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] [L89] RET step() [L90] CALL, EXPR property() [L80-L81] return ((((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? (var_1_1 == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_13))) && ((((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) <= var_1_10) ? ((last_1_var_1_7 && (var_1_1 >= var_1_1)) ? (var_1_7 == ((unsigned char) 0)) : 1) : (var_1_7 == ((unsigned char) var_1_12)))) && (var_1_12 ? (((var_1_14 - var_1_15) >= ((var_1_8 + var_1_10) + var_1_9)) ? (var_1_13 == ((signed short int) ((((var_1_1) > (var_1_1)) ? (var_1_1) : (var_1_1))))) : (var_1_13 == ((signed short int) var_1_1))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] [L90] RET, EXPR property() [L90] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 4, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 212 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 212 mSDsluCounter, 662 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 495 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 330 IncrementalHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 167 mSDtfsCounter, 330 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=3, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 40 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 326 NumberOfCodeBlocks, 326 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 871 SizeOfPredicates, 0 NumberOfNonLiveVariables, 143 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 324/336 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 12:27:43,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-21.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4557fd955b08b5fada9f3a6efa621afd9324a377fdc4d7b9e90703dc668aa740 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:27:45,649 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:27:45,739 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:27:45,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:27:45,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:27:45,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:27:45,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:27:45,775 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:27:45,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:27:45,775 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:27:45,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:27:45,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:27:45,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:27:45,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:27:45,776 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:27:45,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:27:45,778 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:27:45,778 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:27:45,778 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:27:45,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:27:45,778 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:27:45,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:27:45,778 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:27:45,778 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:27:45,778 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:27:45,778 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:27:45,778 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:27:45,778 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:27:45,778 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:27:45,779 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:27:45,779 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:27:45,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:27:45,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:27:45,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:27:45,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:27:45,779 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:27:45,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:27:45,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:27:45,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:27:45,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:27:45,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:27:45,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:27:45,779 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:27:45,779 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:27:45,780 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:27:45,780 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:27:45,780 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:27:45,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:27:45,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:27:45,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:27:45,780 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 -> 4557fd955b08b5fada9f3a6efa621afd9324a377fdc4d7b9e90703dc668aa740 [2025-01-09 12:27:46,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:27:46,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:27:46,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:27:46,096 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:27:46,096 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:27:46,097 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-21.i [2025-01-09 12:27:47,446 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad6c2f46d/cd9e47985fe54cacaab5bee5c1cd0337/FLAG8a2dfe55f [2025-01-09 12:27:47,699 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:27:47,701 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-21.i [2025-01-09 12:27:47,710 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad6c2f46d/cd9e47985fe54cacaab5bee5c1cd0337/FLAG8a2dfe55f [2025-01-09 12:27:48,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad6c2f46d/cd9e47985fe54cacaab5bee5c1cd0337 [2025-01-09 12:27:48,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:27:48,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:27:48,041 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:27:48,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:27:48,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:27:48,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:27:48" (1/1) ... [2025-01-09 12:27:48,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3185b697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:48, skipping insertion in model container [2025-01-09 12:27:48,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:27:48" (1/1) ... [2025-01-09 12:27:48,064 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:27:48,194 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-21.i[917,930] [2025-01-09 12:27:48,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:27:48,261 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:27:48,271 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-21.i[917,930] [2025-01-09 12:27:48,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:27:48,312 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:27:48,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:48 WrapperNode [2025-01-09 12:27:48,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:27:48,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:27:48,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:27:48,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:27:48,322 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:27:48" (1/1) ... [2025-01-09 12:27:48,335 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:27:48" (1/1) ... [2025-01-09 12:27:48,369 INFO L138 Inliner]: procedures = 27, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 82 [2025-01-09 12:27:48,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:27:48,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:27:48,371 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:27:48,371 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:27:48,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:48" (1/1) ... [2025-01-09 12:27:48,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:48" (1/1) ... [2025-01-09 12:27:48,383 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:48" (1/1) ... [2025-01-09 12:27:48,403 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 12:27:48,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:48" (1/1) ... [2025-01-09 12:27:48,404 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:48" (1/1) ... [2025-01-09 12:27:48,415 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:48" (1/1) ... [2025-01-09 12:27:48,416 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:48" (1/1) ... [2025-01-09 12:27:48,422 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:48" (1/1) ... [2025-01-09 12:27:48,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:48" (1/1) ... [2025-01-09 12:27:48,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:48" (1/1) ... [2025-01-09 12:27:48,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:27:48,436 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:27:48,436 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:27:48,436 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:27:48,437 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:48" (1/1) ... [2025-01-09 12:27:48,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:27:48,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:27:48,472 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 12:27:48,480 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 12:27:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:27:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:27:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:27:48,501 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:27:48,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:27:48,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:27:48,568 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:27:48,571 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:27:54,574 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 12:27:54,574 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:27:54,582 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:27:54,582 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:27:54,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:27:54 BoogieIcfgContainer [2025-01-09 12:27:54,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:27:54,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:27:54,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:27:54,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:27:54,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:27:48" (1/3) ... [2025-01-09 12:27:54,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f7c09d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:27:54, skipping insertion in model container [2025-01-09 12:27:54,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:48" (2/3) ... [2025-01-09 12:27:54,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f7c09d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:27:54, skipping insertion in model container [2025-01-09 12:27:54,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:27:54" (3/3) ... [2025-01-09 12:27:54,592 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-21.i [2025-01-09 12:27:54,604 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:27:54,606 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-21.i that has 2 procedures, 38 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:27:54,658 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:27:54,669 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;@27aed982, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:27:54,670 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:27:54,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 12:27:54,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 12:27:54,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:27:54,680 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:27:54,680 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:27:54,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:27:54,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1038644249, now seen corresponding path program 1 times [2025-01-09 12:27:54,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:27:54,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536337908] [2025-01-09 12:27:54,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:27:54,694 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 12:27:54,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:27:54,698 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 12:27:54,700 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 12:27:54,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 12:27:54,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 12:27:54,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:54,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:27:54,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:27:54,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:27:54,887 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 12:27:54,888 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:27:54,888 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:27:54,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536337908] [2025-01-09 12:27:54,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1536337908] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:27:54,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:27:54,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:27:54,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995952078] [2025-01-09 12:27:54,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:27:54,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:27:54,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:27:54,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:27:54,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:27:54,913 INFO L87 Difference]: Start difference. First operand has 38 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 12:27:54,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:27:54,935 INFO L93 Difference]: Finished difference Result 70 states and 108 transitions. [2025-01-09 12:27:54,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:27:54,937 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2025-01-09 12:27:54,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:27:54,943 INFO L225 Difference]: With dead ends: 70 [2025-01-09 12:27:54,943 INFO L226 Difference]: Without dead ends: 35 [2025-01-09 12:27:54,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:27:54,950 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:27:54,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:27:54,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-09 12:27:54,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-01-09 12:27:54,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 12:27:54,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2025-01-09 12:27:54,987 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 53 [2025-01-09 12:27:54,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:27:54,988 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2025-01-09 12:27:54,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 12:27:54,988 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2025-01-09 12:27:54,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 12:27:54,990 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:27:54,990 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:27:54,997 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 12:27:55,190 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 12:27:55,191 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:27:55,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:27:55,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1633389595, now seen corresponding path program 1 times [2025-01-09 12:27:55,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:27:55,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485075839] [2025-01-09 12:27:55,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:27:55,193 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 12:27:55,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:27:55,196 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 12:27:55,198 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 12:27:55,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 12:27:55,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 12:27:55,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:55,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:27:55,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 12:27:55,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:27:55,647 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 12:27:55,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:27:55,647 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:27:55,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485075839] [2025-01-09 12:27:55,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485075839] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:27:55,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:27:55,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:27:55,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542642576] [2025-01-09 12:27:55,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:27:55,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:27:55,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:27:55,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:27:55,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:27:55,650 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 12:27:59,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:28:00,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:28:03,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:28:05,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:28:05,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:28:05,809 INFO L93 Difference]: Finished difference Result 107 states and 147 transitions. [2025-01-09 12:28:05,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:28:05,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 53 [2025-01-09 12:28:05,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:28:05,832 INFO L225 Difference]: With dead ends: 107 [2025-01-09 12:28:05,833 INFO L226 Difference]: Without dead ends: 75 [2025-01-09 12:28:05,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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 12:28:05,834 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 53 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:28:05,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 122 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2025-01-09 12:28:05,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-09 12:28:05,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2025-01-09 12:28:05,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 12:28:05,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2025-01-09 12:28:05,849 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 53 [2025-01-09 12:28:05,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:28:05,850 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2025-01-09 12:28:05,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 12:28:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2025-01-09 12:28:05,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 12:28:05,854 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:28:05,854 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:28:05,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 12:28:06,054 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 12:28:06,055 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:28:06,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:28:06,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1501876559, now seen corresponding path program 1 times [2025-01-09 12:28:06,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:28:06,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428504211] [2025-01-09 12:28:06,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:28:06,056 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 12:28:06,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:28:06,059 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 12:28:06,061 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 12:28:06,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 12:28:06,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 12:28:06,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:28:06,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:28:06,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 12:28:06,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:28:06,327 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 48 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 12:28:06,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:28:06,563 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-09 12:28:06,564 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:28:06,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1428504211] [2025-01-09 12:28:06,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1428504211] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:28:06,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 12:28:06,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-01-09 12:28:06,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850825381] [2025-01-09 12:28:06,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 12:28:06,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 12:28:06,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:28:06,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 12:28:06,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:28:06,566 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 12:28:09,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:28:09,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:28:09,635 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2025-01-09 12:28:09,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 12:28:09,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 54 [2025-01-09 12:28:09,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:28:09,660 INFO L225 Difference]: With dead ends: 125 [2025-01-09 12:28:09,660 INFO L226 Difference]: Without dead ends: 65 [2025-01-09 12:28:09,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:28:09,662 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 26 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:28:09,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 91 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-09 12:28:09,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-09 12:28:09,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2025-01-09 12:28:09,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 12:28:09,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2025-01-09 12:28:09,672 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 54 [2025-01-09 12:28:09,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:28:09,673 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2025-01-09 12:28:09,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 12:28:09,673 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2025-01-09 12:28:09,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 12:28:09,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:28:09,674 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:28:09,682 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 12:28:09,874 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 12:28:09,875 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:28:09,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:28:09,875 INFO L85 PathProgramCache]: Analyzing trace with hash 314833155, now seen corresponding path program 1 times [2025-01-09 12:28:09,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:28:09,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543846950] [2025-01-09 12:28:09,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:28:09,876 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 12:28:09,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:28:09,879 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 12:28:09,880 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 12:28:09,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 12:28:10,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 12:28:10,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:28:10,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:28:10,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 12:28:10,135 INFO L279 TraceCheckSpWp]: Computing forward predicates...