./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-78.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-78.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 cc60dbcb40c1b152bb26088ff001d223dce864841f907f99b254c3b58eb0aa47 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:02:58,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:02:58,197 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:02:58,202 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:02:58,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:02:58,224 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:02:58,227 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:02:58,227 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:02:58,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:02:58,227 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:02:58,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:02:58,227 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:02:58,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:02:58,228 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:02:58,228 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:02:58,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:02:58,228 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:02:58,228 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:02:58,228 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:02:58,228 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:02:58,228 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:02:58,228 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:02:58,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:02:58,229 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:02:58,229 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:02:58,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:02:58,229 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:02:58,229 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:02:58,229 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:02:58,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:02:58,229 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:02:58,229 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:02:58,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:02:58,230 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:02:58,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:02:58,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:02:58,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:02:58,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:02:58,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:02:58,230 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:02:58,230 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:02:58,230 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:02:58,230 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:02:58,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:02:58,230 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:02:58,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:02:58,231 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:02:58,231 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:02:58,231 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 -> cc60dbcb40c1b152bb26088ff001d223dce864841f907f99b254c3b58eb0aa47 [2025-01-09 16:02:58,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:02:58,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:02:58,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:02:58,466 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:02:58,466 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:02:58,467 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-78.i [2025-01-09 16:02:59,605 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f749c54ed/72dac3edb5aa41d2bb9bcb28c0a7bcd1/FLAG4ca3a1a8c [2025-01-09 16:02:59,848 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:02:59,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-78.i [2025-01-09 16:02:59,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f749c54ed/72dac3edb5aa41d2bb9bcb28c0a7bcd1/FLAG4ca3a1a8c [2025-01-09 16:02:59,869 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f749c54ed/72dac3edb5aa41d2bb9bcb28c0a7bcd1 [2025-01-09 16:02:59,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:02:59,872 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:02:59,873 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:02:59,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:02:59,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:02:59,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:02:59" (1/1) ... [2025-01-09 16:02:59,877 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4df3a61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:59, skipping insertion in model container [2025-01-09 16:02:59,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:02:59" (1/1) ... [2025-01-09 16:02:59,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:02:59,978 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-78.i[916,929] [2025-01-09 16:03:00,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:03:00,019 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:03:00,026 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-78.i[916,929] [2025-01-09 16:03:00,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:03:00,084 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:03:00,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:00 WrapperNode [2025-01-09 16:03:00,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:03:00,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:03:00,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:03:00,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:03:00,091 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:03:00" (1/1) ... [2025-01-09 16:03:00,102 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:03:00" (1/1) ... [2025-01-09 16:03:00,141 INFO L138 Inliner]: procedures = 30, calls = 132, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 410 [2025-01-09 16:03:00,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:03:00,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:03:00,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:03:00,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:03:00,150 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:00" (1/1) ... [2025-01-09 16:03:00,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:00" (1/1) ... [2025-01-09 16:03:00,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:00" (1/1) ... [2025-01-09 16:03:00,167 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 16:03:00,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:00" (1/1) ... [2025-01-09 16:03:00,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:00" (1/1) ... [2025-01-09 16:03:00,183 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:00" (1/1) ... [2025-01-09 16:03:00,187 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:00" (1/1) ... [2025-01-09 16:03:00,190 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:00" (1/1) ... [2025-01-09 16:03:00,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:00" (1/1) ... [2025-01-09 16:03:00,200 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:00" (1/1) ... [2025-01-09 16:03:00,205 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:03:00,206 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:03:00,206 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:03:00,206 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:03:00,207 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:00" (1/1) ... [2025-01-09 16:03:00,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:03:00,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:03:00,234 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:03:00,235 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:03:00,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:03:00,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 16:03:00,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 16:03:00,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 16:03:00,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 16:03:00,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 16:03:00,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 16:03:00,251 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:03:00,251 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:03:00,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 16:03:00,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:03:00,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:03:00,326 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:03:00,328 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:03:00,649 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2025-01-09 16:03:00,650 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:03:00,657 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:03:00,657 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:03:00,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:00 BoogieIcfgContainer [2025-01-09 16:03:00,658 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:03:00,659 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:03:00,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:03:00,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:03:00,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:02:59" (1/3) ... [2025-01-09 16:03:00,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2744b160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:03:00, skipping insertion in model container [2025-01-09 16:03:00,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:00" (2/3) ... [2025-01-09 16:03:00,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2744b160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:03:00, skipping insertion in model container [2025-01-09 16:03:00,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:00" (3/3) ... [2025-01-09 16:03:00,666 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-78.i [2025-01-09 16:03:00,677 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:03:00,679 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-78.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:03:00,721 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:03:00,729 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;@1e21a038, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:03:00,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:03:00,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 80 states have internal predecessors, (114), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 16:03:00,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 16:03:00,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:00,738 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:00,739 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:00,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:00,742 INFO L85 PathProgramCache]: Analyzing trace with hash -622204248, now seen corresponding path program 1 times [2025-01-09 16:03:00,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:00,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178818244] [2025-01-09 16:03:00,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:00,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:00,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 16:03:00,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 16:03:00,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:00,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:01,015 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-01-09 16:03:01,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:01,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178818244] [2025-01-09 16:03:01,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178818244] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:03:01,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88574316] [2025-01-09 16:03:01,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:01,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:03:01,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:03:01,022 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:03:01,024 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:03:01,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 16:03:01,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 16:03:01,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:01,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:01,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:03:01,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:01,196 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-01-09 16:03:01,196 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:01,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88574316] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:01,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:03:01,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 16:03:01,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461887146] [2025-01-09 16:03:01,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:01,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:03:01,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:01,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:03:01,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:03:01,223 INFO L87 Difference]: Start difference. First operand has 92 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 80 states have internal predecessors, (114), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 16:03:01,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:01,239 INFO L93 Difference]: Finished difference Result 178 states and 273 transitions. [2025-01-09 16:03:01,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:03:01,240 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2025-01-09 16:03:01,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:01,244 INFO L225 Difference]: With dead ends: 178 [2025-01-09 16:03:01,244 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 16:03:01,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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:03:01,248 INFO L435 NwaCegarLoop]: 129 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, 129 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:03:01,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:03:01,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 16:03:01,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-01-09 16:03:01,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 16:03:01,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2025-01-09 16:03:01,271 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 98 [2025-01-09 16:03:01,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:01,271 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 129 transitions. [2025-01-09 16:03:01,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 16:03:01,272 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions. [2025-01-09 16:03:01,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 16:03:01,274 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:01,274 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:01,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:03:01,475 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:03:01,475 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:01,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:01,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1889728332, now seen corresponding path program 1 times [2025-01-09 16:03:01,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:01,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792874730] [2025-01-09 16:03:01,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:01,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:01,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 16:03:01,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 16:03:01,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:01,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:01,883 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-01-09 16:03:01,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:01,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792874730] [2025-01-09 16:03:01,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792874730] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:03:01,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177627939] [2025-01-09 16:03:01,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:01,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:03:01,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:03:01,890 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:03:01,896 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:03:02,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 16:03:02,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 16:03:02,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:02,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:02,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:03:02,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:02,096 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 16:03:02,098 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:02,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177627939] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:02,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:03:02,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-01-09 16:03:02,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457935807] [2025-01-09 16:03:02,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:02,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:03:02,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:02,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:03:02,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:03:02,101 INFO L87 Difference]: Start difference. First operand 89 states and 129 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 16:03:02,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:02,137 INFO L93 Difference]: Finished difference Result 177 states and 258 transitions. [2025-01-09 16:03:02,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:03:02,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 98 [2025-01-09 16:03:02,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:02,139 INFO L225 Difference]: With dead ends: 177 [2025-01-09 16:03:02,139 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 16:03:02,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:03:02,139 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 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:03:02,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:03:02,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 16:03:02,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 16:03:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 16:03:02,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2025-01-09 16:03:02,146 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 98 [2025-01-09 16:03:02,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:02,149 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2025-01-09 16:03:02,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 16:03:02,149 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2025-01-09 16:03:02,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 16:03:02,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:02,150 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:02,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:03:02,350 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:03:02,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:02,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:02,352 INFO L85 PathProgramCache]: Analyzing trace with hash -569061073, now seen corresponding path program 1 times [2025-01-09 16:03:02,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:02,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469711685] [2025-01-09 16:03:02,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:02,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:02,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 16:03:02,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 16:03:02,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:02,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:03,635 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 16:03:03,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:03,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469711685] [2025-01-09 16:03:03,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469711685] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:03,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:03,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:03:03,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864144220] [2025-01-09 16:03:03,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:03,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:03:03,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:03,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:03:03,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:03:03,638 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 16:03:03,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:03,822 INFO L93 Difference]: Finished difference Result 267 states and 387 transitions. [2025-01-09 16:03:03,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:03:03,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 100 [2025-01-09 16:03:03,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:03,824 INFO L225 Difference]: With dead ends: 267 [2025-01-09 16:03:03,824 INFO L226 Difference]: Without dead ends: 179 [2025-01-09 16:03:03,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:03:03,825 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 80 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:03,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 214 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:03:03,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-01-09 16:03:03,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2025-01-09 16:03:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 153 states have (on average 1.4052287581699345) internal successors, (215), 153 states have internal predecessors, (215), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 16:03:03,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 255 transitions. [2025-01-09 16:03:03,838 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 255 transitions. Word has length 100 [2025-01-09 16:03:03,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:03,838 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 255 transitions. [2025-01-09 16:03:03,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 16:03:03,838 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 255 transitions. [2025-01-09 16:03:03,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 16:03:03,839 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:03,840 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:03,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:03:03,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:03,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:03,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1590129427, now seen corresponding path program 1 times [2025-01-09 16:03:03,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:03,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017862471] [2025-01-09 16:03:03,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:03,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:03,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 16:03:03,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 16:03:03,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:03,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:03:03,911 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:03:03,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 16:03:03,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 16:03:03,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:03,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:03:03,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:03:03,978 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:03:03,979 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 16:03:03,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:03:03,982 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 16:03:04,007 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:03:04,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:03:04 BoogieIcfgContainer [2025-01-09 16:03:04,009 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:03:04,010 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:03:04,010 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:03:04,010 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:03:04,011 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:00" (3/4) ... [2025-01-09 16:03:04,012 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 16:03:04,013 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:03:04,013 INFO L158 Benchmark]: Toolchain (without parser) took 4141.85ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 110.7MB in the beginning and 190.0MB in the end (delta: -79.3MB). Peak memory consumption was 69.6MB. Max. memory is 16.1GB. [2025-01-09 16:03:04,014 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:03:04,014 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.47ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 95.4MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:03:04,014 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.79ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 91.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:03:04,014 INFO L158 Benchmark]: Boogie Preprocessor took 62.44ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 89.0MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:03:04,014 INFO L158 Benchmark]: RCFGBuilder took 452.29ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 61.5MB in the end (delta: 27.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 16:03:04,015 INFO L158 Benchmark]: TraceAbstraction took 3350.04ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 60.6MB in the beginning and 190.1MB in the end (delta: -129.5MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2025-01-09 16:03:04,015 INFO L158 Benchmark]: Witness Printer took 2.92ms. Allocated memory is still 285.2MB. Free memory was 190.1MB in the beginning and 190.0MB in the end (delta: 87.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:03:04,016 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 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.47ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 95.4MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.79ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 91.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.44ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 89.0MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 452.29ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 61.5MB in the end (delta: 27.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3350.04ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 60.6MB in the beginning and 190.1MB in the end (delta: -129.5MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Witness Printer took 2.92ms. Allocated memory is still 285.2MB. Free memory was 190.1MB in the beginning and 190.0MB in the end (delta: 87.7kB). Peak memory consumption was 8.4MB. 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 77, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 52, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryArithmeticFLOAToperation at line 65. Possible FailurePath: [L35] unsigned char isInitial = 0; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -200, 0, 1, 100.55, 4.75, 128.75, 128.5, 0.0, 127.875, 1, 16 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L106] isInitial = 1 [L107] FCALL initially() [L109] FCALL updateLastVariables() [L110] CALL updateVariables() [L81] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L82] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L82] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L82] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L83] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L84] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L85] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L86] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L87] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L88] EXPR WrapperStruct00.var_1_10 [L88] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F [L88] EXPR WrapperStruct00.var_1_10 [L88] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L88] EXPR (WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L88] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] WrapperStruct00.var_1_11 = __VERIFIER_nondet_float() [L90] EXPR WrapperStruct00.var_1_11 [L90] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L90] EXPR WrapperStruct00.var_1_11 [L90] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L90] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L92] EXPR WrapperStruct00.var_1_13 [L92] EXPR WrapperStruct00.var_1_13 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 <= -1.0e-20F [L92] EXPR WrapperStruct00.var_1_13 [L92] EXPR WrapperStruct00.var_1_13 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L92] EXPR (WrapperStruct00.var_1_13 >= 4611686.018427382800e+12F && 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] [L92] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 4611686.018427382800e+12F && 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] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 4611686.018427382800e+12F && 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] [L93] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L94] EXPR WrapperStruct00.var_1_14 [L94] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_14 [L94] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L94] EXPR (WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1] [L110] RET updateVariables() [L111] CALL step() [L52] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L52] COND TRUE 0.8f > (- WrapperStruct00.var_1_10) [L53] EXPR WrapperStruct00.var_1_16 [L53] WrapperStruct00.var_1_15 = WrapperStruct00.var_1_16 [L55] EXPR WrapperStruct00.var_1_15 [L55] EXPR WrapperStruct00.var_1_15 [L55] unsigned char stepLocal_1 = WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15; [L56] EXPR WrapperStruct00.var_1_3 [L56] unsigned char stepLocal_0 = WrapperStruct00.var_1_3; [L57] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=-256, stepLocal_1=0] [L57] COND FALSE !(WrapperStruct00.var_1_2 && stepLocal_0) [L64] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=0] [L64] COND TRUE WrapperStruct00.var_1_2 [L65] EXPR WrapperStruct00.var_1_10 [L65] EXPR WrapperStruct00.var_1_11 [L65] WrapperStruct00.var_1_9 = (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11) [L73] EXPR WrapperStruct00.var_1_1 [L73] signed long int stepLocal_2 = WrapperStruct00.var_1_1; [L74] COND FALSE !(stepLocal_2 <= ((((8u) < 0 ) ? -(8u) : (8u)))) [L77] EXPR WrapperStruct00.var_1_13 [L77] EXPR WrapperStruct00.var_1_14 [L77] EXPR WrapperStruct00.var_1_11 [L77] WrapperStruct00.var_1_12 = ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14) - WrapperStruct00.var_1_11) [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR WrapperStruct00.var_1_2 [L102] EXPR WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3 [L102] EXPR WrapperStruct00.var_1_3 [L102] EXPR WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR (WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((signed long int) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_15 + 5) - WrapperStruct00.var_1_15)))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR ((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((signed long int) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_15 + 5) - WrapperStruct00.var_1_15)))) : 1) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10)))) [L102] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10))) [L102] EXPR WrapperStruct00.var_1_9 [L102] EXPR WrapperStruct00.var_1_10 [L102] EXPR WrapperStruct00.var_1_11 [L102] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10))) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR ((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((signed long int) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_15 + 5) - WrapperStruct00.var_1_15)))) : 1) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR (((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((signed long int) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_15 + 5) - WrapperStruct00.var_1_15)))) : 1) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10))))) && ((WrapperStruct00.var_1_1 <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_10 - 99.5))) : (WrapperStruct00.var_1_12 == ((double) ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14) - WrapperStruct00.var_1_11)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR ((((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((signed long int) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_15 + 5) - WrapperStruct00.var_1_15)))) : 1) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10))))) && ((WrapperStruct00.var_1_1 <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_10 - 99.5))) : (WrapperStruct00.var_1_12 == ((double) ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14) - WrapperStruct00.var_1_11))))) && ((0.8f > (- WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L102-L103] return ((((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((signed long int) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_15 + 5) - WrapperStruct00.var_1_15)))) : 1) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10))))) && ((WrapperStruct00.var_1_1 <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_10 - 99.5))) : (WrapperStruct00.var_1_12 == ((double) ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14) - WrapperStruct00.var_1_11))))) && ((0.8f > (- WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : 1) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 80 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 713 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 384 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 186 IncrementalHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 329 mSDtfsCounter, 186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=3, InterpolantAutomatonStates: 10, 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, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 592 NumberOfCodeBlocks, 592 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 487 ConstructedInterpolants, 0 QuantifiedInterpolants, 848 SizeOfPredicates, 0 NumberOfNonLiveVariables, 718 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 855/900 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:03:04,032 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-78.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 cc60dbcb40c1b152bb26088ff001d223dce864841f907f99b254c3b58eb0aa47 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:03:05,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:03:06,036 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:03:06,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:03:06,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:03:06,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:03:06,066 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:03:06,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:03:06,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:03:06,067 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:03:06,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:03:06,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:03:06,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:03:06,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:03:06,068 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:03:06,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:03:06,069 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:03:06,069 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:03:06,069 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:03:06,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:03:06,069 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:03:06,069 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:03:06,069 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:03:06,069 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 16:03:06,069 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 16:03:06,069 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 16:03:06,069 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:03:06,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:03:06,069 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:03:06,069 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:03:06,069 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:03:06,069 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:03:06,069 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:03:06,069 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:03:06,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:03:06,069 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:03:06,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:03:06,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:03:06,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:03:06,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:03:06,070 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:03:06,070 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:03:06,070 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:03:06,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:03:06,071 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 16:03:06,071 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 16:03:06,071 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:03:06,071 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:03:06,071 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:03:06,071 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:03:06,071 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 -> cc60dbcb40c1b152bb26088ff001d223dce864841f907f99b254c3b58eb0aa47 [2025-01-09 16:03:06,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:03:06,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:03:06,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:03:06,320 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:03:06,320 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:03:06,321 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-78.i [2025-01-09 16:03:07,491 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/668080be7/31ea25edf46b4d61bc0c9698d778ef74/FLAGdc2ccfbba [2025-01-09 16:03:07,691 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:03:07,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-78.i [2025-01-09 16:03:07,698 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/668080be7/31ea25edf46b4d61bc0c9698d778ef74/FLAGdc2ccfbba [2025-01-09 16:03:08,053 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/668080be7/31ea25edf46b4d61bc0c9698d778ef74 [2025-01-09 16:03:08,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:03:08,056 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:03:08,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:03:08,057 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:03:08,060 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:03:08,061 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:03:08" (1/1) ... [2025-01-09 16:03:08,061 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27781a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:08, skipping insertion in model container [2025-01-09 16:03:08,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:03:08" (1/1) ... [2025-01-09 16:03:08,072 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:03:08,162 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-78.i[916,929] [2025-01-09 16:03:08,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:03:08,202 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:03:08,210 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-78.i[916,929] [2025-01-09 16:03:08,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:03:08,266 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:03:08,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:08 WrapperNode [2025-01-09 16:03:08,268 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:03:08,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:03:08,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:03:08,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:03:08,273 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:03:08" (1/1) ... [2025-01-09 16:03:08,282 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:03:08" (1/1) ... [2025-01-09 16:03:08,307 INFO L138 Inliner]: procedures = 37, calls = 132, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 409 [2025-01-09 16:03:08,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:03:08,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:03:08,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:03:08,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:03:08,314 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:08" (1/1) ... [2025-01-09 16:03:08,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:08" (1/1) ... [2025-01-09 16:03:08,318 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:08" (1/1) ... [2025-01-09 16:03:08,335 INFO L175 MemorySlicer]: Split 111 memory accesses to 2 slices as follows [2, 109]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 27 writes are split as follows [0, 27]. [2025-01-09 16:03:08,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:08" (1/1) ... [2025-01-09 16:03:08,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:08" (1/1) ... [2025-01-09 16:03:08,348 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:08" (1/1) ... [2025-01-09 16:03:08,348 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:08" (1/1) ... [2025-01-09 16:03:08,351 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:08" (1/1) ... [2025-01-09 16:03:08,352 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:08" (1/1) ... [2025-01-09 16:03:08,353 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:08" (1/1) ... [2025-01-09 16:03:08,356 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:03:08,357 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:03:08,357 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:03:08,357 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:03:08,358 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:08" (1/1) ... [2025-01-09 16:03:08,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:03:08,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:03:08,385 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:03:08,388 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:03:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:03:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 16:03:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 16:03:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-01-09 16:03:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-01-09 16:03:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 16:03:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 16:03:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 16:03:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 16:03:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 16:03:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 16:03:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 16:03:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 16:03:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 16:03:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 16:03:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-01-09 16:03:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-01-09 16:03:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 16:03:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 16:03:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-01-09 16:03:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-01-09 16:03:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:03:08,408 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:03:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-01-09 16:03:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-01-09 16:03:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:03:08,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:03:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 16:03:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 16:03:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 16:03:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 16:03:08,507 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:03:08,508 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:03:14,527 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-01-09 16:03:14,527 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:03:14,537 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:03:14,537 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:03:14,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:14 BoogieIcfgContainer [2025-01-09 16:03:14,538 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:03:14,539 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:03:14,539 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:03:14,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:03:14,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:03:08" (1/3) ... [2025-01-09 16:03:14,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fbf06e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:03:14, skipping insertion in model container [2025-01-09 16:03:14,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:08" (2/3) ... [2025-01-09 16:03:14,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fbf06e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:03:14, skipping insertion in model container [2025-01-09 16:03:14,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:14" (3/3) ... [2025-01-09 16:03:14,543 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-78.i [2025-01-09 16:03:14,551 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:03:14,552 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-78.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:03:14,579 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:03:14,586 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;@759ca4d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:03:14,586 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:03:14,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 80 states have internal predecessors, (114), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 16:03:14,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 16:03:14,593 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:14,593 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:14,594 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:14,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:14,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1483262152, now seen corresponding path program 1 times [2025-01-09 16:03:14,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:03:14,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609076744] [2025-01-09 16:03:14,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:14,603 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:03:14,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:03:14,605 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:03:14,611 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:03:14,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 16:03:14,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 16:03:14,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:14,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:14,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:03:14,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:14,927 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-09 16:03:14,927 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:14,928 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:03:14,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609076744] [2025-01-09 16:03:14,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609076744] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:14,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:14,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:03:14,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965152506] [2025-01-09 16:03:14,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:14,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:03:14,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:03:14,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:03:14,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:03:14,957 INFO L87 Difference]: Start difference. First operand has 92 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 80 states have internal predecessors, (114), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 16:03:14,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:14,980 INFO L93 Difference]: Finished difference Result 178 states and 273 transitions. [2025-01-09 16:03:14,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:03:14,982 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2025-01-09 16:03:14,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:14,987 INFO L225 Difference]: With dead ends: 178 [2025-01-09 16:03:14,988 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 16:03:14,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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:03:14,998 INFO L435 NwaCegarLoop]: 129 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, 129 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:03:15,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:03:15,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 16:03:15,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-01-09 16:03:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 16:03:15,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2025-01-09 16:03:15,036 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 98 [2025-01-09 16:03:15,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:15,036 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 129 transitions. [2025-01-09 16:03:15,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 16:03:15,038 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions. [2025-01-09 16:03:15,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 16:03:15,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:15,042 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:15,056 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:03:15,247 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:03:15,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:15,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:15,248 INFO L85 PathProgramCache]: Analyzing trace with hash 215738068, now seen corresponding path program 1 times [2025-01-09 16:03:15,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:03:15,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857454484] [2025-01-09 16:03:15,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:15,250 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:03:15,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:03:15,253 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:03:15,254 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:03:15,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 16:03:15,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 16:03:15,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:15,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:15,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:03:15,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:15,594 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-09 16:03:15,594 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:15,594 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:03:15,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857454484] [2025-01-09 16:03:15,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1857454484] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:15,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:15,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:03:15,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828784219] [2025-01-09 16:03:15,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:15,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:03:15,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:03:15,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:03:15,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:03:15,600 INFO L87 Difference]: Start difference. First operand 89 states and 129 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 16:03:15,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:15,677 INFO L93 Difference]: Finished difference Result 177 states and 258 transitions. [2025-01-09 16:03:15,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:03:15,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2025-01-09 16:03:15,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:15,683 INFO L225 Difference]: With dead ends: 177 [2025-01-09 16:03:15,683 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 16:03:15,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 95 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:03:15,684 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:15,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:03:15,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 16:03:15,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 16:03:15,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 16:03:15,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2025-01-09 16:03:15,699 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 98 [2025-01-09 16:03:15,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:15,701 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2025-01-09 16:03:15,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 16:03:15,701 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2025-01-09 16:03:15,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 16:03:15,705 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:15,705 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:15,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:03:15,906 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:03:15,906 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:15,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:15,908 INFO L85 PathProgramCache]: Analyzing trace with hash -32408426, now seen corresponding path program 1 times [2025-01-09 16:03:15,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:03:15,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286736471] [2025-01-09 16:03:15,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:15,909 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:03:15,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:03:15,910 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:03:15,912 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:03:16,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 16:03:16,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 16:03:16,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:16,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:16,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:03:16,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:16,262 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 16:03:16,262 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:16,262 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:03:16,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1286736471] [2025-01-09 16:03:16,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1286736471] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:16,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:16,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:03:16,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901767334] [2025-01-09 16:03:16,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:16,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:03:16,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:03:16,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:03:16,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:03:16,263 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 16:03:16,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:16,304 INFO L93 Difference]: Finished difference Result 181 states and 262 transitions. [2025-01-09 16:03:16,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:03:16,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 98 [2025-01-09 16:03:16,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:16,305 INFO L225 Difference]: With dead ends: 181 [2025-01-09 16:03:16,305 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 16:03:16,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 95 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:03:16,306 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 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:03:16,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:03:16,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 16:03:16,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-01-09 16:03:16,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 81 states have (on average 1.3950617283950617) internal successors, (113), 81 states have internal predecessors, (113), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 16:03:16,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2025-01-09 16:03:16,314 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 98 [2025-01-09 16:03:16,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:16,315 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2025-01-09 16:03:16,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 16:03:16,315 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2025-01-09 16:03:16,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 16:03:16,318 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:16,318 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:16,328 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 (4)] Forceful destruction successful, exit code 0 [2025-01-09 16:03:16,518 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:03:16,519 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:16,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:16,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1903941009, now seen corresponding path program 1 times [2025-01-09 16:03:16,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:03:16,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872722494] [2025-01-09 16:03:16,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:16,522 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:03:16,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:03:16,524 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:03:16,525 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:03:16,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 16:03:16,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 16:03:16,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:16,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:16,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:03:16,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:16,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 95 treesize of output 41 [2025-01-09 16:03:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 16:03:17,009 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:17,009 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:03:17,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872722494] [2025-01-09 16:03:17,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [872722494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:17,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:17,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:03:17,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651998727] [2025-01-09 16:03:17,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:17,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:03:17,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:03:17,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:03:17,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:03:17,010 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 16:03:19,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:03:20,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:20,893 INFO L93 Difference]: Finished difference Result 184 states and 264 transitions. [2025-01-09 16:03:20,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:03:20,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 100 [2025-01-09 16:03:20,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:20,895 INFO L225 Difference]: With dead ends: 184 [2025-01-09 16:03:20,896 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 16:03:20,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 95 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:03:20,897 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 109 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:20,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 344 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-01-09 16:03:20,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 16:03:20,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2025-01-09 16:03:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 81 states have (on average 1.382716049382716) internal successors, (112), 81 states have internal predecessors, (112), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 16:03:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 132 transitions. [2025-01-09 16:03:20,909 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 132 transitions. Word has length 100 [2025-01-09 16:03:20,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:20,909 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 132 transitions. [2025-01-09 16:03:20,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 16:03:20,909 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 132 transitions. [2025-01-09 16:03:20,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 16:03:20,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:20,910 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:20,923 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:03:21,110 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:03:21,110 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:21,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:21,111 INFO L85 PathProgramCache]: Analyzing trace with hash -508964361, now seen corresponding path program 1 times [2025-01-09 16:03:21,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:03:21,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1520660845] [2025-01-09 16:03:21,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:21,112 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:03:21,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:03:21,119 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:03:21,120 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:03:21,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 16:03:21,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 16:03:21,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:21,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:21,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:03:21,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:21,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 95 treesize of output 41 [2025-01-09 16:03:21,513 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-09 16:03:21,514 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:21,514 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:03:21,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1520660845] [2025-01-09 16:03:21,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1520660845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:21,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:21,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:03:21,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434032366] [2025-01-09 16:03:21,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:21,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:03:21,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:03:21,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:03:21,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:03:21,515 INFO L87 Difference]: Start difference. First operand 93 states and 132 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 16:03:24,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:03:27,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:03:28,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:28,132 INFO L93 Difference]: Finished difference Result 184 states and 262 transitions. [2025-01-09 16:03:28,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:03:28,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 102 [2025-01-09 16:03:28,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:28,134 INFO L225 Difference]: With dead ends: 184 [2025-01-09 16:03:28,134 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 16:03:28,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 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:03:28,135 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 100 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:28,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 342 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2025-01-09 16:03:28,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 16:03:28,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2025-01-09 16:03:28,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 16:03:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2025-01-09 16:03:28,140 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 102 [2025-01-09 16:03:28,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:28,140 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2025-01-09 16:03:28,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 16:03:28,140 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2025-01-09 16:03:28,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 16:03:28,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:28,141 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:28,155 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:03:28,346 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:03:28,346 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:28,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:28,346 INFO L85 PathProgramCache]: Analyzing trace with hash -158395437, now seen corresponding path program 1 times [2025-01-09 16:03:28,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:03:28,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1813523197] [2025-01-09 16:03:28,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:28,347 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:03:28,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:03:28,350 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:03:28,351 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:03:28,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 16:03:28,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 16:03:28,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:28,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:28,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 16:03:28,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:28,690 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-01-09 16:03:28,691 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:28,691 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:03:28,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1813523197] [2025-01-09 16:03:28,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1813523197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:28,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:28,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:03:28,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106377858] [2025-01-09 16:03:28,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:28,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:03:28,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:03:28,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:03:28,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:03:28,692 INFO L87 Difference]: Start difference. First operand 93 states and 131 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 16:03:28,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:28,807 INFO L93 Difference]: Finished difference Result 187 states and 264 transitions. [2025-01-09 16:03:28,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:03:28,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 104 [2025-01-09 16:03:28,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:28,812 INFO L225 Difference]: With dead ends: 187 [2025-01-09 16:03:28,812 INFO L226 Difference]: Without dead ends: 95 [2025-01-09 16:03:28,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:03:28,813 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:28,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 538 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:03:28,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-09 16:03:28,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2025-01-09 16:03:28,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 16:03:28,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2025-01-09 16:03:28,825 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 104 [2025-01-09 16:03:28,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:28,826 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2025-01-09 16:03:28,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 16:03:28,826 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2025-01-09 16:03:28,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 16:03:28,830 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:28,831 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:28,853 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 (7)] Forceful destruction successful, exit code 0 [2025-01-09 16:03:29,031 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:03:29,032 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:29,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:29,032 INFO L85 PathProgramCache]: Analyzing trace with hash -2119970095, now seen corresponding path program 1 times [2025-01-09 16:03:29,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:03:29,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [460676429] [2025-01-09 16:03:29,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:29,033 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:03:29,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:03:29,038 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:03:29,042 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:03:29,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 16:03:29,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 16:03:29,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:29,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:29,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:03:29,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:29,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:29,713 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:03:29,766 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 16:03:29,766 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:29,766 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:03:29,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [460676429] [2025-01-09 16:03:29,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [460676429] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:29,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:29,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:03:29,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489840059] [2025-01-09 16:03:29,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:29,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:03:29,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:03:29,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:03:29,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:03:29,768 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 16:03:31,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s 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:03:34,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:03:35,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:03:35,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:35,961 INFO L93 Difference]: Finished difference Result 184 states and 258 transitions. [2025-01-09 16:03:35,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:03:35,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 104 [2025-01-09 16:03:35,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:35,963 INFO L225 Difference]: With dead ends: 184 [2025-01-09 16:03:35,963 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 16:03:35,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:03:35,965 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 89 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:35,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 335 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2025-01-09 16:03:35,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 16:03:35,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2025-01-09 16:03:35,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 81 states have (on average 1.345679012345679) internal successors, (109), 81 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 16:03:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 129 transitions. [2025-01-09 16:03:35,971 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 129 transitions. Word has length 104 [2025-01-09 16:03:35,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:35,971 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 129 transitions. [2025-01-09 16:03:35,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 16:03:35,971 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2025-01-09 16:03:35,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 16:03:35,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:35,976 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:35,989 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:03:36,176 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:03:36,177 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:36,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:36,177 INFO L85 PathProgramCache]: Analyzing trace with hash 175733047, now seen corresponding path program 1 times [2025-01-09 16:03:36,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:03:36,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279189584] [2025-01-09 16:03:36,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:36,177 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:03:36,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:03:36,180 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:03:36,183 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:03:36,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 16:03:36,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 16:03:36,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:36,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:36,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:03:36,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:36,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:36,704 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:03:36,725 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-09 16:03:36,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:36,725 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:03:36,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279189584] [2025-01-09 16:03:36,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279189584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:36,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:36,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:03:36,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587530538] [2025-01-09 16:03:36,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:36,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:03:36,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:03:36,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:03:36,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:03:36,727 INFO L87 Difference]: Start difference. First operand 93 states and 129 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 16:03:39,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:03:42,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:03:42,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:42,305 INFO L93 Difference]: Finished difference Result 183 states and 255 transitions. [2025-01-09 16:03:42,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:03:42,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 106 [2025-01-09 16:03:42,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:42,310 INFO L225 Difference]: With dead ends: 183 [2025-01-09 16:03:42,310 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 16:03:42,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 101 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:03:42,311 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 81 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:42,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 329 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-01-09 16:03:42,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 16:03:42,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2025-01-09 16:03:42,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 79 states have internal predecessors, (106), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 16:03:42,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2025-01-09 16:03:42,327 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 126 transitions. Word has length 106 [2025-01-09 16:03:42,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:42,329 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 126 transitions. [2025-01-09 16:03:42,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 16:03:42,329 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2025-01-09 16:03:42,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 16:03:42,330 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:42,330 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:42,343 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 (9)] Forceful destruction successful, exit code 0 [2025-01-09 16:03:42,530 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:03:42,531 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:42,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:42,532 INFO L85 PathProgramCache]: Analyzing trace with hash 890534735, now seen corresponding path program 1 times [2025-01-09 16:03:42,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:03:42,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1811377035] [2025-01-09 16:03:42,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:42,533 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:03:42,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:03:42,536 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:03:42,537 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:03:42,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 16:03:42,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 16:03:42,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:42,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:42,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 16:03:42,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:43,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:43,270 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:03:43,447 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 64 proven. 28 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-01-09 16:03:43,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:03:43,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:43,806 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:03:43,833 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-01-09 16:03:43,833 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:03:43,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1811377035] [2025-01-09 16:03:43,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1811377035] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:03:43,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:03:43,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2025-01-09 16:03:43,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791140117] [2025-01-09 16:03:43,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 16:03:43,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:03:43,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:03:43,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:03:43,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:03:43,835 INFO L87 Difference]: Start difference. First operand 91 states and 126 transitions. Second operand has 12 states, 11 states have (on average 9.363636363636363) internal successors, (103), 12 states have internal predecessors, (103), 4 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 16:03:49,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:03:53,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:03:54,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:54,879 INFO L93 Difference]: Finished difference Result 192 states and 264 transitions. [2025-01-09 16:03:54,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:03:54,880 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.363636363636363) internal successors, (103), 12 states have internal predecessors, (103), 4 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 108 [2025-01-09 16:03:54,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:54,881 INFO L225 Difference]: With dead ends: 192 [2025-01-09 16:03:54,884 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 16:03:54,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-01-09 16:03:54,885 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 87 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:54,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 493 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2025-01-09 16:03:54,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 16:03:54,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2025-01-09 16:03:54,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 79 states have internal predecessors, (104), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 16:03:54,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 124 transitions. [2025-01-09 16:03:54,897 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 124 transitions. Word has length 108 [2025-01-09 16:03:54,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:54,897 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 124 transitions. [2025-01-09 16:03:54,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.363636363636363) internal successors, (103), 12 states have internal predecessors, (103), 4 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 16:03:54,897 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 124 transitions. [2025-01-09 16:03:54,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 16:03:54,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:54,898 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:54,909 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 (10)] Ended with exit code 0 [2025-01-09 16:03:55,099 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:03:55,099 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:55,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:55,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1037737967, now seen corresponding path program 1 times [2025-01-09 16:03:55,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:03:55,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847418437] [2025-01-09 16:03:55,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:55,100 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:03:55,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:03:55,103 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:03:55,104 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:03:55,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 16:03:55,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 16:03:55,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:55,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:55,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 16:03:55,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:55,609 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 77 treesize of output 76 [2025-01-09 16:03:55,829 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 162 treesize of output 135 [2025-01-09 16:03:56,794 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 157 treesize of output 130 [2025-01-09 16:03:57,428 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 157 treesize of output 132 [2025-01-09 16:03:58,524 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 157 treesize of output 132 [2025-01-09 16:03:59,566 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 158 treesize of output 133 [2025-01-09 16:04:04,148 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 153 treesize of output 130 [2025-01-09 16:04:17,619 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 137 treesize of output 118 [2025-01-09 16:04:22,606 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 139 treesize of output 120 [2025-01-09 16:04:27,241 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 134 treesize of output 119 [2025-01-09 16:04:33,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 122 treesize of output 108 [2025-01-09 16:04:33,628 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 16:04:33,629 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:04:33,629 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:04:33,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847418437] [2025-01-09 16:04:33,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847418437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:04:33,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:04:33,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:04:33,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527096198] [2025-01-09 16:04:33,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:33,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:04:33,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:04:33,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:04:33,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=38, Unknown=4, NotChecked=0, Total=72 [2025-01-09 16:04:33,630 INFO L87 Difference]: Start difference. First operand 91 states and 124 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 8 states have internal predecessors, (73), 5 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-01-09 16:04:37,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:04:42,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]