./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-65.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_variablewrapping_wrapper-s_file-65.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 2dc4b4561b119f2d441fb605148029621181083992b9a4c5c6ca30ee08fd9eac --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:01:24,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:01:24,188 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:01:24,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:01:24,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:01:24,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:01:24,206 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:01:24,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:01:24,206 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:01:24,206 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:01:24,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:01:24,206 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:01:24,206 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:01:24,207 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:01:24,207 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:01:24,207 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:01:24,207 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:01:24,207 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:01:24,207 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:01:24,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:01:24,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:01:24,207 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:01:24,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:01:24,208 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:01:24,208 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:01:24,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:01:24,208 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:01:24,208 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:01:24,208 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:01:24,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:01:24,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:01:24,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:01:24,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:01:24,208 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:01:24,209 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:01:24,209 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:01:24,209 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:01:24,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:01:24,212 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:01:24,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:01:24,212 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:01:24,212 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:01:24,212 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:01:24,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:01:24,212 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:01:24,212 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:01:24,212 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:01:24,212 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:01:24,212 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 -> 2dc4b4561b119f2d441fb605148029621181083992b9a4c5c6ca30ee08fd9eac [2025-01-09 16:01:24,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:01:24,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:01:24,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:01:24,441 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:01:24,442 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:01:24,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-65.i [2025-01-09 16:01:25,634 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a11ba5354/89f90667bfcb447b9929c9f6e2572bb5/FLAGabd812817 [2025-01-09 16:01:25,900 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:01:25,901 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-65.i [2025-01-09 16:01:25,919 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a11ba5354/89f90667bfcb447b9929c9f6e2572bb5/FLAGabd812817 [2025-01-09 16:01:26,210 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a11ba5354/89f90667bfcb447b9929c9f6e2572bb5 [2025-01-09 16:01:26,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:01:26,213 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:01:26,214 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:01:26,214 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:01:26,217 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:01:26,218 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:01:26" (1/1) ... [2025-01-09 16:01:26,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f7cdde6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:26, skipping insertion in model container [2025-01-09 16:01:26,218 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:01:26" (1/1) ... [2025-01-09 16:01:26,229 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:01:26,332 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_variablewrapping_wrapper-s_file-65.i[916,929] [2025-01-09 16:01:26,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:01:26,380 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:01:26,393 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_variablewrapping_wrapper-s_file-65.i[916,929] [2025-01-09 16:01:26,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:01:26,443 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:01:26,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:26 WrapperNode [2025-01-09 16:01:26,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:01:26,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:01:26,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:01:26,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:01:26,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:26" (1/1) ... [2025-01-09 16:01:26,460 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:26" (1/1) ... [2025-01-09 16:01:26,493 INFO L138 Inliner]: procedures = 30, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 479 [2025-01-09 16:01:26,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:01:26,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:01:26,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:01:26,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:01:26,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:26" (1/1) ... [2025-01-09 16:01:26,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:26" (1/1) ... [2025-01-09 16:01:26,511 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:26" (1/1) ... [2025-01-09 16:01:26,520 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 16:01:26,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:26" (1/1) ... [2025-01-09 16:01:26,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:26" (1/1) ... [2025-01-09 16:01:26,535 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:26" (1/1) ... [2025-01-09 16:01:26,539 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:26" (1/1) ... [2025-01-09 16:01:26,542 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:26" (1/1) ... [2025-01-09 16:01:26,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:26" (1/1) ... [2025-01-09 16:01:26,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:26" (1/1) ... [2025-01-09 16:01:26,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:01:26,557 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:01:26,561 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:01:26,562 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:01:26,562 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:26" (1/1) ... [2025-01-09 16:01:26,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:01:26,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:01:26,595 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 16:01:26,599 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 16:01:26,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:01:26,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 16:01:26,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 16:01:26,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 16:01:26,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 16:01:26,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 16:01:26,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 16:01:26,615 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:01:26,615 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:01:26,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 16:01:26,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:01:26,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:01:26,686 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:01:26,687 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:01:27,130 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-01-09 16:01:27,130 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:01:27,144 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:01:27,144 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:01:27,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:01:27 BoogieIcfgContainer [2025-01-09 16:01:27,146 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:01:27,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:01:27,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:01:27,151 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:01:27,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:01:26" (1/3) ... [2025-01-09 16:01:27,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75349bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:01:27, skipping insertion in model container [2025-01-09 16:01:27,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:26" (2/3) ... [2025-01-09 16:01:27,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75349bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:01:27, skipping insertion in model container [2025-01-09 16:01:27,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:01:27" (3/3) ... [2025-01-09 16:01:27,154 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-65.i [2025-01-09 16:01:27,165 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:01:27,168 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-65.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:01:27,218 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:01:27,227 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;@7eb43db0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:01:27,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:01:27,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:01:27,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 16:01:27,242 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:27,242 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:27,243 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:27,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:27,249 INFO L85 PathProgramCache]: Analyzing trace with hash -260203594, now seen corresponding path program 1 times [2025-01-09 16:01:27,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:01:27,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992568423] [2025-01-09 16:01:27,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:27,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:01:27,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 16:01:27,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 16:01:27,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:27,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:27,518 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-01-09 16:01:27,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:01:27,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992568423] [2025-01-09 16:01:27,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992568423] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:01:27,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746685719] [2025-01-09 16:01:27,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:27,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:01:27,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:01:27,524 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 16:01:27,543 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 16:01:27,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 16:01:27,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 16:01:27,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:27,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:27,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:01:27,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:01:27,754 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-01-09 16:01:27,754 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:01:27,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746685719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:27,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:01:27,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 16:01:27,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043710416] [2025-01-09 16:01:27,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:27,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:01:27,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:01:27,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:01:27,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:01:27,773 INFO L87 Difference]: Start difference. First operand has 112 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:01:27,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:27,796 INFO L93 Difference]: Finished difference Result 218 states and 334 transitions. [2025-01-09 16:01:27,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:01:27,798 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-01-09 16:01:27,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:27,802 INFO L225 Difference]: With dead ends: 218 [2025-01-09 16:01:27,802 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 16:01:27,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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 16:01:27,806 INFO L435 NwaCegarLoop]: 157 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, 157 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 16:01:27,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:01:27,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 16:01:27,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-01-09 16:01:27,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:01:27,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-01-09 16:01:27,832 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 112 [2025-01-09 16:01:27,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:27,832 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-01-09 16:01:27,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:01:27,832 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-01-09 16:01:27,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 16:01:27,834 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:27,834 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:27,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 16:01:28,039 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 16:01:28,040 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:28,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:28,041 INFO L85 PathProgramCache]: Analyzing trace with hash -235366160, now seen corresponding path program 1 times [2025-01-09 16:01:28,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:01:28,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889237994] [2025-01-09 16:01:28,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:28,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:01:28,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 16:01:28,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 16:01:28,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:28,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:28,459 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-01-09 16:01:28,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:01:28,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889237994] [2025-01-09 16:01:28,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889237994] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:01:28,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610310636] [2025-01-09 16:01:28,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:28,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:01:28,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:01:28,463 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 16:01:28,464 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 16:01:28,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 16:01:28,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 16:01:28,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:28,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:28,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:01:28,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:01:28,663 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:01:28,664 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:01:28,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610310636] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:28,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:01:28,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-01-09 16:01:28,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872781941] [2025-01-09 16:01:28,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:28,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:01:28,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:01:28,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:01:28,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:01:28,667 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:01:28,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:28,697 INFO L93 Difference]: Finished difference Result 218 states and 315 transitions. [2025-01-09 16:01:28,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:01:28,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2025-01-09 16:01:28,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:28,698 INFO L225 Difference]: With dead ends: 218 [2025-01-09 16:01:28,698 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 16:01:28,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:01:28,699 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:28,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 452 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:01:28,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 16:01:28,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-01-09 16:01:28,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:01:28,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2025-01-09 16:01:28,710 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 112 [2025-01-09 16:01:28,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:28,714 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2025-01-09 16:01:28,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:01:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2025-01-09 16:01:28,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 16:01:28,716 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:28,717 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:28,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:01:28,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:01:28,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:28,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:28,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1539641202, now seen corresponding path program 1 times [2025-01-09 16:01:28,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:01:28,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593951134] [2025-01-09 16:01:28,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:28,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:01:28,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 16:01:28,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 16:01:28,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:28,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:29,165 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-01-09 16:01:29,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:01:29,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593951134] [2025-01-09 16:01:29,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593951134] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:01:29,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927207280] [2025-01-09 16:01:29,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:29,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:01:29,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:01:29,172 INFO L229 MonitoredProcess]: Starting monitored process 4 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 16:01:29,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:01:29,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 16:01:29,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 16:01:29,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:29,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:29,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:01:29,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:01:29,358 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:01:29,359 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:01:29,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927207280] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:29,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:01:29,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-01-09 16:01:29,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128512382] [2025-01-09 16:01:29,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:29,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:01:29,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:01:29,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:01:29,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:01:29,360 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:01:29,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:29,391 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2025-01-09 16:01:29,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:01:29,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2025-01-09 16:01:29,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:29,393 INFO L225 Difference]: With dead ends: 222 [2025-01-09 16:01:29,395 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 16:01:29,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:01:29,397 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:29,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:01:29,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 16:01:29,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-01-09 16:01:29,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.39) internal successors, (139), 100 states have internal predecessors, (139), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:01:29,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2025-01-09 16:01:29,408 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 112 [2025-01-09 16:01:29,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:29,408 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2025-01-09 16:01:29,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:01:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2025-01-09 16:01:29,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 16:01:29,412 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:29,412 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:29,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:01:29,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:01:29,613 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:29,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:29,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1541488244, now seen corresponding path program 1 times [2025-01-09 16:01:29,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:01:29,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80479968] [2025-01-09 16:01:29,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:29,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:01:29,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 16:01:29,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 16:01:29,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:29,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:29,795 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-01-09 16:01:29,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:01:29,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80479968] [2025-01-09 16:01:29,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80479968] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:01:29,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763815801] [2025-01-09 16:01:29,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:29,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:01:29,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:01:29,801 INFO L229 MonitoredProcess]: Starting monitored process 5 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 16:01:29,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:01:29,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 16:01:29,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 16:01:29,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:29,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:29,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:01:29,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:01:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:01:30,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:01:30,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763815801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:30,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:01:30,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-01-09 16:01:30,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395953589] [2025-01-09 16:01:30,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:30,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:01:30,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:01:30,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:01:30,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:01:30,007 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:01:30,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:30,033 INFO L93 Difference]: Finished difference Result 226 states and 323 transitions. [2025-01-09 16:01:30,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:01:30,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2025-01-09 16:01:30,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:30,036 INFO L225 Difference]: With dead ends: 226 [2025-01-09 16:01:30,036 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 16:01:30,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:01:30,037 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:30,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 601 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:01:30,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 16:01:30,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-01-09 16:01:30,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.3786407766990292) internal successors, (142), 103 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:01:30,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2025-01-09 16:01:30,050 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 112 [2025-01-09 16:01:30,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:30,050 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2025-01-09 16:01:30,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:01:30,050 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2025-01-09 16:01:30,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 16:01:30,053 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:30,053 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:30,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 16:01:30,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:01:30,254 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:30,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:30,254 INFO L85 PathProgramCache]: Analyzing trace with hash 2102831012, now seen corresponding path program 1 times [2025-01-09 16:01:30,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:01:30,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642008182] [2025-01-09 16:01:30,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:30,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:01:30,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 16:01:30,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 16:01:30,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:30,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:01:30,319 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:01:30,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 16:01:30,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 16:01:30,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:30,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:01:30,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:01:30,396 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:01:30,400 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 16:01:30,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:01:30,404 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 16:01:30,465 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:01:30,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:01:30 BoogieIcfgContainer [2025-01-09 16:01:30,471 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:01:30,475 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:01:30,475 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:01:30,475 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:01:30,476 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:01:27" (3/4) ... [2025-01-09 16:01:30,478 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 16:01:30,478 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:01:30,479 INFO L158 Benchmark]: Toolchain (without parser) took 4265.72ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 121.3MB in the beginning and 295.2MB in the end (delta: -174.0MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2025-01-09 16:01:30,479 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:01:30,479 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.71ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 105.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:01:30,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.70ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 101.8MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:01:30,480 INFO L158 Benchmark]: Boogie Preprocessor took 63.27ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 99.0MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:01:30,480 INFO L158 Benchmark]: RCFGBuilder took 588.27ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 68.3MB in the end (delta: 30.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 16:01:30,480 INFO L158 Benchmark]: TraceAbstraction took 3327.48ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 67.5MB in the beginning and 295.3MB in the end (delta: -227.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:01:30,484 INFO L158 Benchmark]: Witness Printer took 3.52ms. Allocated memory is still 352.3MB. Free memory was 295.3MB in the beginning and 295.2MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:01:30,485 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.19ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.71ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 105.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.70ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 101.8MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.27ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 99.0MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 588.27ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 68.3MB in the end (delta: 30.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3327.48ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 67.5MB in the beginning and 295.3MB in the end (delta: -227.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.52ms. Allocated memory is still 352.3MB. Free memory was 295.3MB in the beginning and 295.2MB in the end (delta: 33.1kB). 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 someBinaryArithmeticDOUBLEoperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 95. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1000000000.1, 1, 8.2, -32, 100.5, 25.25, 63.6, 0.0, 0.8, -8, 8, 2, 50, 0 }; [L55] double last_1_WrapperStruct00_var_1_9 = 100.5; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_9=201/2] [L111] isInitial = 1 [L112] FCALL initially() [L114] CALL updateLastVariables() [L104] EXPR WrapperStruct00.var_1_9 [L104] last_1_WrapperStruct00_var_1_9 = WrapperStruct00.var_1_9 [L114] RET updateLastVariables() [L115] CALL updateVariables() [L83] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L84] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L84] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L85] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L86] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L87] EXPR WrapperStruct00.var_1_4 [L87] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L87] EXPR WrapperStruct00.var_1_4 [L87] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L87] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L87] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L87] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L88] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L89] EXPR WrapperStruct00.var_1_12 [L89] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L89] EXPR WrapperStruct00.var_1_12 [L89] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L89] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L89] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L89] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L90] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L91] EXPR WrapperStruct00.var_1_13 [L91] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L91] EXPR WrapperStruct00.var_1_13 [L91] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L91] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L91] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L91] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L92] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L93] EXPR WrapperStruct00.var_1_14 [L93] EXPR WrapperStruct00.var_1_14 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F [L93] EXPR WrapperStruct00.var_1_14 [L93] EXPR WrapperStruct00.var_1_14 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L93] EXPR (WrapperStruct00.var_1_14 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L93] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L93] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L94] WrapperStruct00.var_1_15 = __VERIFIER_nondet_double() [L95] EXPR WrapperStruct00.var_1_15 [L95] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_15 [L95] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L95] EXPR (WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L96] WrapperStruct00.var_1_17 = __VERIFIER_nondet_char() [L97] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L98] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L99] WrapperStruct00.var_1_19 = __VERIFIER_nondet_ushort() [L100] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L101] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L115] RET updateVariables() [L116] CALL step() [L59] COND TRUE 0.625f > last_1_WrapperStruct00_var_1_9 [L60] WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L60] COND FALSE !(WrapperStruct00.var_1_3) [L66] EXPR WrapperStruct00.var_1_17 [L66] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_17 [L67] EXPR WrapperStruct00.var_1_19 [L67] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_19 [L68] EXPR WrapperStruct00.var_1_19 [L68] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_19 [L69] WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L69] COND FALSE !(WrapperStruct00.var_1_3) [L74] EXPR WrapperStruct00.var_1_1 [L74] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L74] COND TRUE WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_1 [L75] EXPR WrapperStruct00.var_1_13 [L75] EXPR WrapperStruct00.var_1_14 [L75] EXPR WrapperStruct00.var_1_15 [L75] WrapperStruct00.var_1_9 = (WrapperStruct00.var_1_13 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)) [L78] EXPR WrapperStruct00.var_1_4 [L78] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L78] COND FALSE !(WrapperStruct00.var_1_4 > WrapperStruct00.var_1_9) [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR (0.625f > last_1_WrapperStruct00_var_1_9) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) [L107] EXPR WrapperStruct00.var_1_1 [L107] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] EXPR ((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4) [L107] EXPR WrapperStruct00.var_1_4 [L107] EXPR ((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] EXPR (0.625f > last_1_WrapperStruct00_var_1_9) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] EXPR ((0.625f > last_1_WrapperStruct00_var_1_9) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4)))))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_5 == ((signed long int) (((((WrapperStruct00.var_1_20) > (-64)) ? (WrapperStruct00.var_1_20) : (-64))) + ((WrapperStruct00.var_1_20 + -2) + WrapperStruct00.var_1_18)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] EXPR (((0.625f > last_1_WrapperStruct00_var_1_9) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4)))))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_5 == ((signed long int) (((((WrapperStruct00.var_1_20) > (-64)) ? (WrapperStruct00.var_1_20) : (-64))) + ((WrapperStruct00.var_1_20 + -2) + WrapperStruct00.var_1_18)))) : 1)) && (WrapperStruct00.var_1_3 ? ((WrapperStruct00.var_1_20 >= ((WrapperStruct00.var_1_18 - WrapperStruct00.var_1_20) * 64)) ? (WrapperStruct00.var_1_9 == ((double) (((((WrapperStruct00.var_1_12) < (50.5)) ? (WrapperStruct00.var_1_12) : (50.5))) - WrapperStruct00.var_1_13))) : 1) : ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_9 == ((double) (WrapperStruct00.var_1_13 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : 1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] EXPR ((((0.625f > last_1_WrapperStruct00_var_1_9) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4)))))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_5 == ((signed long int) (((((WrapperStruct00.var_1_20) > (-64)) ? (WrapperStruct00.var_1_20) : (-64))) + ((WrapperStruct00.var_1_20 + -2) + WrapperStruct00.var_1_18)))) : 1)) && (WrapperStruct00.var_1_3 ? ((WrapperStruct00.var_1_20 >= ((WrapperStruct00.var_1_18 - WrapperStruct00.var_1_20) * 64)) ? (WrapperStruct00.var_1_9 == ((double) (((((WrapperStruct00.var_1_12) < (50.5)) ? (WrapperStruct00.var_1_12) : (50.5))) - WrapperStruct00.var_1_13))) : 1) : ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_9 == ((double) (WrapperStruct00.var_1_13 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : 1))) && (WrapperStruct00.var_1_16 == ((signed char) WrapperStruct00.var_1_17)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] EXPR (((((0.625f > last_1_WrapperStruct00_var_1_9) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4)))))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_5 == ((signed long int) (((((WrapperStruct00.var_1_20) > (-64)) ? (WrapperStruct00.var_1_20) : (-64))) + ((WrapperStruct00.var_1_20 + -2) + WrapperStruct00.var_1_18)))) : 1)) && (WrapperStruct00.var_1_3 ? ((WrapperStruct00.var_1_20 >= ((WrapperStruct00.var_1_18 - WrapperStruct00.var_1_20) * 64)) ? (WrapperStruct00.var_1_9 == ((double) (((((WrapperStruct00.var_1_12) < (50.5)) ? (WrapperStruct00.var_1_12) : (50.5))) - WrapperStruct00.var_1_13))) : 1) : ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_9 == ((double) (WrapperStruct00.var_1_13 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : 1))) && (WrapperStruct00.var_1_16 == ((signed char) WrapperStruct00.var_1_17))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] EXPR ((((((0.625f > last_1_WrapperStruct00_var_1_9) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4)))))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_5 == ((signed long int) (((((WrapperStruct00.var_1_20) > (-64)) ? (WrapperStruct00.var_1_20) : (-64))) + ((WrapperStruct00.var_1_20 + -2) + WrapperStruct00.var_1_18)))) : 1)) && (WrapperStruct00.var_1_3 ? ((WrapperStruct00.var_1_20 >= ((WrapperStruct00.var_1_18 - WrapperStruct00.var_1_20) * 64)) ? (WrapperStruct00.var_1_9 == ((double) (((((WrapperStruct00.var_1_12) < (50.5)) ? (WrapperStruct00.var_1_12) : (50.5))) - WrapperStruct00.var_1_13))) : 1) : ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_9 == ((double) (WrapperStruct00.var_1_13 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : 1))) && (WrapperStruct00.var_1_16 == ((signed char) WrapperStruct00.var_1_17))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((unsigned short int) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107-L108] return ((((((0.625f > last_1_WrapperStruct00_var_1_9) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4)))))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_5 == ((signed long int) (((((WrapperStruct00.var_1_20) > (-64)) ? (WrapperStruct00.var_1_20) : (-64))) + ((WrapperStruct00.var_1_20 + -2) + WrapperStruct00.var_1_18)))) : 1)) && (WrapperStruct00.var_1_3 ? ((WrapperStruct00.var_1_20 >= ((WrapperStruct00.var_1_18 - WrapperStruct00.var_1_20) * 64)) ? (WrapperStruct00.var_1_9 == ((double) (((((WrapperStruct00.var_1_12) < (50.5)) ? (WrapperStruct00.var_1_12) : (50.5))) - WrapperStruct00.var_1_13))) : 1) : ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_9 == ((double) (WrapperStruct00.var_1_13 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : 1))) && (WrapperStruct00.var_1_16 == ((signed char) WrapperStruct00.var_1_17))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((unsigned short int) WrapperStruct00.var_1_19)) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 5, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 1664 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1045 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 58 IncrementalHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 619 mSDtfsCounter, 58 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 470 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=4, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1008 NumberOfCodeBlocks, 1008 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 888 ConstructedInterpolants, 0 QuantifiedInterpolants, 938 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1697 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 1650/1760 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 16:01:30,515 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_variablewrapping_wrapper-s_file-65.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 2dc4b4561b119f2d441fb605148029621181083992b9a4c5c6ca30ee08fd9eac --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:01:32,518 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:01:32,603 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 16:01:32,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:01:32,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:01:32,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:01:32,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:01:32,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:01:32,650 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:01:32,650 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:01:32,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:01:32,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:01:32,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:01:32,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:01:32,652 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:01:32,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:01:32,652 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:01:32,652 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:01:32,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:01:32,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:01:32,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:01:32,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:01:32,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:01:32,653 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 16:01:32,653 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 16:01:32,653 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 16:01:32,653 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:01:32,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:01:32,653 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:01:32,653 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:01:32,653 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:01:32,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:01:32,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:01:32,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:01:32,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:01:32,654 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:01:32,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:01:32,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:01:32,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:01:32,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:01:32,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:01:32,662 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:01:32,662 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:01:32,662 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:01:32,663 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 16:01:32,663 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 16:01:32,663 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:01:32,663 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:01:32,663 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:01:32,663 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:01:32,663 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 -> 2dc4b4561b119f2d441fb605148029621181083992b9a4c5c6ca30ee08fd9eac [2025-01-09 16:01:32,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:01:32,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:01:32,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:01:32,856 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:01:32,856 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:01:32,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-65.i [2025-01-09 16:01:34,078 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0439f20db/dc41cf5c7e0b438e973232bce068656a/FLAG7cc611eb0 [2025-01-09 16:01:34,308 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:01:34,308 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-65.i [2025-01-09 16:01:34,317 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0439f20db/dc41cf5c7e0b438e973232bce068656a/FLAG7cc611eb0 [2025-01-09 16:01:34,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0439f20db/dc41cf5c7e0b438e973232bce068656a [2025-01-09 16:01:34,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:01:34,336 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:01:34,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:01:34,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:01:34,341 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:01:34,343 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:01:34" (1/1) ... [2025-01-09 16:01:34,344 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@522cb537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:34, skipping insertion in model container [2025-01-09 16:01:34,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:01:34" (1/1) ... [2025-01-09 16:01:34,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:01:34,467 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_variablewrapping_wrapper-s_file-65.i[916,929] [2025-01-09 16:01:34,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:01:34,532 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:01:34,540 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_variablewrapping_wrapper-s_file-65.i[916,929] [2025-01-09 16:01:34,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:01:34,591 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:01:34,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:34 WrapperNode [2025-01-09 16:01:34,591 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:01:34,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:01:34,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:01:34,592 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:01:34,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:34" (1/1) ... [2025-01-09 16:01:34,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:34" (1/1) ... [2025-01-09 16:01:34,635 INFO L138 Inliner]: procedures = 40, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 477 [2025-01-09 16:01:34,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:01:34,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:01:34,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:01:34,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:01:34,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:34" (1/1) ... [2025-01-09 16:01:34,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:34" (1/1) ... [2025-01-09 16:01:34,650 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:34" (1/1) ... [2025-01-09 16:01:34,661 INFO L175 MemorySlicer]: Split 124 memory accesses to 2 slices as follows [2, 122]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 31 writes are split as follows [0, 31]. [2025-01-09 16:01:34,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:34" (1/1) ... [2025-01-09 16:01:34,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:34" (1/1) ... [2025-01-09 16:01:34,674 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:34" (1/1) ... [2025-01-09 16:01:34,675 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:34" (1/1) ... [2025-01-09 16:01:34,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:34" (1/1) ... [2025-01-09 16:01:34,680 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:34" (1/1) ... [2025-01-09 16:01:34,681 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:34" (1/1) ... [2025-01-09 16:01:34,684 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:01:34,685 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:01:34,685 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:01:34,685 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:01:34,686 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:34" (1/1) ... [2025-01-09 16:01:34,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:01:34,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:01:34,720 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 16:01:34,722 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 16:01:34,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:01:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 16:01:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 16:01:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-01-09 16:01:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-01-09 16:01:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 16:01:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 16:01:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 16:01:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 16:01:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 16:01:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 16:01:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 16:01:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 16:01:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 16:01:34,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 16:01:34,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 16:01:34,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 16:01:34,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-01-09 16:01:34,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-01-09 16:01:34,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 16:01:34,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 16:01:34,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-01-09 16:01:34,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-01-09 16:01:34,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-01-09 16:01:34,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-01-09 16:01:34,738 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:01:34,738 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:01:34,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-01-09 16:01:34,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-01-09 16:01:34,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:01:34,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:01:34,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 16:01:34,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 16:01:34,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 16:01:34,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 16:01:34,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 16:01:34,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 16:01:34,828 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:01:34,829 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:01:37,984 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2025-01-09 16:01:37,985 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:01:38,001 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:01:38,001 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:01:38,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:01:38 BoogieIcfgContainer [2025-01-09 16:01:38,001 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:01:38,008 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:01:38,008 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:01:38,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:01:38,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:01:34" (1/3) ... [2025-01-09 16:01:38,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f099f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:01:38, skipping insertion in model container [2025-01-09 16:01:38,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:34" (2/3) ... [2025-01-09 16:01:38,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f099f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:01:38, skipping insertion in model container [2025-01-09 16:01:38,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:01:38" (3/3) ... [2025-01-09 16:01:38,016 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-65.i [2025-01-09 16:01:38,036 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:01:38,040 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-65.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:01:38,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:01:38,099 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;@1e12f294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:01:38,099 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:01:38,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:01:38,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 16:01:38,109 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:38,109 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:38,109 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:38,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:38,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1645537726, now seen corresponding path program 1 times [2025-01-09 16:01:38,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:01:38,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898647776] [2025-01-09 16:01:38,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:38,125 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 16:01:38,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:01:38,128 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 16:01:38,129 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 16:01:38,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 16:01:38,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 16:01:38,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:38,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:38,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:01:38,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:01:38,429 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-01-09 16:01:38,429 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:01:38,429 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:01:38,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898647776] [2025-01-09 16:01:38,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898647776] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:38,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:01:38,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:01:38,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594506335] [2025-01-09 16:01:38,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:38,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:01:38,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:01:38,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:01:38,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:01:38,446 INFO L87 Difference]: Start difference. First operand has 112 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:01:38,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:38,497 INFO L93 Difference]: Finished difference Result 218 states and 334 transitions. [2025-01-09 16:01:38,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:01:38,498 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-01-09 16:01:38,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:38,503 INFO L225 Difference]: With dead ends: 218 [2025-01-09 16:01:38,503 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 16:01:38,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 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 16:01:38,507 INFO L435 NwaCegarLoop]: 157 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, 157 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 16:01:38,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:01:38,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 16:01:38,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-01-09 16:01:38,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:01:38,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-01-09 16:01:38,539 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 112 [2025-01-09 16:01:38,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:38,539 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-01-09 16:01:38,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:01:38,540 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-01-09 16:01:38,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 16:01:38,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:38,543 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:38,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-01-09 16:01:38,747 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 16:01:38,747 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:38,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:38,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1620700292, now seen corresponding path program 1 times [2025-01-09 16:01:38,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:01:38,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857824009] [2025-01-09 16:01:38,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:38,749 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 16:01:38,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:01:38,751 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 16:01:38,752 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 16:01:38,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 16:01:39,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 16:01:39,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:39,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:39,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:01:39,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:01:39,102 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-09 16:01:39,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:01:39,102 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:01:39,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857824009] [2025-01-09 16:01:39,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1857824009] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:39,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:01:39,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:01:39,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29137018] [2025-01-09 16:01:39,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:39,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:01:39,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:01:39,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:01:39,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:01:39,105 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:01:39,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:39,172 INFO L93 Difference]: Finished difference Result 217 states and 314 transitions. [2025-01-09 16:01:39,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:01:39,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-01-09 16:01:39,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:39,174 INFO L225 Difference]: With dead ends: 217 [2025-01-09 16:01:39,174 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 16:01:39,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:01:39,175 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:39,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:01:39,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 16:01:39,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-01-09 16:01:39,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:01:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2025-01-09 16:01:39,190 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 112 [2025-01-09 16:01:39,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:39,190 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2025-01-09 16:01:39,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:01:39,191 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2025-01-09 16:01:39,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 16:01:39,196 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:39,197 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:39,208 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 16:01:39,397 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 16:01:39,398 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:39,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:39,398 INFO L85 PathProgramCache]: Analyzing trace with hash 337874494, now seen corresponding path program 1 times [2025-01-09 16:01:39,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:01:39,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847138389] [2025-01-09 16:01:39,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:39,399 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 16:01:39,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:01:39,401 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 16:01:39,402 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 16:01:39,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 16:01:39,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 16:01:39,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:39,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:39,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:01:39,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:01:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:01:39,735 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:01:39,735 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:01:39,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847138389] [2025-01-09 16:01:39,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847138389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:39,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:01:39,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:01:39,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22719766] [2025-01-09 16:01:39,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:39,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:01:39,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:01:39,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:01:39,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:01:39,736 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:01:39,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:39,774 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2025-01-09 16:01:39,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:01:39,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2025-01-09 16:01:39,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:39,775 INFO L225 Difference]: With dead ends: 222 [2025-01-09 16:01:39,775 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 16:01:39,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:01:39,776 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:39,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 601 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:01:39,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 16:01:39,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-01-09 16:01:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.386138613861386) internal successors, (140), 101 states have internal predecessors, (140), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:01:39,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2025-01-09 16:01:39,782 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 112 [2025-01-09 16:01:39,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:39,782 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2025-01-09 16:01:39,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:01:39,783 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2025-01-09 16:01:39,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 16:01:39,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:39,784 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:39,796 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 16:01:39,988 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 16:01:39,988 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:39,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:39,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1920285616, now seen corresponding path program 1 times [2025-01-09 16:01:39,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:01:39,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348393310] [2025-01-09 16:01:39,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:39,991 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 16:01:39,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:01:39,993 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 16:01:39,995 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 16:01:40,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 16:01:40,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 16:01:40,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:40,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:40,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 16:01:40,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:01:40,347 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:01:40,347 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:01:40,347 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:01:40,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348393310] [2025-01-09 16:01:40,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348393310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:40,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:01:40,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:01:40,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962058646] [2025-01-09 16:01:40,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:40,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:01:40,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:01:40,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:01:40,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:01:40,349 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:01:42,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:01:44,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:01:45,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:01:46,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:46,012 INFO L93 Difference]: Finished difference Result 266 states and 378 transitions. [2025-01-09 16:01:46,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:01:46,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2025-01-09 16:01:46,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:46,014 INFO L225 Difference]: With dead ends: 266 [2025-01-09 16:01:46,014 INFO L226 Difference]: Without dead ends: 155 [2025-01-09 16:01:46,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:01:46,016 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 59 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:46,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 276 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-01-09 16:01:46,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-09 16:01:46,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 126. [2025-01-09 16:01:46,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 113 states have internal predecessors, (157), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:01:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 179 transitions. [2025-01-09 16:01:46,028 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 179 transitions. Word has length 112 [2025-01-09 16:01:46,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:46,028 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 179 transitions. [2025-01-09 16:01:46,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:01:46,028 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 179 transitions. [2025-01-09 16:01:46,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 16:01:46,029 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:46,029 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:46,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 16:01:46,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:01:46,230 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:46,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:46,231 INFO L85 PathProgramCache]: Analyzing trace with hash -2124220216, now seen corresponding path program 1 times [2025-01-09 16:01:46,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:01:46,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444202193] [2025-01-09 16:01:46,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:46,231 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 16:01:46,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:01:46,234 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:01:46,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 16:01:46,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 16:01:46,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 16:01:46,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:46,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:46,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:01:46,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:01:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:01:46,542 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:01:46,542 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:01:46,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444202193] [2025-01-09 16:01:46,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444202193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:46,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:01:46,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:01:46,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088343243] [2025-01-09 16:01:46,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:46,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:01:46,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:01:46,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:01:46,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:01:46,544 INFO L87 Difference]: Start difference. First operand 126 states and 179 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:01:46,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:46,585 INFO L93 Difference]: Finished difference Result 254 states and 362 transitions. [2025-01-09 16:01:46,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:01:46,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113 [2025-01-09 16:01:46,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:46,586 INFO L225 Difference]: With dead ends: 254 [2025-01-09 16:01:46,587 INFO L226 Difference]: Without dead ends: 131 [2025-01-09 16:01:46,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:01:46,588 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:46,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 592 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:01:46,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-01-09 16:01:46,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2025-01-09 16:01:46,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 117 states have (on average 1.376068376068376) internal successors, (161), 117 states have internal predecessors, (161), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:01:46,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 183 transitions. [2025-01-09 16:01:46,593 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 183 transitions. Word has length 113 [2025-01-09 16:01:46,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:46,593 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 183 transitions. [2025-01-09 16:01:46,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:01:46,593 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 183 transitions. [2025-01-09 16:01:46,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 16:01:46,594 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:46,595 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:46,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-01-09 16:01:46,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:01:46,796 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:46,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:46,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1444161846, now seen corresponding path program 1 times [2025-01-09 16:01:46,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:01:46,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973708995] [2025-01-09 16:01:46,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:46,797 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 16:01:46,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:01:46,799 INFO L229 MonitoredProcess]: Starting monitored process 7 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 16:01:46,800 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 (7)] Waiting until timeout for monitored process [2025-01-09 16:01:46,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 16:01:47,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 16:01:47,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:47,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:47,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:01:47,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:01:47,125 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:01:47,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:01:47,126 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:01:47,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973708995] [2025-01-09 16:01:47,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973708995] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:47,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:01:47,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:01:47,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993463228] [2025-01-09 16:01:47,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:47,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:01:47,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:01:47,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:01:47,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:01:47,128 INFO L87 Difference]: Start difference. First operand 130 states and 183 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:01:47,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:47,204 INFO L93 Difference]: Finished difference Result 262 states and 370 transitions. [2025-01-09 16:01:47,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:01:47,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113 [2025-01-09 16:01:47,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:47,206 INFO L225 Difference]: With dead ends: 262 [2025-01-09 16:01:47,206 INFO L226 Difference]: Without dead ends: 135 [2025-01-09 16:01:47,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:01:47,207 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:47,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 869 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:01:47,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-01-09 16:01:47,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2025-01-09 16:01:47,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 121 states have (on average 1.3636363636363635) internal successors, (165), 121 states have internal predecessors, (165), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:01:47,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 187 transitions. [2025-01-09 16:01:47,212 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 187 transitions. Word has length 113 [2025-01-09 16:01:47,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:47,212 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 187 transitions. [2025-01-09 16:01:47,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:01:47,213 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 187 transitions. [2025-01-09 16:01:47,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 16:01:47,214 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:47,214 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:47,223 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 (7)] Ended with exit code 0 [2025-01-09 16:01:47,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 16:01:47,416 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:47,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:47,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1442314804, now seen corresponding path program 1 times [2025-01-09 16:01:47,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:01:47,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805853841] [2025-01-09 16:01:47,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:47,417 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 16:01:47,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:01:47,422 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:01:47,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-01-09 16:01:47,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 16:01:47,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 16:01:47,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:47,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:47,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:01:47,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:01:47,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:01:47,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-01-09 16:01:47,908 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-09 16:01:47,908 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:01:47,908 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:01:47,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805853841] [2025-01-09 16:01:47,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805853841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:47,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:01:47,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:01:47,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848502694] [2025-01-09 16:01:47,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:47,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:01:47,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:01:47,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:01:47,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:01:47,909 INFO L87 Difference]: Start difference. First operand 134 states and 187 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:01:49,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:01:50,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:01:52,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:01:52,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:52,540 INFO L93 Difference]: Finished difference Result 265 states and 371 transitions. [2025-01-09 16:01:52,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:01:52,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 113 [2025-01-09 16:01:52,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:52,542 INFO L225 Difference]: With dead ends: 265 [2025-01-09 16:01:52,542 INFO L226 Difference]: Without dead ends: 134 [2025-01-09 16:01:52,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:01:52,543 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 137 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:52,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 383 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-01-09 16:01:52,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-09 16:01:52,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2025-01-09 16:01:52,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 119 states have (on average 1.361344537815126) internal successors, (162), 119 states have internal predecessors, (162), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:01:52,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 184 transitions. [2025-01-09 16:01:52,561 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 184 transitions. Word has length 113 [2025-01-09 16:01:52,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:52,561 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 184 transitions. [2025-01-09 16:01:52,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:01:52,561 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 184 transitions. [2025-01-09 16:01:52,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 16:01:52,562 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:52,562 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:52,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-01-09 16:01:52,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:01:52,762 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:52,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:52,763 INFO L85 PathProgramCache]: Analyzing trace with hash -954413900, now seen corresponding path program 1 times [2025-01-09 16:01:52,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:01:52,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1072117517] [2025-01-09 16:01:52,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:52,763 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 16:01:52,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:01:52,765 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:01:52,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-01-09 16:01:52,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 16:01:53,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 16:01:53,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:53,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:53,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 16:01:53,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:01:53,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:01:53,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 64 [2025-01-09 16:01:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 12 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-09 16:01:53,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:01:53,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:01:53,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 1 [2025-01-09 16:01:53,630 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-01-09 16:01:53,630 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:01:53,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1072117517] [2025-01-09 16:01:53,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1072117517] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:01:53,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:01:53,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2025-01-09 16:01:53,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493658964] [2025-01-09 16:01:53,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 16:01:53,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:01:53,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:01:53,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:01:53,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:01:53,632 INFO L87 Difference]: Start difference. First operand 132 states and 184 transitions. Second operand has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 12 states have internal predecessors, (89), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-01-09 16:01:56,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:01:58,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:02:04,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:02:04,440 INFO L93 Difference]: Finished difference Result 274 states and 380 transitions. [2025-01-09 16:02:04,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:02:04,441 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 12 states have internal predecessors, (89), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 115 [2025-01-09 16:02:04,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:02:04,443 INFO L225 Difference]: With dead ends: 274 [2025-01-09 16:02:04,443 INFO L226 Difference]: Without dead ends: 134 [2025-01-09 16:02:04,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-01-09 16:02:04,444 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 138 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:02:04,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 630 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2025-01-09 16:02:04,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-09 16:02:04,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2025-01-09 16:02:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 119 states have (on average 1.3445378151260505) internal successors, (160), 119 states have internal predecessors, (160), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:02:04,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 182 transitions. [2025-01-09 16:02:04,455 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 182 transitions. Word has length 115 [2025-01-09 16:02:04,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:02:04,455 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 182 transitions. [2025-01-09 16:02:04,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 12 states have internal predecessors, (89), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-01-09 16:02:04,455 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 182 transitions. [2025-01-09 16:02:04,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 16:02:04,456 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:04,456 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:02:04,472 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 (9)] Ended with exit code 0 [2025-01-09 16:02:04,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:02:04,667 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:04,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:04,669 INFO L85 PathProgramCache]: Analyzing trace with hash -183680334, now seen corresponding path program 1 times [2025-01-09 16:02:04,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:02:04,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017300131] [2025-01-09 16:02:04,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:04,669 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 16:02:04,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:02:04,671 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:02:04,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-01-09 16:02:04,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 16:02:04,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 16:02:04,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:04,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:05,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:02:05,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:02:05,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:05,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-01-09 16:02:05,181 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-01-09 16:02:05,182 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:02:05,182 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:02:05,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017300131] [2025-01-09 16:02:05,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017300131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:02:05,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:02:05,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:02:05,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440448872] [2025-01-09 16:02:05,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:02:05,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:02:05,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:02:05,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:02:05,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:02:05,184 INFO L87 Difference]: Start difference. First operand 132 states and 182 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:02:07,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:02:09,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:02:11,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:02:11,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:02:11,297 INFO L93 Difference]: Finished difference Result 262 states and 362 transitions. [2025-01-09 16:02:11,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:02:11,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 115 [2025-01-09 16:02:11,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:02:11,298 INFO L225 Difference]: With dead ends: 262 [2025-01-09 16:02:11,299 INFO L226 Difference]: Without dead ends: 133 [2025-01-09 16:02:11,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:02:11,299 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 126 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:02:11,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 371 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-01-09 16:02:11,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-09 16:02:11,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2025-01-09 16:02:11,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 119 states have (on average 1.3361344537815125) internal successors, (159), 119 states have internal predecessors, (159), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:02:11,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 181 transitions. [2025-01-09 16:02:11,308 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 181 transitions. Word has length 115 [2025-01-09 16:02:11,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:02:11,309 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 181 transitions. [2025-01-09 16:02:11,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:02:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 181 transitions. [2025-01-09 16:02:11,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 16:02:11,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:11,310 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:02:11,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2025-01-09 16:02:11,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:02:11,511 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:11,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:11,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1083639564, now seen corresponding path program 1 times [2025-01-09 16:02:11,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:02:11,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665817319] [2025-01-09 16:02:11,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:11,512 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 16:02:11,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:02:11,514 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:02:11,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-01-09 16:02:11,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 16:02:11,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 16:02:11,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:11,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:11,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:02:11,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:02:12,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:12,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 67 [2025-01-09 16:02:12,108 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 16:02:12,108 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:02:12,108 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:02:12,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665817319] [2025-01-09 16:02:12,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665817319] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:02:12,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:02:12,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:02:12,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358256236] [2025-01-09 16:02:12,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:02:12,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:02:12,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:02:12,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:02:12,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:02:12,109 INFO L87 Difference]: Start difference. First operand 132 states and 181 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:02:16,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:02:17,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:02:19,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:02:19,912 INFO L93 Difference]: Finished difference Result 262 states and 360 transitions. [2025-01-09 16:02:19,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:02:19,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 117 [2025-01-09 16:02:19,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:02:19,914 INFO L225 Difference]: With dead ends: 262 [2025-01-09 16:02:19,914 INFO L226 Difference]: Without dead ends: 133 [2025-01-09 16:02:19,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:02:19,915 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 117 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2025-01-09 16:02:19,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 367 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 1 Unknown, 0 Unchecked, 7.7s Time] [2025-01-09 16:02:19,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-09 16:02:19,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2025-01-09 16:02:19,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 119 states have internal predecessors, (158), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:02:19,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 180 transitions. [2025-01-09 16:02:19,923 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 180 transitions. Word has length 117 [2025-01-09 16:02:19,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:02:19,924 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 180 transitions. [2025-01-09 16:02:19,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:02:19,924 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 180 transitions. [2025-01-09 16:02:19,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 16:02:19,925 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:19,925 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:02:19,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-01-09 16:02:20,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:02:20,125 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:20,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:20,126 INFO L85 PathProgramCache]: Analyzing trace with hash -571044366, now seen corresponding path program 1 times [2025-01-09 16:02:20,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:02:20,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095661482] [2025-01-09 16:02:20,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:20,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:02:20,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:02:20,129 INFO L229 MonitoredProcess]: Starting monitored process 12 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 16:02:20,131 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 (12)] Waiting until timeout for monitored process [2025-01-09 16:02:20,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 16:02:20,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 16:02:20,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:20,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:20,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:02:20,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:02:20,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:20,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-01-09 16:02:20,623 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 16:02:20,623 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:02:20,623 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:02:20,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095661482] [2025-01-09 16:02:20,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095661482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:02:20,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:02:20,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:02:20,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083995995] [2025-01-09 16:02:20,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:02:20,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:02:20,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:02:20,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:02:20,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:02:20,624 INFO L87 Difference]: Start difference. First operand 132 states and 180 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:02:22,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:02:23,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:02:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:02:25,664 INFO L93 Difference]: Finished difference Result 262 states and 358 transitions. [2025-01-09 16:02:25,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:02:25,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 119 [2025-01-09 16:02:25,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:02:25,666 INFO L225 Difference]: With dead ends: 262 [2025-01-09 16:02:25,666 INFO L226 Difference]: Without dead ends: 133 [2025-01-09 16:02:25,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:02:25,667 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 108 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:02:25,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 361 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-01-09 16:02:25,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-09 16:02:25,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2025-01-09 16:02:25,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 119 states have (on average 1.319327731092437) internal successors, (157), 119 states have internal predecessors, (157), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:02:25,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 179 transitions. [2025-01-09 16:02:25,673 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 179 transitions. Word has length 119 [2025-01-09 16:02:25,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:02:25,673 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 179 transitions. [2025-01-09 16:02:25,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:02:25,675 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 179 transitions. [2025-01-09 16:02:25,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 16:02:25,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:25,676 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:02:25,691 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 (12)] Ended with exit code 0 [2025-01-09 16:02:25,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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 16:02:25,877 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:25,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:25,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1149134772, now seen corresponding path program 1 times [2025-01-09 16:02:25,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:02:25,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1072496891] [2025-01-09 16:02:25,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:25,878 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 16:02:25,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:02:25,881 INFO L229 MonitoredProcess]: Starting monitored process 13 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 16:02:25,882 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 (13)] Waiting until timeout for monitored process [2025-01-09 16:02:25,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 16:02:26,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 16:02:26,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:26,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:26,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 16:02:26,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:02:26,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 49 [2025-01-09 16:02:26,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:26,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 44 [2025-01-09 16:02:26,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:26,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 46 [2025-01-09 16:02:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:02:26,561 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:02:26,562 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:02:26,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1072496891] [2025-01-09 16:02:26,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1072496891] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:02:26,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:02:26,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:02:26,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191395299] [2025-01-09 16:02:26,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:02:26,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:02:26,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:02:26,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:02:26,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:02:26,563 INFO L87 Difference]: Start difference. First operand 132 states and 179 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:02:27,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:02:30,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:02:33,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:02:38,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:02:38,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:02:38,616 INFO L93 Difference]: Finished difference Result 329 states and 443 transitions. [2025-01-09 16:02:38,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:02:38,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 121 [2025-01-09 16:02:38,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:02:38,618 INFO L225 Difference]: With dead ends: 329 [2025-01-09 16:02:38,618 INFO L226 Difference]: Without dead ends: 200 [2025-01-09 16:02:38,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:02:38,618 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 69 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:02:38,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 608 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 12.0s Time] [2025-01-09 16:02:38,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-01-09 16:02:38,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2025-01-09 16:02:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 181 states have (on average 1.3149171270718232) internal successors, (238), 182 states have internal predecessors, (238), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 16:02:38,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 264 transitions. [2025-01-09 16:02:38,624 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 264 transitions. Word has length 121 [2025-01-09 16:02:38,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:02:38,624 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 264 transitions. [2025-01-09 16:02:38,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:02:38,625 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 264 transitions. [2025-01-09 16:02:38,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 16:02:38,625 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:38,625 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:02:38,638 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 (13)] Ended with exit code 0 [2025-01-09 16:02:38,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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 16:02:38,826 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:38,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:38,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1571836598, now seen corresponding path program 1 times [2025-01-09 16:02:38,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:02:38,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029717504] [2025-01-09 16:02:38,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:38,827 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 16:02:38,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:02:38,832 INFO L229 MonitoredProcess]: Starting monitored process 14 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 16:02:38,834 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 (14)] Waiting until timeout for monitored process [2025-01-09 16:02:38,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 16:02:39,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 16:02:39,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:39,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:39,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 16:02:39,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:02:39,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:02:39,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2025-01-09 16:02:41,827 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_116| (_ BitVec 64))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_116|) (select (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|) (bvadd (_ bv25 32) |c_~#WrapperStruct00~0.offset|)))) is different from true [2025-01-09 16:02:41,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2025-01-09 16:02:45,901 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (and (exists ((|v_skolemized_q#valueAsBitvector_116| (_ BitVec 64))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_116|) (select .cse0 (bvadd (_ bv25 32) |c_~#WrapperStruct00~0.offset|)))) (exists ((|v_skolemized_q#valueAsBitvector_117| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_117|) (select .cse0 (bvadd (_ bv33 32) |c_~#WrapperStruct00~0.offset|))) (= (select .cse0 (bvadd (_ bv29 32) |c_~#WrapperStruct00~0.offset|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_117|)))))) is different from true [2025-01-09 16:02:46,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:46,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 40 [2025-01-09 16:02:46,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:46,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 40 [2025-01-09 16:02:46,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:46,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2025-01-09 16:02:46,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:46,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 63 [2025-01-09 16:02:46,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:46,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 141 treesize of output 114 [2025-01-09 16:02:46,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:46,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 167 treesize of output 109 [2025-01-09 16:02:47,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:47,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 156 treesize of output 109 [2025-01-09 16:02:47,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:47,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 175 treesize of output 67 [2025-01-09 16:02:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 76 not checked. [2025-01-09 16:02:47,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:02:47,804 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:02:47,804 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:02:47,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029717504] [2025-01-09 16:02:47,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029717504] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:02:47,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:02:47,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 18 [2025-01-09 16:02:47,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938834978] [2025-01-09 16:02:47,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:02:47,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:02:47,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:02:47,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:02:47,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=197, Unknown=2, NotChecked=58, Total=306 [2025-01-09 16:02:47,805 INFO L87 Difference]: Start difference. First operand 197 states and 264 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:02:50,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:02:56,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:02:57,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:02:58,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:02:58,322 INFO L93 Difference]: Finished difference Result 407 states and 542 transitions. [2025-01-09 16:02:58,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:02:58,323 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 121 [2025-01-09 16:02:58,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:02:58,325 INFO L225 Difference]: With dead ends: 407 [2025-01-09 16:02:58,325 INFO L226 Difference]: Without dead ends: 213 [2025-01-09 16:02:58,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=72, Invalid=354, Unknown=2, NotChecked=78, Total=506 [2025-01-09 16:02:58,325 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 76 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:02:58,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 822 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2025-01-09 16:02:58,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-01-09 16:02:58,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 198. [2025-01-09 16:02:58,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 182 states have (on average 1.3131868131868132) internal successors, (239), 183 states have internal predecessors, (239), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 16:02:58,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 265 transitions. [2025-01-09 16:02:58,333 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 265 transitions. Word has length 121 [2025-01-09 16:02:58,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:02:58,333 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 265 transitions. [2025-01-09 16:02:58,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:02:58,334 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 265 transitions. [2025-01-09 16:02:58,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 16:02:58,334 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:58,334 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:02:58,351 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 (14)] Ended with exit code 0 [2025-01-09 16:02:58,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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 16:02:58,539 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:58,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:58,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1702062344, now seen corresponding path program 1 times [2025-01-09 16:02:58,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:02:58,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71069773] [2025-01-09 16:02:58,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:58,541 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 16:02:58,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:02:58,544 INFO L229 MonitoredProcess]: Starting monitored process 15 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 16:02:58,546 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 (15)] Waiting until timeout for monitored process [2025-01-09 16:02:58,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 16:02:59,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 16:02:59,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:59,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:59,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 16:02:59,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:02:59,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:02:59,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 44 [2025-01-09 16:03:03,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:03,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 67