./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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-28.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 e1d78d248c74132bd311292745f8a4e0496a51de00b4b221480ef3ff016a6c65 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:49:41,322 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:49:41,358 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:49:41,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:49:41,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:49:41,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:49:41,376 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:49:41,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:49:41,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:49:41,376 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:49:41,376 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:49:41,376 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:49:41,377 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:49:41,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:49:41,377 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:49:41,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:49:41,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:49:41,377 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:49:41,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:49:41,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:49:41,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:49:41,377 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:49:41,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:49:41,377 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:49:41,377 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:49:41,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:49:41,378 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:49:41,378 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:49:41,378 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:49:41,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:49:41,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:49:41,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:49:41,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:49:41,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:49:41,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:49:41,379 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:49:41,379 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:49:41,379 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:49:41,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:49:41,379 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:49:41,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:49:41,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:49:41,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:49:41,379 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 -> e1d78d248c74132bd311292745f8a4e0496a51de00b4b221480ef3ff016a6c65 [2025-02-06 03:49:41,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:49:41,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:49:41,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:49:41,576 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:49:41,577 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:49:41,577 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-28.i [2025-02-06 03:49:42,722 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/557cf92e9/10ce457e4f7b43c78338acc687570fe9/FLAG9ab6be486 [2025-02-06 03:49:43,016 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:49:43,016 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-28.i [2025-02-06 03:49:43,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/557cf92e9/10ce457e4f7b43c78338acc687570fe9/FLAG9ab6be486 [2025-02-06 03:49:43,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/557cf92e9/10ce457e4f7b43c78338acc687570fe9 [2025-02-06 03:49:43,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:49:43,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:49:43,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:49:43,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:49:43,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:49:43,044 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:49:43" (1/1) ... [2025-02-06 03:49:43,045 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf7dd99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:43, skipping insertion in model container [2025-02-06 03:49:43,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:49:43" (1/1) ... [2025-02-06 03:49:43,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:49:43,282 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-28.i[916,929] [2025-02-06 03:49:43,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:49:43,346 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:49:43,362 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-28.i[916,929] [2025-02-06 03:49:43,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:49:43,415 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:49:43,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:43 WrapperNode [2025-02-06 03:49:43,419 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:49:43,420 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:49:43,420 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:49:43,420 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:49:43,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:43" (1/1) ... [2025-02-06 03:49:43,434 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:43" (1/1) ... [2025-02-06 03:49:43,462 INFO L138 Inliner]: procedures = 30, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 572 [2025-02-06 03:49:43,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:49:43,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:49:43,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:49:43,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:49:43,469 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:43" (1/1) ... [2025-02-06 03:49:43,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:43" (1/1) ... [2025-02-06 03:49:43,473 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:43" (1/1) ... [2025-02-06 03:49:43,477 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 03:49:43,477 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:43" (1/1) ... [2025-02-06 03:49:43,477 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:43" (1/1) ... [2025-02-06 03:49:43,489 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:43" (1/1) ... [2025-02-06 03:49:43,491 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:43" (1/1) ... [2025-02-06 03:49:43,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:43" (1/1) ... [2025-02-06 03:49:43,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:43" (1/1) ... [2025-02-06 03:49:43,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:49:43,496 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:49:43,496 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:49:43,496 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:49:43,497 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:43" (1/1) ... [2025-02-06 03:49:43,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:49:43,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:49:43,523 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-02-06 03:49:43,535 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-02-06 03:49:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:49:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 03:49:43,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 03:49:43,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 03:49:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 03:49:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 03:49:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 03:49:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:49:43,559 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:49:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 03:49:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:49:43,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:49:43,672 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:49:43,674 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:49:44,084 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite114#1;havoc property_#t~mem111#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~ite110#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~mem115#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short123#1;havoc property_#t~mem129#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~short130#1;havoc property_#t~mem131#1;havoc property_#t~bitwise132#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~ite137#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~ite159#1;havoc property_#t~mem150#1;havoc property_#t~mem140#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~ite144#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~mem149#1;havoc property_#t~mem145#1;havoc property_#t~ite148#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~mem158#1;havoc property_#t~mem157#1;havoc property_#t~mem151#1;havoc property_#t~mem152#1;havoc property_#t~ite155#1;havoc property_#t~mem153#1;havoc property_#t~mem154#1;havoc property_#t~mem156#1;havoc property_#t~short160#1;havoc property_#t~mem162#1;havoc property_#t~mem161#1;havoc property_#t~short163#1;havoc property_#t~mem165#1;havoc property_#t~mem164#1;havoc property_#t~short166#1; [2025-02-06 03:49:44,111 INFO L? ?]: Removed 172 outVars from TransFormulas that were not future-live. [2025-02-06 03:49:44,112 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:49:44,127 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:49:44,127 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:49:44,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:49:44 BoogieIcfgContainer [2025-02-06 03:49:44,128 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:49:44,129 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:49:44,129 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:49:44,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:49:44,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:49:43" (1/3) ... [2025-02-06 03:49:44,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac92cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:49:44, skipping insertion in model container [2025-02-06 03:49:44,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:43" (2/3) ... [2025-02-06 03:49:44,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac92cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:49:44, skipping insertion in model container [2025-02-06 03:49:44,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:49:44" (3/3) ... [2025-02-06 03:49:44,143 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-28.i [2025-02-06 03:49:44,158 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:49:44,159 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-28.i that has 2 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:49:44,196 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:49:44,211 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;@11894e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:49:44,212 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:49:44,218 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:49:44,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-06 03:49:44,230 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:44,230 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:49:44,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:44,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:44,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1038211254, now seen corresponding path program 1 times [2025-02-06 03:49:44,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:44,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648027179] [2025-02-06 03:49:44,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:44,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:44,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 03:49:44,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 03:49:44,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:44,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:44,605 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-02-06 03:49:44,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:44,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648027179] [2025-02-06 03:49:44,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648027179] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:49:44,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304840305] [2025-02-06 03:49:44,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:44,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:49:44,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:49:44,612 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-02-06 03:49:44,614 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-02-06 03:49:44,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 03:49:44,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 03:49:44,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:44,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:44,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:49:44,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:49:44,860 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-02-06 03:49:44,861 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:49:44,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304840305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:44,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:49:44,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:49:44,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207011294] [2025-02-06 03:49:44,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:44,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:49:44,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:44,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:49:44,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:49:44,881 INFO L87 Difference]: Start difference. First operand has 122 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:49:44,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:44,903 INFO L93 Difference]: Finished difference Result 238 states and 365 transitions. [2025-02-06 03:49:44,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:49:44,905 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2025-02-06 03:49:44,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:44,914 INFO L225 Difference]: With dead ends: 238 [2025-02-06 03:49:44,914 INFO L226 Difference]: Without dead ends: 119 [2025-02-06 03:49:44,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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-02-06 03:49:44,923 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:44,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:49:44,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-06 03:49:44,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-02-06 03:49:44,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:49:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2025-02-06 03:49:44,964 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 130 [2025-02-06 03:49:44,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:44,965 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2025-02-06 03:49:44,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:49:44,965 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2025-02-06 03:49:44,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-06 03:49:44,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:44,968 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:49:44,979 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-02-06 03:49:45,170 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-02-06 03:49:45,171 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:45,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:45,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1415757888, now seen corresponding path program 1 times [2025-02-06 03:49:45,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:45,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225711836] [2025-02-06 03:49:45,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:45,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:45,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 03:49:45,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 03:49:45,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:45,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:45,558 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:49:45,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:45,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225711836] [2025-02-06 03:49:45,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225711836] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:45,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:45,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:49:45,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172183603] [2025-02-06 03:49:45,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:45,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:49:45,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:45,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:49:45,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:49:45,562 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:49:45,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:45,622 INFO L93 Difference]: Finished difference Result 238 states and 343 transitions. [2025-02-06 03:49:45,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:49:45,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2025-02-06 03:49:45,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:45,624 INFO L225 Difference]: With dead ends: 238 [2025-02-06 03:49:45,624 INFO L226 Difference]: Without dead ends: 122 [2025-02-06 03:49:45,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-02-06 03:49:45,625 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 1 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:45,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 487 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:49:45,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-06 03:49:45,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2025-02-06 03:49:45,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 105 states have (on average 1.380952380952381) internal successors, (145), 105 states have internal predecessors, (145), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:49:45,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 173 transitions. [2025-02-06 03:49:45,638 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 173 transitions. Word has length 130 [2025-02-06 03:49:45,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:45,639 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 173 transitions. [2025-02-06 03:49:45,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:49:45,639 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 173 transitions. [2025-02-06 03:49:45,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-06 03:49:45,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:45,641 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:49:45,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:49:45,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:45,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:45,642 INFO L85 PathProgramCache]: Analyzing trace with hash -528254207, now seen corresponding path program 1 times [2025-02-06 03:49:45,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:45,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324183821] [2025-02-06 03:49:45,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:45,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:45,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 03:49:45,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 03:49:45,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:45,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:45,864 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:49:45,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:45,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324183821] [2025-02-06 03:49:45,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324183821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:45,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:45,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:49:45,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772895091] [2025-02-06 03:49:45,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:45,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:49:45,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:45,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:49:45,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:49:45,868 INFO L87 Difference]: Start difference. First operand 121 states and 173 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:49:45,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:45,906 INFO L93 Difference]: Finished difference Result 242 states and 347 transitions. [2025-02-06 03:49:45,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:49:45,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2025-02-06 03:49:45,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:45,910 INFO L225 Difference]: With dead ends: 242 [2025-02-06 03:49:45,910 INFO L226 Difference]: Without dead ends: 124 [2025-02-06 03:49:45,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-02-06 03:49:45,913 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 1 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:45,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 490 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:49:45,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-06 03:49:45,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2025-02-06 03:49:45,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 107 states have (on average 1.3738317757009346) internal successors, (147), 107 states have internal predecessors, (147), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:49:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2025-02-06 03:49:45,923 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 130 [2025-02-06 03:49:45,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:45,923 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2025-02-06 03:49:45,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:49:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2025-02-06 03:49:45,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-06 03:49:45,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:45,928 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:49:45,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:49:45,929 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:45,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:45,929 INFO L85 PathProgramCache]: Analyzing trace with hash -527330686, now seen corresponding path program 1 times [2025-02-06 03:49:45,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:45,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433576525] [2025-02-06 03:49:45,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:45,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:45,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 03:49:46,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 03:49:46,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:46,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:46,556 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:49:46,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:46,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433576525] [2025-02-06 03:49:46,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433576525] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:46,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:46,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:49:46,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327134013] [2025-02-06 03:49:46,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:46,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:49:46,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:46,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:49:46,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:49:46,558 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:49:46,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:46,882 INFO L93 Difference]: Finished difference Result 321 states and 455 transitions. [2025-02-06 03:49:46,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:49:46,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2025-02-06 03:49:46,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:46,884 INFO L225 Difference]: With dead ends: 321 [2025-02-06 03:49:46,884 INFO L226 Difference]: Without dead ends: 201 [2025-02-06 03:49:46,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:49:46,885 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 91 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:46,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 620 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:49:46,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-06 03:49:46,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2025-02-06 03:49:46,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 179 states have (on average 1.3854748603351956) internal successors, (248), 180 states have internal predecessors, (248), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:49:46,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 280 transitions. [2025-02-06 03:49:46,905 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 280 transitions. Word has length 130 [2025-02-06 03:49:46,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:46,906 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 280 transitions. [2025-02-06 03:49:46,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:49:46,906 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 280 transitions. [2025-02-06 03:49:46,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:49:46,908 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:46,908 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:49:46,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:49:46,908 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:46,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:46,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1723436284, now seen corresponding path program 1 times [2025-02-06 03:49:46,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:46,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109275901] [2025-02-06 03:49:46,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:46,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:46,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:49:46,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:49:46,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:46,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:48,184 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:49:48,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:48,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109275901] [2025-02-06 03:49:48,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109275901] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:48,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:48,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:49:48,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400325377] [2025-02-06 03:49:48,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:48,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:49:48,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:48,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:49:48,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:49:48,186 INFO L87 Difference]: Start difference. First operand 198 states and 280 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:49:49,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:49,114 INFO L93 Difference]: Finished difference Result 631 states and 888 transitions. [2025-02-06 03:49:49,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:49:49,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 132 [2025-02-06 03:49:49,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:49,117 INFO L225 Difference]: With dead ends: 631 [2025-02-06 03:49:49,119 INFO L226 Difference]: Without dead ends: 436 [2025-02-06 03:49:49,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:49:49,122 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 255 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:49,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 683 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 03:49:49,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-02-06 03:49:49,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 372. [2025-02-06 03:49:49,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 345 states have (on average 1.3942028985507247) internal successors, (481), 348 states have internal predecessors, (481), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 03:49:49,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 525 transitions. [2025-02-06 03:49:49,151 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 525 transitions. Word has length 132 [2025-02-06 03:49:49,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:49,153 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 525 transitions. [2025-02-06 03:49:49,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:49:49,154 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 525 transitions. [2025-02-06 03:49:49,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:49:49,155 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:49,155 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:49:49,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:49:49,155 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:49,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:49,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2132260509, now seen corresponding path program 1 times [2025-02-06 03:49:49,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:49,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612141673] [2025-02-06 03:49:49,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:49,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:49,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:49:49,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:49:49,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:49,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:49:49,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:49,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612141673] [2025-02-06 03:49:49,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612141673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:49,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:49,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:49:49,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358921234] [2025-02-06 03:49:49,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:49,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:49:49,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:49,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:49:49,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:49:49,803 INFO L87 Difference]: Start difference. First operand 372 states and 525 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:49:50,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:50,126 INFO L93 Difference]: Finished difference Result 767 states and 1081 transitions. [2025-02-06 03:49:50,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:49:50,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2025-02-06 03:49:50,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:50,129 INFO L225 Difference]: With dead ends: 767 [2025-02-06 03:49:50,129 INFO L226 Difference]: Without dead ends: 398 [2025-02-06 03:49:50,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:49:50,130 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 203 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:50,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 514 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:49:50,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-02-06 03:49:50,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 372. [2025-02-06 03:49:50,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 345 states have (on average 1.3855072463768117) internal successors, (478), 348 states have internal predecessors, (478), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 03:49:50,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 522 transitions. [2025-02-06 03:49:50,142 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 522 transitions. Word has length 132 [2025-02-06 03:49:50,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:50,143 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 522 transitions. [2025-02-06 03:49:50,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:49:50,143 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 522 transitions. [2025-02-06 03:49:50,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:49:50,144 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:50,144 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:49:50,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:49:50,144 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:50,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:50,145 INFO L85 PathProgramCache]: Analyzing trace with hash -337532441, now seen corresponding path program 1 times [2025-02-06 03:49:50,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:50,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997595742] [2025-02-06 03:49:50,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:50,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:50,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:49:50,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:49:50,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:50,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:50,268 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:49:50,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:49:50,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997595742] [2025-02-06 03:49:50,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997595742] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:50,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:50,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:49:50,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313110089] [2025-02-06 03:49:50,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:50,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:49:50,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:49:50,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:49:50,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:49:50,270 INFO L87 Difference]: Start difference. First operand 372 states and 522 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:49:50,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:50,284 INFO L93 Difference]: Finished difference Result 741 states and 1041 transitions. [2025-02-06 03:49:50,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:49:50,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 134 [2025-02-06 03:49:50,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:50,287 INFO L225 Difference]: With dead ends: 741 [2025-02-06 03:49:50,287 INFO L226 Difference]: Without dead ends: 372 [2025-02-06 03:49:50,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:49:50,288 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:50,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 330 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:49:50,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-02-06 03:49:50,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2025-02-06 03:49:50,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 345 states have (on average 1.3710144927536232) internal successors, (473), 348 states have internal predecessors, (473), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 03:49:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 517 transitions. [2025-02-06 03:49:50,299 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 517 transitions. Word has length 134 [2025-02-06 03:49:50,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:50,299 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 517 transitions. [2025-02-06 03:49:50,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:49:50,299 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 517 transitions. [2025-02-06 03:49:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:49:50,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:50,300 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:49:50,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:49:50,300 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:50,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:50,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1334604794, now seen corresponding path program 1 times [2025-02-06 03:49:50,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:49:50,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097612629] [2025-02-06 03:49:50,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:50,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:49:50,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:49:50,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:49:50,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:50,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:49:50,385 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:49:50,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:49:50,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:49:50,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:50,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:49:50,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:49:50,517 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:49:50,518 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:49:50,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:49:50,524 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:49:50,563 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:49:50,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:49:50 BoogieIcfgContainer [2025-02-06 03:49:50,565 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:49:50,566 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:49:50,566 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:49:50,566 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:49:50,566 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:49:44" (3/4) ... [2025-02-06 03:49:50,568 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:49:50,569 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:49:50,569 INFO L158 Benchmark]: Toolchain (without parser) took 7530.08ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 130.1MB in the beginning and 378.4MB in the end (delta: -248.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2025-02-06 03:49:50,569 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 226.5MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:49:50,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.36ms. Allocated memory is still 167.8MB. Free memory was 130.1MB in the beginning and 113.1MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:49:50,570 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.28ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 108.3MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:49:50,570 INFO L158 Benchmark]: Boogie Preprocessor took 32.73ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 105.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:49:50,570 INFO L158 Benchmark]: IcfgBuilder took 631.80ms. Allocated memory is still 167.8MB. Free memory was 105.6MB in the beginning and 69.3MB in the end (delta: 36.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 03:49:50,570 INFO L158 Benchmark]: TraceAbstraction took 6435.88ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 69.3MB in the beginning and 378.5MB in the end (delta: -309.3MB). Peak memory consumption was 205.6MB. Max. memory is 16.1GB. [2025-02-06 03:49:50,570 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 444.6MB. Free memory was 378.5MB in the beginning and 378.4MB in the end (delta: 138.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:49:50,571 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.76ms. Allocated memory is still 226.5MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.36ms. Allocated memory is still 167.8MB. Free memory was 130.1MB in the beginning and 113.1MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.28ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 108.3MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.73ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 105.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 631.80ms. Allocated memory is still 167.8MB. Free memory was 105.6MB in the beginning and 69.3MB in the end (delta: 36.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6435.88ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 69.3MB in the beginning and 378.5MB in the end (delta: -309.3MB). Peak memory consumption was 205.6MB. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 444.6MB. Free memory was 378.5MB in the beginning and 378.4MB in the end (delta: 138.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 64, overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 81. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 1, 63.75, 255.75, 10, 4, -10, 4.75, 99.5, 255.9, 24.85, -2, 1629954775, 1928642731, 0, 5 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] FCALL updateLastVariables() [L115] CALL updateVariables() [L80] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L81] EXPR WrapperStruct00.var_1_2 [L81] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F [L81] EXPR WrapperStruct00.var_1_2 [L81] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L81] EXPR (WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L81] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 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] [L81] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L82] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L83] EXPR WrapperStruct00.var_1_3 [L83] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F [L83] EXPR WrapperStruct00.var_1_3 [L83] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L83] EXPR (WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L83] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 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] [L83] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L84] WrapperStruct00.var_1_5 = __VERIFIER_nondet_char() [L85] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= -1) 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_5 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1] [L86] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) 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_5 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L87] WrapperStruct00.var_1_6 = __VERIFIER_nondet_char() [L88] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) 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_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L91] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) 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_7 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L94] EXPR WrapperStruct00.var_1_9 [L94] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_9 [L94] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L94] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 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_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L96] EXPR WrapperStruct00.var_1_10 [L96] EXPR WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_10 [L96] EXPR WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L96] EXPR (WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && 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] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && 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] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && 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] [L97] WrapperStruct00.var_1_13 = __VERIFIER_nondet_long() [L98] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 1073741822) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 1073741822) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483646) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483646) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] WrapperStruct00.var_1_15 = __VERIFIER_nondet_long() [L101] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 2147483646) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 2147483646) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] RET updateVariables() [L116] CALL step() [L60] signed long int stepLocal_0 = -4; [L61] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=-4] [L61] COND TRUE stepLocal_0 < WrapperStruct00.var_1_6 [L62] EXPR WrapperStruct00.var_1_9 [L62] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L62] EXPR ((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10) [L62] EXPR WrapperStruct00.var_1_10 [L62] EXPR ((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10) VAL [WrapperStruct00={4:0}, isInitial=1] [L62] WrapperStruct00.var_1_8 = ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))) [L64] EXPR WrapperStruct00.var_1_9 [L64] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L64] EXPR ((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10) [L64] EXPR WrapperStruct00.var_1_9 [L64] EXPR ((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10) VAL [WrapperStruct00={4:0}, isInitial=1] [L64] WrapperStruct00.var_1_11 = ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))) [L65] EXPR WrapperStruct00.var_1_5 [L65] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_5 [L66] EXPR WrapperStruct00.var_1_6 [L66] WrapperStruct00.var_1_19 = WrapperStruct00.var_1_6 [L67] EXPR WrapperStruct00.var_1_2 [L67] EXPR WrapperStruct00.var_1_3 [L67] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L67] COND TRUE (WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) <= (- WrapperStruct00.var_1_8) [L68] EXPR WrapperStruct00.var_1_5 [L68] EXPR WrapperStruct00.var_1_6 [L68] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L68] EXPR (((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) < (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_7) [L68] EXPR WrapperStruct00.var_1_5 [L68] EXPR WrapperStruct00.var_1_6 [L68] EXPR (((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) < (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_7) VAL [WrapperStruct00={4:0}, isInitial=1] [L68] WrapperStruct00.var_1_1 = (((((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) < (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_7))) [L72] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L72] EXPR WrapperStruct00.var_1_6 | 5 VAL [WrapperStruct00={4:0}, isInitial=1] [L72] signed long int stepLocal_1 = WrapperStruct00.var_1_6 | 5; [L73] EXPR WrapperStruct00.var_1_5 [L73] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=5] [L73] EXPR ((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_7) [L73] EXPR WrapperStruct00.var_1_5 [L73] EXPR ((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_7) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=5] [L73] COND FALSE !(stepLocal_1 <= ((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_7)))) [L76] EXPR WrapperStruct00.var_1_6 [L76] EXPR WrapperStruct00.var_1_19 [L76] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L76] EXPR ((WrapperStruct00.var_1_19) < (WrapperStruct00.var_1_19)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_19) [L76] EXPR WrapperStruct00.var_1_19 [L76] EXPR ((WrapperStruct00.var_1_19) < (WrapperStruct00.var_1_19)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_19) VAL [WrapperStruct00={4:0}, isInitial=1] [L76] EXPR WrapperStruct00.var_1_19 [L76] WrapperStruct00.var_1_12 = (WrapperStruct00.var_1_6 + (((((WrapperStruct00.var_1_19) < (WrapperStruct00.var_1_19)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_19))) - WrapperStruct00.var_1_19)) [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR WrapperStruct00.var_1_2 [L107] EXPR WrapperStruct00.var_1_3 [L107] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR ((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) <= (- WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed char) (((((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) < (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_7))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5)) [L107] EXPR WrapperStruct00.var_1_1 [L107] EXPR WrapperStruct00.var_1_5 [L107] EXPR ((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) <= (- WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed char) (((((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) < (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_7))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR (((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) <= (- WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed char) (((((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) < (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_7))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5))) && ((-4 < WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR ((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) <= (- WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed char) (((((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) < (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_7))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5))) && ((-4 < WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_11 == ((float) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR (((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) <= (- WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed char) (((((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) < (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_7))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5))) && ((-4 < WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_11 == ((float) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10)))))) && (((WrapperStruct00.var_1_6 | 5) <= ((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_7)))) ? (WrapperStruct00.var_1_12 == ((signed long int) (((((WrapperStruct00.var_1_6) < ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_6) : ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_19)))) - (WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_5) < 0 ) ? -(WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_5))))))) : (WrapperStruct00.var_1_12 == ((signed long int) (WrapperStruct00.var_1_6 + (((((WrapperStruct00.var_1_19) < (WrapperStruct00.var_1_19)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_19))) - WrapperStruct00.var_1_19))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR ((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) <= (- WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed char) (((((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) < (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_7))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5))) && ((-4 < WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_11 == ((float) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10)))))) && (((WrapperStruct00.var_1_6 | 5) <= ((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_7)))) ? (WrapperStruct00.var_1_12 == ((signed long int) (((((WrapperStruct00.var_1_6) < ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_6) : ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_19)))) - (WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_5) < 0 ) ? -(WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_5))))))) : (WrapperStruct00.var_1_12 == ((signed long int) (WrapperStruct00.var_1_6 + (((((WrapperStruct00.var_1_19) < (WrapperStruct00.var_1_19)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_19))) - WrapperStruct00.var_1_19)))))) && (WrapperStruct00.var_1_18 == ((signed short int) WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR (((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) <= (- WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed char) (((((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) < (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_7))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5))) && ((-4 < WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_11 == ((float) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10)))))) && (((WrapperStruct00.var_1_6 | 5) <= ((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_7)))) ? (WrapperStruct00.var_1_12 == ((signed long int) (((((WrapperStruct00.var_1_6) < ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_6) : ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_19)))) - (WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_5) < 0 ) ? -(WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_5))))))) : (WrapperStruct00.var_1_12 == ((signed long int) (WrapperStruct00.var_1_6 + (((((WrapperStruct00.var_1_19) < (WrapperStruct00.var_1_19)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_19))) - WrapperStruct00.var_1_19)))))) && (WrapperStruct00.var_1_18 == ((signed short int) WrapperStruct00.var_1_5))) && (WrapperStruct00.var_1_19 == ((unsigned short int) WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1] [L107-L108] return (((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) <= (- WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed char) (((((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) < (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_7))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_5))) && ((-4 < WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_11 == ((float) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10)))))) && (((WrapperStruct00.var_1_6 | 5) <= ((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_7)))) ? (WrapperStruct00.var_1_12 == ((signed long int) (((((WrapperStruct00.var_1_6) < ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_6) : ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_19)))) - (WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_5) < 0 ) ? -(WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_5))))))) : (WrapperStruct00.var_1_12 == ((signed long int) (WrapperStruct00.var_1_6 + (((((WrapperStruct00.var_1_19) < (WrapperStruct00.var_1_19)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_19))) - WrapperStruct00.var_1_19)))))) && (WrapperStruct00.var_1_18 == ((signed short int) WrapperStruct00.var_1_5))) && (WrapperStruct00.var_1_19 == ((unsigned short int) WrapperStruct00.var_1_6)) ; [L117] RET, EXPR property() [L117] 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, 122 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 8, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 552 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 551 mSDsluCounter, 3293 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2127 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1328 IncrementalHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 1166 mSDtfsCounter, 1328 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=372occurred in iteration=5, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 95 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1182 NumberOfCodeBlocks, 1182 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1040 ConstructedInterpolants, 0 QuantifiedInterpolants, 1478 SizeOfPredicates, 0 NumberOfNonLiveVariables, 515 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 2886/2912 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-02-06 03:49:50,593 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-28.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 e1d78d248c74132bd311292745f8a4e0496a51de00b4b221480ef3ff016a6c65 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:49:52,774 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:49:52,865 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:49:52,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:49:52,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:49:52,895 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:49:52,896 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:49:52,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:49:52,897 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:49:52,897 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:49:52,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:49:52,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:49:52,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:49:52,898 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:49:52,898 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:49:52,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:49:52,899 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:49:52,899 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:49:52,899 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:49:52,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:49:52,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:49:52,899 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:49:52,899 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:49:52,899 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:49:52,899 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:49:52,899 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:49:52,899 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:49:52,899 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:49:52,899 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:49:52,900 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:49:52,900 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:49:52,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:49:52,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:49:52,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:49:52,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:49:52,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:49:52,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:49:52,900 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:49:52,900 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:49:52,900 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:49:52,900 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:49:52,900 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:49:52,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:49:52,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:49:52,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:49:52,900 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 -> e1d78d248c74132bd311292745f8a4e0496a51de00b4b221480ef3ff016a6c65 [2025-02-06 03:49:53,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:49:53,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:49:53,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:49:53,207 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:49:53,207 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:49:53,209 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-28.i [2025-02-06 03:49:54,518 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d8593c00/636079e9698b4ed1b4a5d0969487baa7/FLAGefce06775 [2025-02-06 03:49:54,715 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:49:54,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-28.i [2025-02-06 03:49:54,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d8593c00/636079e9698b4ed1b4a5d0969487baa7/FLAGefce06775 [2025-02-06 03:49:54,738 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d8593c00/636079e9698b4ed1b4a5d0969487baa7 [2025-02-06 03:49:54,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:49:54,742 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:49:54,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:49:54,743 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:49:54,746 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:49:54,747 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:49:54" (1/1) ... [2025-02-06 03:49:54,749 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69cf25d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:54, skipping insertion in model container [2025-02-06 03:49:54,749 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:49:54" (1/1) ... [2025-02-06 03:49:54,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:49:54,873 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-28.i[916,929] [2025-02-06 03:49:54,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:49:54,938 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:49:54,948 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-28.i[916,929] [2025-02-06 03:49:54,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:49:55,002 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:49:55,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:55 WrapperNode [2025-02-06 03:49:55,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:49:55,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:49:55,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:49:55,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:49:55,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:55" (1/1) ... [2025-02-06 03:49:55,027 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:55" (1/1) ... [2025-02-06 03:49:55,052 INFO L138 Inliner]: procedures = 37, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 549 [2025-02-06 03:49:55,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:49:55,053 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:49:55,053 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:49:55,053 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:49:55,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:55" (1/1) ... [2025-02-06 03:49:55,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:55" (1/1) ... [2025-02-06 03:49:55,065 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:55" (1/1) ... [2025-02-06 03:49:55,078 INFO L175 MemorySlicer]: Split 153 memory accesses to 2 slices as follows [2, 151]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 33 writes are split as follows [0, 33]. [2025-02-06 03:49:55,078 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:55" (1/1) ... [2025-02-06 03:49:55,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:55" (1/1) ... [2025-02-06 03:49:55,092 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:55" (1/1) ... [2025-02-06 03:49:55,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:55" (1/1) ... [2025-02-06 03:49:55,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:55" (1/1) ... [2025-02-06 03:49:55,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:55" (1/1) ... [2025-02-06 03:49:55,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:49:55,104 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:49:55,105 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:49:55,105 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:49:55,105 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:55" (1/1) ... [2025-02-06 03:49:55,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:49:55,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:49:55,135 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-02-06 03:49:55,137 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-02-06 03:49:55,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:49:55,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:49:55,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:49:55,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:49:55,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:49:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:49:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:49:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:49:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:49:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:49:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:49:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-02-06 03:49:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-02-06 03:49:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:49:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:49:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-02-06 03:49:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-02-06 03:49:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-02-06 03:49:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-02-06 03:49:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:49:55,154 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:49:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-02-06 03:49:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-02-06 03:49:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:49:55,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:49:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:49:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:49:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:49:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:49:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:49:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:49:55,276 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:49:55,278 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:49:56,929 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~ite113#1;havoc property_#t~mem110#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite109#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~mem114#1;havoc property_#t~ite121#1;havoc property_#t~mem120#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~short122#1;havoc property_#t~mem128#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite127#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~short129#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~mem132#1;havoc property_#t~ite135#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~ite157#1;havoc property_#t~mem148#1;havoc property_#t~mem138#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~ite142#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~mem141#1;havoc property_#t~mem147#1;havoc property_#t~mem143#1;havoc property_#t~ite146#1;havoc property_#t~mem144#1;havoc property_#t~mem145#1;havoc property_#t~mem156#1;havoc property_#t~mem155#1;havoc property_#t~mem149#1;havoc property_#t~mem150#1;havoc property_#t~ite153#1;havoc property_#t~mem151#1;havoc property_#t~mem152#1;havoc property_#t~mem154#1;havoc property_#t~short158#1;havoc property_#t~mem160#1;havoc property_#t~mem159#1;havoc property_#t~short161#1;havoc property_#t~mem163#1;havoc property_#t~mem162#1;havoc property_#t~short164#1; [2025-02-06 03:49:56,968 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2025-02-06 03:49:56,968 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:49:56,978 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:49:56,978 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:49:56,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:49:56 BoogieIcfgContainer [2025-02-06 03:49:56,978 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:49:56,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:49:56,981 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:49:56,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:49:56,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:49:54" (1/3) ... [2025-02-06 03:49:56,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a3f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:49:56, skipping insertion in model container [2025-02-06 03:49:56,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:49:55" (2/3) ... [2025-02-06 03:49:56,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a3f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:49:56, skipping insertion in model container [2025-02-06 03:49:56,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:49:56" (3/3) ... [2025-02-06 03:49:56,988 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-28.i [2025-02-06 03:49:56,996 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:49:56,997 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-28.i that has 2 procedures, 114 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:49:57,053 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:49:57,065 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;@4fbfd649, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:49:57,065 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:49:57,076 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 97 states have (on average 1.422680412371134) internal successors, (138), 98 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:49:57,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 03:49:57,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:57,091 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:49:57,092 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:57,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:57,097 INFO L85 PathProgramCache]: Analyzing trace with hash 509694399, now seen corresponding path program 1 times [2025-02-06 03:49:57,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:49:57,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420586295] [2025-02-06 03:49:57,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:57,106 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-02-06 03:49:57,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:49:57,110 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-02-06 03:49:57,111 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-02-06 03:49:57,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 03:49:57,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 03:49:57,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:57,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:57,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:49:57,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:49:57,474 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-02-06 03:49:57,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:49:57,475 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:49:57,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420586295] [2025-02-06 03:49:57,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420586295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:57,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:57,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:49:57,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211742760] [2025-02-06 03:49:57,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:57,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:49:57,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:49:57,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:49:57,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:49:57,503 INFO L87 Difference]: Start difference. First operand has 114 states, 97 states have (on average 1.422680412371134) internal successors, (138), 98 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:49:57,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:57,535 INFO L93 Difference]: Finished difference Result 222 states and 341 transitions. [2025-02-06 03:49:57,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:49:57,537 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2025-02-06 03:49:57,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:57,545 INFO L225 Difference]: With dead ends: 222 [2025-02-06 03:49:57,546 INFO L226 Difference]: Without dead ends: 111 [2025-02-06 03:49:57,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 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-02-06 03:49:57,553 INFO L435 NwaCegarLoop]: 161 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, 161 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-02-06 03:49:57,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:49:57,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-06 03:49:57,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-02-06 03:49:57,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:49:57,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2025-02-06 03:49:57,591 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 128 [2025-02-06 03:49:57,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:57,591 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2025-02-06 03:49:57,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:49:57,591 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2025-02-06 03:49:57,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 03:49:57,595 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:57,595 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:49:57,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 03:49:57,795 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-02-06 03:49:57,796 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:57,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:57,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1124142263, now seen corresponding path program 1 times [2025-02-06 03:49:57,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:49:57,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906990992] [2025-02-06 03:49:57,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:57,798 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-02-06 03:49:57,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:49:57,801 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-02-06 03:49:57,802 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-02-06 03:49:57,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 03:49:58,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 03:49:58,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:58,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:58,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:49:58,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:49:58,196 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:49:58,196 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:49:58,196 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:49:58,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906990992] [2025-02-06 03:49:58,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906990992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:58,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:58,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:49:58,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458241276] [2025-02-06 03:49:58,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:58,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:49:58,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:49:58,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:49:58,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:49:58,198 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:49:58,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:58,294 INFO L93 Difference]: Finished difference Result 226 states and 329 transitions. [2025-02-06 03:49:58,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:49:58,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 128 [2025-02-06 03:49:58,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:58,301 INFO L225 Difference]: With dead ends: 226 [2025-02-06 03:49:58,301 INFO L226 Difference]: Without dead ends: 118 [2025-02-06 03:49:58,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:49:58,302 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:58,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 749 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:49:58,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-06 03:49:58,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-02-06 03:49:58,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.3762376237623761) internal successors, (139), 101 states have internal predecessors, (139), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:49:58,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 167 transitions. [2025-02-06 03:49:58,319 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 167 transitions. Word has length 128 [2025-02-06 03:49:58,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:58,321 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 167 transitions. [2025-02-06 03:49:58,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:49:58,321 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 167 transitions. [2025-02-06 03:49:58,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 03:49:58,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:58,322 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:49:58,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-06 03:49:58,522 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-02-06 03:49:58,522 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:58,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:58,523 INFO L85 PathProgramCache]: Analyzing trace with hash -236638582, now seen corresponding path program 1 times [2025-02-06 03:49:58,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:49:58,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483953287] [2025-02-06 03:49:58,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:58,526 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-02-06 03:49:58,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:49:58,529 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-02-06 03:49:58,531 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-02-06 03:49:58,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 03:49:58,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 03:49:58,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:58,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:58,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:49:58,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:49:58,940 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:49:58,942 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:49:58,942 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:49:58,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483953287] [2025-02-06 03:49:58,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1483953287] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:58,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:58,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:49:58,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374453649] [2025-02-06 03:49:58,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:58,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:49:58,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:49:58,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:49:58,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:49:58,943 INFO L87 Difference]: Start difference. First operand 117 states and 167 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:49:59,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:49:59,020 INFO L93 Difference]: Finished difference Result 234 states and 335 transitions. [2025-02-06 03:49:59,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:49:59,021 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 128 [2025-02-06 03:49:59,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:49:59,023 INFO L225 Difference]: With dead ends: 234 [2025-02-06 03:49:59,023 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 03:49:59,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:49:59,025 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:49:59,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 892 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:49:59,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 03:49:59,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-02-06 03:49:59,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3689320388349515) internal successors, (141), 103 states have internal predecessors, (141), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:49:59,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 169 transitions. [2025-02-06 03:49:59,040 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 169 transitions. Word has length 128 [2025-02-06 03:49:59,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:49:59,041 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 169 transitions. [2025-02-06 03:49:59,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:49:59,041 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 169 transitions. [2025-02-06 03:49:59,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 03:49:59,042 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:49:59,042 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:49:59,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-06 03:49:59,243 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-02-06 03:49:59,243 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:49:59,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:49:59,244 INFO L85 PathProgramCache]: Analyzing trace with hash -235715061, now seen corresponding path program 1 times [2025-02-06 03:49:59,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:49:59,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899022330] [2025-02-06 03:49:59,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:49:59,249 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-02-06 03:49:59,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:49:59,251 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-02-06 03:49:59,253 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-02-06 03:49:59,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 03:49:59,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 03:49:59,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:49:59,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:49:59,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:49:59,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:49:59,718 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-02-06 03:49:59,757 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:49:59,757 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:49:59,758 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:49:59,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899022330] [2025-02-06 03:49:59,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899022330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:49:59,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:49:59,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:49:59,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948422463] [2025-02-06 03:49:59,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:49:59,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:49:59,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:49:59,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:49:59,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:49:59,760 INFO L87 Difference]: Start difference. First operand 119 states and 169 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:50:01,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:01,279 INFO L93 Difference]: Finished difference Result 236 states and 336 transitions. [2025-02-06 03:50:01,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:50:01,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 128 [2025-02-06 03:50:01,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:01,281 INFO L225 Difference]: With dead ends: 236 [2025-02-06 03:50:01,281 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 03:50:01,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 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-02-06 03:50:01,282 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 156 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:01,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 461 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 03:50:01,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 03:50:01,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-02-06 03:50:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3592233009708738) internal successors, (140), 103 states have internal predecessors, (140), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:50:01,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 168 transitions. [2025-02-06 03:50:01,289 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 168 transitions. Word has length 128 [2025-02-06 03:50:01,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:01,289 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 168 transitions. [2025-02-06 03:50:01,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:50:01,290 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 168 transitions. [2025-02-06 03:50:01,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-06 03:50:01,291 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:01,291 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:50:01,304 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-02-06 03:50:01,492 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-02-06 03:50:01,492 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:01,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:01,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1497859512, now seen corresponding path program 1 times [2025-02-06 03:50:01,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:50:01,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47595640] [2025-02-06 03:50:01,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:01,493 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-02-06 03:50:01,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:50:01,502 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-02-06 03:50:01,503 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-02-06 03:50:01,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 03:50:01,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 03:50:01,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:01,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:01,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:50:01,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:50:01,844 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:50:01,845 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:50:01,845 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:50:01,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47595640] [2025-02-06 03:50:01,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [47595640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:01,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:50:01,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:50:01,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975111773] [2025-02-06 03:50:01,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:01,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:50:01,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:50:01,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:50:01,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:50:01,847 INFO L87 Difference]: Start difference. First operand 119 states and 168 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:50:02,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:02,013 INFO L93 Difference]: Finished difference Result 237 states and 336 transitions. [2025-02-06 03:50:02,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:50:02,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2025-02-06 03:50:02,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:02,015 INFO L225 Difference]: With dead ends: 237 [2025-02-06 03:50:02,015 INFO L226 Difference]: Without dead ends: 119 [2025-02-06 03:50:02,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:50:02,015 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:02,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 678 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:50:02,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-06 03:50:02,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-02-06 03:50:02,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 103 states have internal predecessors, (139), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:50:02,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 167 transitions. [2025-02-06 03:50:02,021 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 167 transitions. Word has length 130 [2025-02-06 03:50:02,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:02,021 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 167 transitions. [2025-02-06 03:50:02,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:50:02,021 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 167 transitions. [2025-02-06 03:50:02,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-06 03:50:02,022 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:02,022 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:50:02,031 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-02-06 03:50:02,226 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-02-06 03:50:02,226 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:02,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:02,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1674828585, now seen corresponding path program 1 times [2025-02-06 03:50:02,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:50:02,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [18233013] [2025-02-06 03:50:02,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:02,227 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-02-06 03:50:02,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:50:02,229 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-02-06 03:50:02,231 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-02-06 03:50:02,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 03:50:02,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 03:50:02,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:02,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:02,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:50:02,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:50:02,607 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-02-06 03:50:02,627 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 03:50:02,627 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:50:02,627 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:50:02,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [18233013] [2025-02-06 03:50:02,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [18233013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:02,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:50:02,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:50:02,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332439047] [2025-02-06 03:50:02,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:02,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:50:02,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:50:02,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:50:02,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:50:02,629 INFO L87 Difference]: Start difference. First operand 119 states and 167 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:50:03,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:03,993 INFO L93 Difference]: Finished difference Result 236 states and 332 transitions. [2025-02-06 03:50:03,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:50:03,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2025-02-06 03:50:03,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:03,995 INFO L225 Difference]: With dead ends: 236 [2025-02-06 03:50:03,995 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 03:50:03,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:50:03,995 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 142 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:03,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 452 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 03:50:03,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 03:50:04,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-02-06 03:50:04,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:50:04,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 166 transitions. [2025-02-06 03:50:04,001 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 166 transitions. Word has length 130 [2025-02-06 03:50:04,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:04,001 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 166 transitions. [2025-02-06 03:50:04,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:50:04,001 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 166 transitions. [2025-02-06 03:50:04,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:50:04,002 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:04,002 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:50:04,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-02-06 03:50:04,203 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-02-06 03:50:04,203 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:04,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:04,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1845053835, now seen corresponding path program 1 times [2025-02-06 03:50:04,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:50:04,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755671535] [2025-02-06 03:50:04,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:04,205 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-02-06 03:50:04,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:50:04,206 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-02-06 03:50:04,207 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-02-06 03:50:04,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:50:04,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:50:04,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:04,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:04,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:50:04,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:50:04,602 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 21 treesize of output 9 [2025-02-06 03:50:04,626 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:50:04,627 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:50:04,627 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:50:04,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [755671535] [2025-02-06 03:50:04,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [755671535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:04,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:50:04,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:50:04,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956172947] [2025-02-06 03:50:04,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:04,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:50:04,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:50:04,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:50:04,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:50:04,630 INFO L87 Difference]: Start difference. First operand 119 states and 166 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:50:04,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:04,674 INFO L93 Difference]: Finished difference Result 235 states and 329 transitions. [2025-02-06 03:50:04,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:50:04,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 132 [2025-02-06 03:50:04,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:04,677 INFO L225 Difference]: With dead ends: 235 [2025-02-06 03:50:04,677 INFO L226 Difference]: Without dead ends: 119 [2025-02-06 03:50:04,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:50:04,678 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:04,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 308 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:50:04,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-06 03:50:04,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-02-06 03:50:04,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3300970873786409) internal successors, (137), 103 states have internal predecessors, (137), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:50:04,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 165 transitions. [2025-02-06 03:50:04,687 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 165 transitions. Word has length 132 [2025-02-06 03:50:04,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:04,687 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 165 transitions. [2025-02-06 03:50:04,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:50:04,688 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 165 transitions. [2025-02-06 03:50:04,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:50:04,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:04,689 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:50:04,701 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 (8)] Forceful destruction successful, exit code 0 [2025-02-06 03:50:04,889 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-02-06 03:50:04,890 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:04,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:04,890 INFO L85 PathProgramCache]: Analyzing trace with hash 847981482, now seen corresponding path program 1 times [2025-02-06 03:50:04,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:50:04,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332191599] [2025-02-06 03:50:04,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:04,891 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-02-06 03:50:04,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:50:04,893 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-02-06 03:50:04,895 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-02-06 03:50:04,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:50:05,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:50:05,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:05,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:05,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 03:50:05,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:50:05,350 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 14 treesize of output 10 [2025-02-06 03:50:05,531 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 41 treesize of output 19 [2025-02-06 03:50:05,652 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 41 treesize of output 19 [2025-02-06 03:50:05,725 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 41 treesize of output 19 [2025-02-06 03:50:05,787 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 41 treesize of output 19 [2025-02-06 03:50:05,894 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 41 treesize of output 19 [2025-02-06 03:50:06,014 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 32 treesize of output 14 [2025-02-06 03:50:06,046 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 169 proven. 27 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-02-06 03:50:06,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:50:06,351 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 03:50:06,352 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:50:06,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332191599] [2025-02-06 03:50:06,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [332191599] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:50:06,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:50:06,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2025-02-06 03:50:06,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722359639] [2025-02-06 03:50:06,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:50:06,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:50:06,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:50:06,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:50:06,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:50:06,354 INFO L87 Difference]: Start difference. First operand 119 states and 165 transitions. Second operand has 13 states, 11 states have (on average 8.454545454545455) internal successors, (93), 12 states have internal predecessors, (93), 5 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 3 states have call predecessors, (24), 5 states have call successors, (24) [2025-02-06 03:50:08,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:50:10,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:50:12,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:12,449 INFO L93 Difference]: Finished difference Result 239 states and 330 transitions. [2025-02-06 03:50:12,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:50:12,450 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 8.454545454545455) internal successors, (93), 12 states have internal predecessors, (93), 5 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 3 states have call predecessors, (24), 5 states have call successors, (24) Word has length 132 [2025-02-06 03:50:12,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:12,451 INFO L225 Difference]: With dead ends: 239 [2025-02-06 03:50:12,451 INFO L226 Difference]: Without dead ends: 123 [2025-02-06 03:50:12,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:50:12,452 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 396 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:12,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 320 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-02-06 03:50:12,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-02-06 03:50:12,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-02-06 03:50:12,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 106 states have internal predecessors, (139), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:50:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 167 transitions. [2025-02-06 03:50:12,468 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 167 transitions. Word has length 132 [2025-02-06 03:50:12,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:12,468 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 167 transitions. [2025-02-06 03:50:12,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 8.454545454545455) internal successors, (93), 12 states have internal predecessors, (93), 5 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 3 states have call predecessors, (24), 5 states have call successors, (24) [2025-02-06 03:50:12,468 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 167 transitions. [2025-02-06 03:50:12,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:50:12,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:12,469 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:50:12,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-02-06 03:50:12,669 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-02-06 03:50:12,670 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:12,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:12,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1704036364, now seen corresponding path program 1 times [2025-02-06 03:50:12,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:50:12,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804507826] [2025-02-06 03:50:12,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:12,671 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-02-06 03:50:12,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:50:12,674 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-02-06 03:50:12,675 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-02-06 03:50:12,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:50:13,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:50:13,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:13,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:13,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 03:50:13,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:50:13,117 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 8 treesize of output 1 [2025-02-06 03:50:13,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-02-06 03:50:13,228 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 26 treesize of output 25 [2025-02-06 03:50:13,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:13,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2025-02-06 03:50:13,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:13,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2025-02-06 03:50:13,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:13,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2025-02-06 03:50:13,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:13,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2025-02-06 03:50:13,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:13,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2025-02-06 03:50:13,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:13,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 49 [2025-02-06 03:50:13,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:13,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 61 [2025-02-06 03:50:13,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:13,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 74 treesize of output 64 [2025-02-06 03:50:14,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:14,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 99 treesize of output 45 [2025-02-06 03:50:14,064 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 201 proven. 33 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-02-06 03:50:14,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:50:14,196 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:50:14,197 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:50:14,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804507826] [2025-02-06 03:50:14,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804507826] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:50:14,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:50:14,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 13 [2025-02-06 03:50:14,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767747833] [2025-02-06 03:50:14,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:14,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:50:14,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:50:14,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:50:14,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:50:14,198 INFO L87 Difference]: Start difference. First operand 123 states and 167 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:50:15,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:15,681 INFO L93 Difference]: Finished difference Result 317 states and 429 transitions. [2025-02-06 03:50:15,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:50:15,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 134 [2025-02-06 03:50:15,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:15,682 INFO L225 Difference]: With dead ends: 317 [2025-02-06 03:50:15,682 INFO L226 Difference]: Without dead ends: 197 [2025-02-06 03:50:15,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:50:15,683 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 79 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:15,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 496 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 03:50:15,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-06 03:50:15,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2025-02-06 03:50:15,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 174 states have (on average 1.3218390804597702) internal successors, (230), 175 states have internal predecessors, (230), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:50:15,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 262 transitions. [2025-02-06 03:50:15,690 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 262 transitions. Word has length 134 [2025-02-06 03:50:15,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:15,690 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 262 transitions. [2025-02-06 03:50:15,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:50:15,690 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 262 transitions. [2025-02-06 03:50:15,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:50:15,691 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:15,691 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:50:15,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2025-02-06 03:50:15,896 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-02-06 03:50:15,896 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:15,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:15,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1516085938, now seen corresponding path program 1 times [2025-02-06 03:50:15,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:50:15,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349364441] [2025-02-06 03:50:15,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:15,897 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-02-06 03:50:15,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:50:15,899 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-02-06 03:50:15,901 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-02-06 03:50:16,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:50:44,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:50:44,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:44,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:44,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-02-06 03:50:44,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:50:44,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 03:50:45,016 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 78 treesize of output 32 [2025-02-06 03:50:45,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:45,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 73 [2025-02-06 03:50:46,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:46,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 86 [2025-02-06 03:50:46,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:46,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 151 treesize of output 99 [2025-02-06 03:50:46,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 102 [2025-02-06 03:50:47,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:47,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 226 treesize of output 135 [2025-02-06 03:50:48,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:48,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 226 treesize of output 135 [2025-02-06 03:50:48,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:48,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 226 treesize of output 135 [2025-02-06 03:50:49,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:49,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 304 treesize of output 177 [2025-02-06 03:50:50,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 45 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 326 treesize of output 168 [2025-02-06 03:50:57,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:50:57,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 379 treesize of output 193 [2025-02-06 03:51:03,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:03,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 383 treesize of output 193 [2025-02-06 03:51:04,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:51:04,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 445 treesize of output 157 [2025-02-06 03:51:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 220 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-02-06 03:51:07,795 INFO L312 TraceCheckSpWp]: Computing backward predicates...